/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:51:49,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:51:49,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:51:49,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:51:49,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:51:49,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:51:49,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:51:49,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:51:49,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:51:49,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:51:49,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:51:49,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:51:49,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:51:49,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:51:49,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:51:49,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:51:49,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:51:49,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:51:49,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:51:49,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:51:49,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:51:49,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:51:49,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:51:49,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:51:49,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:51:49,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:51:49,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:51:49,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:51:49,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:51:49,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:51:49,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:51:49,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:51:49,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:51:49,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:51:49,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:51:49,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:51:49,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:51:49,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:51:49,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:51:49,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:51:49,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:51:49,246 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 03:51:49,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:51:49,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:51:49,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:51:49,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:51:49,275 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:51:49,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:51:49,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:51:49,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:51:49,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:51:49,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:51:49,277 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:51:49,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:51:49,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:51:49,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:51:49,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:51:49,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:51:49,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:51:49,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:51:49,278 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:51:49,278 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 03:51:49,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:51:49,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:51:49,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:51:49,568 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:51:49,570 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:51:49,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-6.i [2022-12-06 03:51:50,631 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:51:50,840 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:51:50,841 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-6.i [2022-12-06 03:51:50,862 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb97b450b/ef89db8eb47d42508e1ec50058f2bdfa/FLAG0585bbb89 [2022-12-06 03:51:50,872 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb97b450b/ef89db8eb47d42508e1ec50058f2bdfa [2022-12-06 03:51:50,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:51:50,875 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:51:50,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:51:50,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:51:50,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:51:50,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:51:50" (1/1) ... [2022-12-06 03:51:50,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16aacfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:50, skipping insertion in model container [2022-12-06 03:51:50,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:51:50" (1/1) ... [2022-12-06 03:51:50,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:51:50,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:51:51,144 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-6.i[30243,30256] [2022-12-06 03:51:51,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:51:51,171 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:51:51,198 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-6.i[30243,30256] [2022-12-06 03:51:51,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:51:51,248 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:51:51,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51 WrapperNode [2022-12-06 03:51:51,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:51:51,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:51:51,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:51:51,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:51:51,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,295 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-06 03:51:51,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:51:51,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:51:51,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:51:51,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:51:51,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,325 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:51:51,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:51:51,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:51:51,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:51:51,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:51:51,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:51,352 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 03:51:51,377 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 03:51:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 03:51:51,388 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 03:51:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 03:51:51,388 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 03:51:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:51:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:51:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:51:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:51:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:51:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:51:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:51:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:51:51,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:51:51,390 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 03:51:51,508 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:51:51,509 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:51:51,658 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:51:51,663 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:51:51,663 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:51:51,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:51:51 BoogieIcfgContainer [2022-12-06 03:51:51,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:51:51,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:51:51,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:51:51,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:51:51,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:51:50" (1/3) ... [2022-12-06 03:51:51,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452b63b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:51:51, skipping insertion in model container [2022-12-06 03:51:51,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (2/3) ... [2022-12-06 03:51:51,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452b63b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:51:51, skipping insertion in model container [2022-12-06 03:51:51,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:51:51" (3/3) ... [2022-12-06 03:51:51,670 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-6.i [2022-12-06 03:51:51,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:51:51,688 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:51:51,688 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:51:51,750 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 03:51:51,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 03:51:51,838 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 03:51:51,839 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:51,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 03:51:51,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 03:51:51,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:51,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:51,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:51,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:51,912 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 03:51:51,913 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:51,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 03:51:51,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:51,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 03:51:54,983 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-06 03:51:54,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:51:54,997 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;@6e27707d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:51:54,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:51:55,000 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-06 03:51:55,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:55,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-06 03:51:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:55,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024661480] [2022-12-06 03:51:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,230 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 03:51:55,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:55,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024661480] [2022-12-06 03:51:55,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024661480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:51:55,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:51:55,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:51:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019310175] [2022-12-06 03:51:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:51:55,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:51:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:51:55,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:51:55,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:55,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 34 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:55,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:55,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:55,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:55,314 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 03:51:55,315 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:51:55,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 149 events. 97/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 331 event pairs, 20 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 300. Up to 91 conditions per place. [2022-12-06 03:51:55,317 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-06 03:51:55,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-06 03:51:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:51:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:51:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 03:51:55,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 03:51:55,327 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-06 03:51:55,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-06 03:51:55,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:51:55,330 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=19, PETRI_TRANSITIONS=14} [2022-12-06 03:51:55,334 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 03:51:55,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:55,335 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:55,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:55,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,346 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 03:51:55,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:55,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 14 events. 3/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2022-12-06 03:51:55,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 03:51:55,348 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:51:55,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 03:51:55,352 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:55,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:51:55,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-06 03:51:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:55,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992214678] [2022-12-06 03:51:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,450 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 03:51:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:55,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992214678] [2022-12-06 03:51:55,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992214678] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:55,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318544130] [2022-12-06 03:51:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:55,453 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 03:51:55,467 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 03:51:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:55,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:55,576 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 03:51:55,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:55,587 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 03:51:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318544130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:55,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:55,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800060707] [2022-12-06 03:51:55,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:55,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:55,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:55,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 03:51:55,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:55,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:55,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 03:51:55,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:55,672 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:55,672 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:55,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 203 events. 133/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 03:51:55,673 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:55,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-06 03:51:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:55,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 03:51:55,675 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-06 03:51:55,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-06 03:51:55,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:51:55,676 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 03:51:55,676 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:55,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:55,676 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:55,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:55,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,683 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:55,683 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:55,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 03:51:55,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:55,931 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:55,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 03:51:55,932 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:55,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:55,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:56,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:56,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:56,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-06 03:51:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:56,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616808858] [2022-12-06 03:51:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,177 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 03:51:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:56,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616808858] [2022-12-06 03:51:56,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616808858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:56,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137049010] [2022-12-06 03:51:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:56,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:56,179 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 03:51:56,203 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 03:51:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:56,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:56,244 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 03:51:56,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:56,252 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 03:51:56,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137049010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:56,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:56,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633547976] [2022-12-06 03:51:56,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:56,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:56,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:56,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:56,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:56,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:56,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:56,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:56,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:56,316 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:56,317 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 03:51:56,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-06 03:51:56,318 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:56,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:56,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 03:51:56,319 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 03:51:56,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:56,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 03:51:56,321 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 03:51:56,322 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:56,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:56,322 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:56,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:56,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,325 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:56,325 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:56,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 03:51:56,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:56,511 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:56,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 03:51:56,512 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:56,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:56,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:56,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:56,520 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 03:51:56,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 03:51:56,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:56,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-06 03:51:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:56,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725253838] [2022-12-06 03:51:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,765 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 03:51:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:56,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725253838] [2022-12-06 03:51:56,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725253838] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:56,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345048524] [2022-12-06 03:51:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:56,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:56,770 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 03:51:56,799 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 03:51:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:56,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:56,854 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 03:51:56,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:56,862 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 03:51:56,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345048524] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:56,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:56,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:56,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725599733] [2022-12-06 03:51:56,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:56,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:56,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:56,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:56,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:56,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:56,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:56,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:56,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:56,929 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:56,929 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-06 03:51:56,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 176 events. 115/176 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 489. Up to 64 conditions per place. [2022-12-06 03:51:56,930 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:56,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-06 03:51:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:56,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:56,932 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-06 03:51:56,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-06 03:51:56,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 03:51:56,933 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:56,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 03:51:56,934 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:56,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:56,934 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:56,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:56,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:56,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:56,936 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:56,936 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:56,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 03:51:56,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:56,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:57,050 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:57,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 03:51:57,051 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:57,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:57,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:57,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:57,058 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 03:51:57,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,257 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149196, now seen corresponding path program 1 times [2022-12-06 03:51:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:57,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250925677] [2022-12-06 03:51:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,316 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 03:51:57,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:57,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250925677] [2022-12-06 03:51:57,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250925677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:57,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793894534] [2022-12-06 03:51:57,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:57,332 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 03:51:57,375 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 03:51:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:57,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:57,454 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 03:51:57,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:57,462 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 03:51:57,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793894534] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:57,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:57,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:57,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372001160] [2022-12-06 03:51:57,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:57,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:57,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:57,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:57,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:57,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:57,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:57,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:57,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:57,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:57,525 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:57,525 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 03:51:57,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 03:51:57,526 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:57,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:57,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:57,527 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 03:51:57,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:57,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 03:51:57,528 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 03:51:57,528 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:57,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:57,528 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:57,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:57,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,531 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:57,531 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:57,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 03:51:57,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:57,701 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:57,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 03:51:57,702 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:57,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:57,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:57,702 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:57,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 03:51:57,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149134, now seen corresponding path program 1 times [2022-12-06 03:51:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:57,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282965980] [2022-12-06 03:51:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,950 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 03:51:57,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:57,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282965980] [2022-12-06 03:51:57,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282965980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:57,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437981135] [2022-12-06 03:51:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:57,952 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 03:51:57,954 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 03:51:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:58,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:58,020 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 03:51:58,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437981135] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:58,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:58,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:58,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569486487] [2022-12-06 03:51:58,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:58,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:58,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:58,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:58,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:58,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:58,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:58,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:58,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:58,076 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:58,077 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 03:51:58,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 03:51:58,077 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:58,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:58,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:58,078 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 03:51:58,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:58,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 03:51:58,079 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 03:51:58,080 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:58,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:58,080 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:58,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:58,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,083 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:58,083 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:58,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 03:51:58,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:58,205 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:58,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 03:51:58,206 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:58,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:58,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:58,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:58,211 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 03:51:58,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,411 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149072, now seen corresponding path program 1 times [2022-12-06 03:51:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:58,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501135338] [2022-12-06 03:51:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,500 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 03:51:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:58,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501135338] [2022-12-06 03:51:58,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501135338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:58,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067314092] [2022-12-06 03:51:58,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:58,502 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 03:51:58,504 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 03:51:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:58,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:58,587 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 03:51:58,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:58,594 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 03:51:58,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067314092] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:58,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:58,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-06 03:51:58,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851692820] [2022-12-06 03:51:58,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:58,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:51:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:51:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:51:58,595 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:58,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:58,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:58,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:58,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:58,622 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 03:51:58,622 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 03:51:58,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 149 events. 97/149 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 20 based on Foata normal form. 9/126 useless extension candidates. Maximal degree in co-relation 399. Up to 64 conditions per place. [2022-12-06 03:51:58,623 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 03:51:58,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-06 03:51:58,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:51:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:51:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 03:51:58,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 03:51:58,624 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 4 states and 28 transitions. [2022-12-06 03:51:58,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-06 03:51:58,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 122 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 03:51:58,625 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-06 03:51:58,625 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 03:51:58,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:58,626 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,626 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:58,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:58,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,628 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 03:51:58,628 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:58,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 15 events. 3/15 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 24. Up to 5 conditions per place. [2022-12-06 03:51:58,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 03:51:58,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:51:58,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 03:51:58,690 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-06 03:51:58,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:58,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:58,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:58,703 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 03:51:58,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:58,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149041, now seen corresponding path program 1 times [2022-12-06 03:51:58,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:58,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548857915] [2022-12-06 03:51:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:59,036 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 03:51:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:59,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548857915] [2022-12-06 03:51:59,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548857915] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:59,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056776726] [2022-12-06 03:51:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:59,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:59,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:59,038 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 03:51:59,040 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 03:51:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:59,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:51:59,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:59,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:59,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056776726] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:59,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:59,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-06 03:51:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876987232] [2022-12-06 03:51:59,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:59,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:51:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:59,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:51:59,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:51:59,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:59,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 50 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:59,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:59,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:59,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:59,328 INFO L130 PetriNetUnfolder]: 265/405 cut-off events. [2022-12-06 03:51:59,328 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 03:51:59,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 405 events. 265/405 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1293 event pairs, 28 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 1045. Up to 167 conditions per place. [2022-12-06 03:51:59,330 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 46 selfloop transitions, 19 changer transitions 0/65 dead transitions. [2022-12-06 03:51:59,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 65 transitions, 326 flow [2022-12-06 03:51:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:51:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:51:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-06 03:51:59,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 03:51:59,331 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 50 flow. Second operand 8 states and 68 transitions. [2022-12-06 03:51:59,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 65 transitions, 326 flow [2022-12-06 03:51:59,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 65 transitions, 294 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 03:51:59,333 INFO L231 Difference]: Finished difference. Result has 27 places, 33 transitions, 159 flow [2022-12-06 03:51:59,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=159, PETRI_PLACES=27, PETRI_TRANSITIONS=33} [2022-12-06 03:51:59,333 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 9 predicate places. [2022-12-06 03:51:59,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:59,333 INFO L89 Accepts]: Start accepts. Operand has 27 places, 33 transitions, 159 flow [2022-12-06 03:51:59,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:59,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:59,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-06 03:51:59,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 33 transitions, 159 flow [2022-12-06 03:51:59,338 INFO L130 PetriNetUnfolder]: 35/73 cut-off events. [2022-12-06 03:51:59,338 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-06 03:51:59,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 73 events. 35/73 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 194 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 172. Up to 41 conditions per place. [2022-12-06 03:51:59,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-06 03:51:59,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 03:51:59,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:51:59,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:51:59,516 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:51:59,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:51:59,669 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:59,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 336 [2022-12-06 03:51:59,670 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 32 transitions, 174 flow [2022-12-06 03:51:59,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:59,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:59,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:59,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 03:51:59,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:59,874 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148855, now seen corresponding path program 1 times [2022-12-06 03:51:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:59,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274940119] [2022-12-06 03:51:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:59,891 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 03:51:59,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:59,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274940119] [2022-12-06 03:51:59,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274940119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:51:59,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:51:59,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:51:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89224326] [2022-12-06 03:51:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:51:59,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:51:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:51:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:51:59,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:51:59,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 32 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:59,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:59,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:51:59,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:59,927 INFO L130 PetriNetUnfolder]: 170/268 cut-off events. [2022-12-06 03:51:59,927 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-06 03:51:59,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 268 events. 170/268 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 813 event pairs, 63 based on Foata normal form. 8/276 useless extension candidates. Maximal degree in co-relation 766. Up to 155 conditions per place. [2022-12-06 03:51:59,928 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 25 selfloop transitions, 6 changer transitions 1/32 dead transitions. [2022-12-06 03:51:59,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 218 flow [2022-12-06 03:51:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:51:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:51:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 03:51:59,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 03:51:59,929 INFO L175 Difference]: Start difference. First operand has 26 places, 32 transitions, 174 flow. Second operand 3 states and 26 transitions. [2022-12-06 03:51:59,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 218 flow [2022-12-06 03:51:59,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 204 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 03:51:59,932 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 129 flow [2022-12-06 03:51:59,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-06 03:51:59,932 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 8 predicate places. [2022-12-06 03:51:59,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:59,932 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 129 flow [2022-12-06 03:51:59,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:59,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:59,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 129 flow [2022-12-06 03:51:59,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 129 flow [2022-12-06 03:51:59,940 INFO L130 PetriNetUnfolder]: 26/58 cut-off events. [2022-12-06 03:51:59,940 INFO L131 PetriNetUnfolder]: For 58/60 co-relation queries the response was YES. [2022-12-06 03:51:59,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 58 events. 26/58 cut-off events. For 58/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 134. Up to 33 conditions per place. [2022-12-06 03:51:59,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 129 flow [2022-12-06 03:51:59,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 03:51:59,942 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:51:59,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 03:51:59,943 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 129 flow [2022-12-06 03:51:59,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:59,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:59,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:59,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 03:51:59,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1106078639, now seen corresponding path program 1 times [2022-12-06 03:51:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:59,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125687947] [2022-12-06 03:51:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:59,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:00,078 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 03:52:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:00,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125687947] [2022-12-06 03:52:00,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125687947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:00,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299725490] [2022-12-06 03:52:00,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:00,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:00,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:00,080 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 03:52:00,082 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 03:52:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:00,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 03:52:00,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:00,185 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 03:52:00,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:00,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299725490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:00,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:00,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61331054] [2022-12-06 03:52:00,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:00,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:00,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:00,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:00,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:52:00,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 129 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:00,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:00,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:52:00,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:00,533 INFO L130 PetriNetUnfolder]: 350/539 cut-off events. [2022-12-06 03:52:00,534 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2022-12-06 03:52:00,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 539 events. 350/539 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1929 event pairs, 25 based on Foata normal form. 20/559 useless extension candidates. Maximal degree in co-relation 1556. Up to 219 conditions per place. [2022-12-06 03:52:00,536 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-06 03:52:00,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 101 transitions, 604 flow [2022-12-06 03:52:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:52:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:52:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-12-06 03:52:00,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-06 03:52:00,537 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 129 flow. Second operand 12 states and 100 transitions. [2022-12-06 03:52:00,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 101 transitions, 604 flow [2022-12-06 03:52:00,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 101 transitions, 576 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:00,540 INFO L231 Difference]: Finished difference. Result has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:00,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=385, PETRI_PLACES=37, PETRI_TRANSITIONS=55} [2022-12-06 03:52:00,541 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-06 03:52:00,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:00,541 INFO L89 Accepts]: Start accepts. Operand has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:00,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:00,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:00,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:00,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:00,549 INFO L130 PetriNetUnfolder]: 52/109 cut-off events. [2022-12-06 03:52:00,549 INFO L131 PetriNetUnfolder]: For 130/134 co-relation queries the response was YES. [2022-12-06 03:52:00,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 109 events. 52/109 cut-off events. For 130/134 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 355 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 339. Up to 72 conditions per place. [2022-12-06 03:52:00,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:00,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-06 03:52:00,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [348] L705-6-->L687-5: Formula: (and (= (+ (* 144 v_~prev~0_170) v_~prev~0_169 (* 233 v_~cur~0_141)) v_~next~0_89) (= (+ v_~j~0_125 v_~i~0_110) v_~i~0_109) (= (+ (* 377 v_~cur~0_141) (* 233 v_~prev~0_170)) v_~prev~0_169) (= v_~p~0_43 (+ v_~p~0_44 1)) (< v_~x~0_156 1) (= (+ 14 v_~x~0_156) v_~x~0_155) (< v_~p~0_44 6) (= v_~cur~0_140 v_~next~0_89)) InVars {~j~0=v_~j~0_125, ~prev~0=v_~prev~0_170, ~i~0=v_~i~0_110, ~p~0=v_~p~0_44, ~cur~0=v_~cur~0_141, ~x~0=v_~x~0_156} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_95|, ~j~0=v_~j~0_125, ~next~0=v_~next~0_89, ~prev~0=v_~prev~0_169, ~i~0=v_~i~0_109, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_30|, ~p~0=v_~p~0_43, ~cur~0=v_~cur~0_140, ~x~0=v_~x~0_155} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (< v_~x~0_22 14) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-06 03:52:00,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (< v_~x~0_22 14) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-06 03:52:00,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [345] L705-6-->L687-5: Formula: (and (= v_~next~0_81 (+ (* 233 v_~cur~0_127) v_~prev~0_155 (* 144 v_~prev~0_156))) (= (+ v_~j~0_119 v_~i~0_104) v_~i~0_103) (= v_~cur~0_126 v_~next~0_81) (< v_~p~0_40 6) (= v_~p~0_39 (+ v_~p~0_40 1)) (< v_~x~0_142 1) (= (+ 14 v_~x~0_142) v_~x~0_141) (= (+ (* 377 v_~cur~0_127) (* 233 v_~prev~0_156)) v_~prev~0_155)) InVars {~j~0=v_~j~0_119, ~prev~0=v_~prev~0_156, ~i~0=v_~i~0_104, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_142} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~j~0=v_~j~0_119, ~next~0=v_~next~0_81, ~prev~0=v_~prev~0_155, ~i~0=v_~i~0_103, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_28|, ~p~0=v_~p~0_39, ~cur~0=v_~cur~0_126, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:52:00,885 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:52:00,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 345 [2022-12-06 03:52:00,886 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 55 transitions, 403 flow [2022-12-06 03:52:00,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:00,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:00,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:00,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:01,086 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,SelfDestructingSolverStorable9 [2022-12-06 03:52:01,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1421157024, now seen corresponding path program 1 times [2022-12-06 03:52:01,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:01,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657911248] [2022-12-06 03:52:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:01,107 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 03:52:01,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:01,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657911248] [2022-12-06 03:52:01,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657911248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:01,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:01,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:52:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90536677] [2022-12-06 03:52:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:01,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:52:01,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:52:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:52:01,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:52:01,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 55 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:01,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:01,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:52:01,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:01,152 INFO L130 PetriNetUnfolder]: 285/446 cut-off events. [2022-12-06 03:52:01,153 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-06 03:52:01,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 446 events. 285/446 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1559 event pairs, 111 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 1520. Up to 251 conditions per place. [2022-12-06 03:52:01,155 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 47 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2022-12-06 03:52:01,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 511 flow [2022-12-06 03:52:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:52:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:52:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 03:52:01,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 03:52:01,155 INFO L175 Difference]: Start difference. First operand has 37 places, 55 transitions, 403 flow. Second operand 3 states and 30 transitions. [2022-12-06 03:52:01,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 511 flow [2022-12-06 03:52:01,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 439 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:01,158 INFO L231 Difference]: Finished difference. Result has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:01,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=37, PETRI_TRANSITIONS=50} [2022-12-06 03:52:01,159 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-06 03:52:01,159 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:01,159 INFO L89 Accepts]: Start accepts. Operand has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:01,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:01,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:01,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:01,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:01,164 INFO L130 PetriNetUnfolder]: 43/92 cut-off events. [2022-12-06 03:52:01,165 INFO L131 PetriNetUnfolder]: For 159/168 co-relation queries the response was YES. [2022-12-06 03:52:01,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 92 events. 43/92 cut-off events. For 159/168 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 272 event pairs, 0 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 258. Up to 45 conditions per place. [2022-12-06 03:52:01,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:01,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 03:52:01,166 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:01,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 03:52:01,166 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:01,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:01,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:01,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:01,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 03:52:01,167 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1105095598, now seen corresponding path program 1 times [2022-12-06 03:52:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:01,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649819082] [2022-12-06 03:52:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:01,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649819082] [2022-12-06 03:52:01,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649819082] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970804102] [2022-12-06 03:52:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:01,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:01,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:01,257 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 03:52:01,263 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 03:52:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:01,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 03:52:01,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:01,377 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 03:52:01,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:01,451 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 03:52:01,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970804102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:01,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:01,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501997725] [2022-12-06 03:52:01,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:01,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:01,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:01,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 50 transitions, 321 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:01,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:01,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:01,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:01,702 INFO L130 PetriNetUnfolder]: 497/766 cut-off events. [2022-12-06 03:52:01,702 INFO L131 PetriNetUnfolder]: For 1305/1305 co-relation queries the response was YES. [2022-12-06 03:52:01,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 766 events. 497/766 cut-off events. For 1305/1305 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3084 event pairs, 29 based on Foata normal form. 20/772 useless extension candidates. Maximal degree in co-relation 2431. Up to 279 conditions per place. [2022-12-06 03:52:01,706 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 58 selfloop transitions, 65 changer transitions 0/123 dead transitions. [2022-12-06 03:52:01,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 850 flow [2022-12-06 03:52:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:52:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:52:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-06 03:52:01,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 03:52:01,718 INFO L175 Difference]: Start difference. First operand has 37 places, 50 transitions, 321 flow. Second operand 10 states and 96 transitions. [2022-12-06 03:52:01,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 123 transitions, 850 flow [2022-12-06 03:52:01,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 123 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:01,723 INFO L231 Difference]: Finished difference. Result has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:01,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=635, PETRI_PLACES=47, PETRI_TRANSITIONS=79} [2022-12-06 03:52:01,739 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 29 predicate places. [2022-12-06 03:52:01,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:01,739 INFO L89 Accepts]: Start accepts. Operand has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:01,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:01,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:01,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:01,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:01,749 INFO L130 PetriNetUnfolder]: 77/159 cut-off events. [2022-12-06 03:52:01,749 INFO L131 PetriNetUnfolder]: For 353/362 co-relation queries the response was YES. [2022-12-06 03:52:01,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 159 events. 77/159 cut-off events. For 353/362 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 631 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 578. Up to 96 conditions per place. [2022-12-06 03:52:01,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:01,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 03:52:01,751 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:01,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 03:52:01,752 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:01,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:01,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:01,752 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:01,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:01,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:01,956 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1106189898, now seen corresponding path program 1 times [2022-12-06 03:52:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:01,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945611846] [2022-12-06 03:52:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:01,982 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 03:52:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945611846] [2022-12-06 03:52:01,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945611846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525918994] [2022-12-06 03:52:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:01,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:01,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:01,983 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 03:52:02,015 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 03:52:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:02,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:52:02,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:02,084 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 03:52:02,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:02,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525918994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:02,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:02,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 03:52:02,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358690916] [2022-12-06 03:52:02,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:02,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:52:02,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:02,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:52:02,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:52:02,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:02,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 79 transitions, 635 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:02,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:02,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:02,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:02,168 INFO L130 PetriNetUnfolder]: 382/627 cut-off events. [2022-12-06 03:52:02,168 INFO L131 PetriNetUnfolder]: For 1660/1660 co-relation queries the response was YES. [2022-12-06 03:52:02,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 627 events. 382/627 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2652 event pairs, 163 based on Foata normal form. 67/683 useless extension candidates. Maximal degree in co-relation 2205. Up to 359 conditions per place. [2022-12-06 03:52:02,171 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 58 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-06 03:52:02,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 703 flow [2022-12-06 03:52:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:52:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:52:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 03:52:02,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-06 03:52:02,172 INFO L175 Difference]: Start difference. First operand has 47 places, 79 transitions, 635 flow. Second operand 4 states and 29 transitions. [2022-12-06 03:52:02,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 703 flow [2022-12-06 03:52:02,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 665 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:02,180 INFO L231 Difference]: Finished difference. Result has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:02,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=45, PETRI_TRANSITIONS=63} [2022-12-06 03:52:02,181 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 27 predicate places. [2022-12-06 03:52:02,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:02,181 INFO L89 Accepts]: Start accepts. Operand has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:02,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:02,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:02,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:02,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:02,190 INFO L130 PetriNetUnfolder]: 52/131 cut-off events. [2022-12-06 03:52:02,190 INFO L131 PetriNetUnfolder]: For 263/271 co-relation queries the response was YES. [2022-12-06 03:52:02,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 131 events. 52/131 cut-off events. For 263/271 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 573 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 427. Up to 53 conditions per place. [2022-12-06 03:52:02,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:02,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 03:52:02,192 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:02,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 03:52:02,194 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:02,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:02,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:02,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:02,215 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 03:52:02,399 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,SelfDestructingSolverStorable12 [2022-12-06 03:52:02,399 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1429431455, now seen corresponding path program 1 times [2022-12-06 03:52:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354857501] [2022-12-06 03:52:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:02,519 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 03:52:02,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:02,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354857501] [2022-12-06 03:52:02,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354857501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:02,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788923296] [2022-12-06 03:52:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:02,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:02,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:02,536 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 03:52:02,588 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 03:52:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:02,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 03:52:02,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:02,680 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 03:52:02,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:02,761 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 03:52:02,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788923296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:02,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:02,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251383478] [2022-12-06 03:52:02,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:02,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:02,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:02,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:02,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:02,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:52:02,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 63 transitions, 509 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:02,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:02,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:52:02,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:02,995 INFO L130 PetriNetUnfolder]: 412/689 cut-off events. [2022-12-06 03:52:02,996 INFO L131 PetriNetUnfolder]: For 1603/1603 co-relation queries the response was YES. [2022-12-06 03:52:02,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 689 events. 412/689 cut-off events. For 1603/1603 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3044 event pairs, 37 based on Foata normal form. 26/701 useless extension candidates. Maximal degree in co-relation 2326. Up to 427 conditions per place. [2022-12-06 03:52:02,999 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 68 selfloop transitions, 42 changer transitions 0/110 dead transitions. [2022-12-06 03:52:02,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 883 flow [2022-12-06 03:52:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:52:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:52:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 03:52:03,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 03:52:03,000 INFO L175 Difference]: Start difference. First operand has 45 places, 63 transitions, 509 flow. Second operand 10 states and 74 transitions. [2022-12-06 03:52:03,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 883 flow [2022-12-06 03:52:03,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:03,005 INFO L231 Difference]: Finished difference. Result has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:03,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=717, PETRI_PLACES=56, PETRI_TRANSITIONS=77} [2022-12-06 03:52:03,006 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-06 03:52:03,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:03,006 INFO L89 Accepts]: Start accepts. Operand has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:03,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:03,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:03,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:03,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:03,016 INFO L130 PetriNetUnfolder]: 62/154 cut-off events. [2022-12-06 03:52:03,017 INFO L131 PetriNetUnfolder]: For 398/410 co-relation queries the response was YES. [2022-12-06 03:52:03,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 154 events. 62/154 cut-off events. For 398/410 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 687 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 598. Up to 62 conditions per place. [2022-12-06 03:52:03,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:03,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 03:52:03,247 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:03,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 03:52:03,247 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 77 transitions, 732 flow [2022-12-06 03:52:03,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:03,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:03,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:03,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 03:52:03,448 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,SelfDestructingSolverStorable13 [2022-12-06 03:52:03,448 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash 67852572, now seen corresponding path program 1 times [2022-12-06 03:52:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:03,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850686648] [2022-12-06 03:52:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:03,625 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 03:52:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850686648] [2022-12-06 03:52:03,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850686648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000844266] [2022-12-06 03:52:03,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:03,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:03,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:03,627 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 03:52:03,660 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 03:52:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:03,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:03,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:03,829 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 03:52:03,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:03,937 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 03:52:03,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000844266] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:03,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:03,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766812243] [2022-12-06 03:52:03,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:03,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:03,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:03,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:03,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 77 transitions, 732 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:03,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:03,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:03,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:04,226 INFO L130 PetriNetUnfolder]: 472/809 cut-off events. [2022-12-06 03:52:04,226 INFO L131 PetriNetUnfolder]: For 3393/3393 co-relation queries the response was YES. [2022-12-06 03:52:04,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 809 events. 472/809 cut-off events. For 3393/3393 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3827 event pairs, 35 based on Foata normal form. 40/838 useless extension candidates. Maximal degree in co-relation 3038. Up to 460 conditions per place. [2022-12-06 03:52:04,230 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 79 selfloop transitions, 58 changer transitions 0/137 dead transitions. [2022-12-06 03:52:04,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 137 transitions, 1256 flow [2022-12-06 03:52:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:52:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:52:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-06 03:52:04,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-06 03:52:04,231 INFO L175 Difference]: Start difference. First operand has 56 places, 77 transitions, 732 flow. Second operand 11 states and 82 transitions. [2022-12-06 03:52:04,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 137 transitions, 1256 flow [2022-12-06 03:52:04,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 1203 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:04,237 INFO L231 Difference]: Finished difference. Result has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:04,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1061, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2022-12-06 03:52:04,237 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-06 03:52:04,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:04,238 INFO L89 Accepts]: Start accepts. Operand has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:04,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:04,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:04,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:04,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:04,249 INFO L130 PetriNetUnfolder]: 76/197 cut-off events. [2022-12-06 03:52:04,249 INFO L131 PetriNetUnfolder]: For 733/745 co-relation queries the response was YES. [2022-12-06 03:52:04,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 197 events. 76/197 cut-off events. For 733/745 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 952 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 866. Up to 82 conditions per place. [2022-12-06 03:52:04,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:04,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 03:52:04,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:04,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 03:52:04,283 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 1064 flow [2022-12-06 03:52:04,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:04,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:04,283 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:04,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 03:52:04,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 03:52:04,488 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1362374921, now seen corresponding path program 1 times [2022-12-06 03:52:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:04,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808358075] [2022-12-06 03:52:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:04,604 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 03:52:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808358075] [2022-12-06 03:52:04,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808358075] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:04,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256512085] [2022-12-06 03:52:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:04,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:04,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:04,606 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 03:52:04,608 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 03:52:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:04,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:04,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:04,736 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 03:52:04,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:04,864 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 03:52:04,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256512085] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:04,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:04,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:04,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362457018] [2022-12-06 03:52:04,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:04,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:04,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:04,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:04,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:52:04,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 1064 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:04,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:04,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:52:04,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:05,157 INFO L130 PetriNetUnfolder]: 512/889 cut-off events. [2022-12-06 03:52:05,157 INFO L131 PetriNetUnfolder]: For 4840/4840 co-relation queries the response was YES. [2022-12-06 03:52:05,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 889 events. 512/889 cut-off events. For 4840/4840 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4395 event pairs, 45 based on Foata normal form. 24/902 useless extension candidates. Maximal degree in co-relation 3656. Up to 544 conditions per place. [2022-12-06 03:52:05,162 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 91 selfloop transitions, 62 changer transitions 0/153 dead transitions. [2022-12-06 03:52:05,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 1586 flow [2022-12-06 03:52:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:52:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:52:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-12-06 03:52:05,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3143939393939394 [2022-12-06 03:52:05,163 INFO L175 Difference]: Start difference. First operand has 67 places, 101 transitions, 1064 flow. Second operand 11 states and 83 transitions. [2022-12-06 03:52:05,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 1586 flow [2022-12-06 03:52:05,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 1547 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:05,173 INFO L231 Difference]: Finished difference. Result has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:05,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1366, PETRI_PLACES=78, PETRI_TRANSITIONS=117} [2022-12-06 03:52:05,174 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 60 predicate places. [2022-12-06 03:52:05,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:05,174 INFO L89 Accepts]: Start accepts. Operand has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:05,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:05,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:05,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:05,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:05,188 INFO L130 PetriNetUnfolder]: 86/226 cut-off events. [2022-12-06 03:52:05,188 INFO L131 PetriNetUnfolder]: For 1147/1159 co-relation queries the response was YES. [2022-12-06 03:52:05,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 226 events. 86/226 cut-off events. For 1147/1159 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1163 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 1100. Up to 102 conditions per place. [2022-12-06 03:52:05,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:05,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 03:52:05,283 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:05,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 03:52:05,284 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 117 transitions, 1375 flow [2022-12-06 03:52:05,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:05,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:05,284 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:05,290 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 03:52:05,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 03:52:05,484 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash 549136282, now seen corresponding path program 1 times [2022-12-06 03:52:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:05,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303730645] [2022-12-06 03:52:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:05,607 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 03:52:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:05,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303730645] [2022-12-06 03:52:05,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303730645] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:05,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23952803] [2022-12-06 03:52:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:05,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:05,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:05,626 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 03:52:05,665 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 03:52:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:05,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:05,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:05,780 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 03:52:05,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:05,874 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 03:52:05,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23952803] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:05,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:05,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059756524] [2022-12-06 03:52:05,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:05,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:05,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:05,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:52:05,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 117 transitions, 1375 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:05,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:05,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:52:05,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:06,392 INFO L130 PetriNetUnfolder]: 532/933 cut-off events. [2022-12-06 03:52:06,392 INFO L131 PetriNetUnfolder]: For 5442/5442 co-relation queries the response was YES. [2022-12-06 03:52:06,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4164 conditions, 933 events. 532/933 cut-off events. For 5442/5442 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4769 event pairs, 35 based on Foata normal form. 12/934 useless extension candidates. Maximal degree in co-relation 4128. Up to 468 conditions per place. [2022-12-06 03:52:06,398 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 101 selfloop transitions, 88 changer transitions 2/191 dead transitions. [2022-12-06 03:52:06,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 191 transitions, 2063 flow [2022-12-06 03:52:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:52:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:52:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-12-06 03:52:06,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2669683257918552 [2022-12-06 03:52:06,399 INFO L175 Difference]: Start difference. First operand has 78 places, 117 transitions, 1375 flow. Second operand 17 states and 118 transitions. [2022-12-06 03:52:06,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 191 transitions, 2063 flow [2022-12-06 03:52:06,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 191 transitions, 2003 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:06,415 INFO L231 Difference]: Finished difference. Result has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:06,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1764, PETRI_PLACES=93, PETRI_TRANSITIONS=133} [2022-12-06 03:52:06,416 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-06 03:52:06,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:06,416 INFO L89 Accepts]: Start accepts. Operand has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:06,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:06,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:06,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:06,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:06,435 INFO L130 PetriNetUnfolder]: 91/244 cut-off events. [2022-12-06 03:52:06,435 INFO L131 PetriNetUnfolder]: For 1371/1379 co-relation queries the response was YES. [2022-12-06 03:52:06,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 244 events. 91/244 cut-off events. For 1371/1379 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1344 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1314. Up to 112 conditions per place. [2022-12-06 03:52:06,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:06,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 03:52:06,784 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:52:06,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-06 03:52:06,784 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 133 transitions, 1799 flow [2022-12-06 03:52:06,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:06,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:06,785 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:06,791 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 03:52:06,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:06,985 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2101574122, now seen corresponding path program 1 times [2022-12-06 03:52:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:06,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384467000] [2022-12-06 03:52:06,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:07,084 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 03:52:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:07,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384467000] [2022-12-06 03:52:07,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384467000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513198332] [2022-12-06 03:52:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:07,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:07,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:07,086 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 03:52:07,132 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 03:52:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:07,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:07,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:07,249 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 03:52:07,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:07,365 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 03:52:07,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513198332] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:07,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:07,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:07,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358770405] [2022-12-06 03:52:07,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:07,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:07,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:07,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:07,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:07,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 03:52:07,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 133 transitions, 1799 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:07,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:07,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 03:52:07,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:07,912 INFO L130 PetriNetUnfolder]: 766/1357 cut-off events. [2022-12-06 03:52:07,912 INFO L131 PetriNetUnfolder]: For 18012/18012 co-relation queries the response was YES. [2022-12-06 03:52:07,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1357 events. 766/1357 cut-off events. For 18012/18012 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7596 event pairs, 45 based on Foata normal form. 54/1400 useless extension candidates. Maximal degree in co-relation 6410. Up to 427 conditions per place. [2022-12-06 03:52:07,920 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 111 selfloop transitions, 163 changer transitions 0/274 dead transitions. [2022-12-06 03:52:07,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 274 transitions, 3397 flow [2022-12-06 03:52:07,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:52:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:52:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 144 transitions. [2022-12-06 03:52:07,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-06 03:52:07,921 INFO L175 Difference]: Start difference. First operand has 93 places, 133 transitions, 1799 flow. Second operand 18 states and 144 transitions. [2022-12-06 03:52:07,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 274 transitions, 3397 flow [2022-12-06 03:52:07,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 274 transitions, 3265 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-12-06 03:52:07,942 INFO L231 Difference]: Finished difference. Result has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:07,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=109, PETRI_TRANSITIONS=205} [2022-12-06 03:52:07,942 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 91 predicate places. [2022-12-06 03:52:07,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:07,942 INFO L89 Accepts]: Start accepts. Operand has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:07,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:07,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:07,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:07,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:07,967 INFO L130 PetriNetUnfolder]: 133/352 cut-off events. [2022-12-06 03:52:07,968 INFO L131 PetriNetUnfolder]: For 2801/2813 co-relation queries the response was YES. [2022-12-06 03:52:07,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 352 events. 133/352 cut-off events. For 2801/2813 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2127 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 2172. Up to 183 conditions per place. [2022-12-06 03:52:07,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:07,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-06 03:52:08,003 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:08,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 03:52:08,004 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 205 transitions, 3056 flow [2022-12-06 03:52:08,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:08,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:08,004 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:08,016 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 03:52:08,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 03:52:08,209 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:08,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:08,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1363955766, now seen corresponding path program 1 times [2022-12-06 03:52:08,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:08,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81792453] [2022-12-06 03:52:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:08,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:08,365 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 03:52:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:08,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81792453] [2022-12-06 03:52:08,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81792453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:08,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088901363] [2022-12-06 03:52:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:08,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:08,368 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:08,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 03:52:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:08,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:08,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:08,507 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 03:52:08,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:08,612 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 03:52:08,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088901363] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:08,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:08,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945318787] [2022-12-06 03:52:08,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:08,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:08,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 03:52:08,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 205 transitions, 3056 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:08,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:08,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 03:52:08,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:09,165 INFO L130 PetriNetUnfolder]: 868/1533 cut-off events. [2022-12-06 03:52:09,165 INFO L131 PetriNetUnfolder]: For 18302/18302 co-relation queries the response was YES. [2022-12-06 03:52:09,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 1533 events. 868/1533 cut-off events. For 18302/18302 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8850 event pairs, 93 based on Foata normal form. 22/1536 useless extension candidates. Maximal degree in co-relation 8047. Up to 1000 conditions per place. [2022-12-06 03:52:09,176 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 176 selfloop transitions, 104 changer transitions 2/282 dead transitions. [2022-12-06 03:52:09,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 282 transitions, 4120 flow [2022-12-06 03:52:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:52:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:52:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-06 03:52:09,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465437788018433 [2022-12-06 03:52:09,177 INFO L175 Difference]: Start difference. First operand has 109 places, 205 transitions, 3056 flow. Second operand 14 states and 107 transitions. [2022-12-06 03:52:09,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 282 transitions, 4120 flow [2022-12-06 03:52:09,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 282 transitions, 3891 flow, removed 92 selfloop flow, removed 6 redundant places. [2022-12-06 03:52:09,265 INFO L231 Difference]: Finished difference. Result has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:09,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3569, PETRI_PLACES=121, PETRI_TRANSITIONS=234} [2022-12-06 03:52:09,266 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 103 predicate places. [2022-12-06 03:52:09,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:09,266 INFO L89 Accepts]: Start accepts. Operand has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:09,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:09,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:09,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:09,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:09,297 INFO L130 PetriNetUnfolder]: 153/401 cut-off events. [2022-12-06 03:52:09,298 INFO L131 PetriNetUnfolder]: For 2860/2874 co-relation queries the response was YES. [2022-12-06 03:52:09,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 401 events. 153/401 cut-off events. For 2860/2874 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2519 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 2526. Up to 187 conditions per place. [2022-12-06 03:52:09,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:09,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-06 03:52:09,344 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [344] L705-6-->L695-5: Formula: (and (= v_~prev~0_151 (+ (* 233 v_~prev~0_152) (* 377 v_~cur~0_123))) (< v_~x~0_138 1) (< v_~q~0_56 6) (= (+ (* 233 v_~cur~0_123) v_~prev~0_151 (* 144 v_~prev~0_152)) v_~next~0_79) (= v_~j~0_115 (+ v_~j~0_116 v_~i~0_101)) (= v_~q~0_55 (+ v_~q~0_56 1)) (= (+ 14 v_~x~0_138) v_~x~0_137) (= v_~cur~0_122 v_~next~0_79)) InVars {~j~0=v_~j~0_116, ~prev~0=v_~prev~0_152, ~i~0=v_~i~0_101, ~q~0=v_~q~0_56, ~cur~0=v_~cur~0_123, ~x~0=v_~x~0_138} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_85|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_79, ~prev~0=v_~prev~0_151, ~i~0=v_~i~0_101, ~q~0=v_~q~0_55, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_38|, ~cur~0=v_~cur~0_122, ~x~0=v_~x~0_137} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:52:09,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [363] L705-6-->L695-5: Formula: (and (< v_~x~0_206 1) (< v_~q~0_110 5) (= (+ 2 v_~q~0_110) v_~q~0_108) (= (+ (* 233 v_~prev~0_218) (* 377 v_~cur~0_183)) v_~prev~0_217) (= (+ 14 v_~x~0_206) v_~x~0_205) (= v_~j~0_189 (+ v_~j~0_191 (* 2 v_~i~0_179))) (= v_~next~0_115 v_~cur~0_182) (= v_~next~0_115 (+ (* 144 v_~prev~0_218) (* 233 v_~cur~0_183) v_~prev~0_217))) InVars {~j~0=v_~j~0_191, ~prev~0=v_~prev~0_218, ~i~0=v_~i~0_179, ~q~0=v_~q~0_110, ~cur~0=v_~cur~0_183, ~x~0=v_~x~0_206} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_127|, ~j~0=v_~j~0_189, ~next~0=v_~next~0_115, ~prev~0=v_~prev~0_217, ~i~0=v_~i~0_179, ~q~0=v_~q~0_108, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_78|, ~cur~0=v_~cur~0_182, ~x~0=v_~x~0_205} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:52:09,542 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:09,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-06 03:52:09,544 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 234 transitions, 3562 flow [2022-12-06 03:52:09,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:09,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:09,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:09,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 03:52:09,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:09,749 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2102983630, now seen corresponding path program 1 times [2022-12-06 03:52:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:09,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791053533] [2022-12-06 03:52:09,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:09,890 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 03:52:09,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:09,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791053533] [2022-12-06 03:52:09,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791053533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:09,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592012083] [2022-12-06 03:52:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:09,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:09,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:09,891 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:09,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:52:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:09,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:09,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:10,047 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 03:52:10,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:10,166 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 03:52:10,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592012083] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:10,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:10,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:10,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3360423] [2022-12-06 03:52:10,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:10,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:10,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:10,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:10,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:10,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 03:52:10,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 234 transitions, 3562 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:10,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:10,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 03:52:10,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:10,714 INFO L130 PetriNetUnfolder]: 1116/1949 cut-off events. [2022-12-06 03:52:10,715 INFO L131 PetriNetUnfolder]: For 24981/24981 co-relation queries the response was YES. [2022-12-06 03:52:10,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 1949 events. 1116/1949 cut-off events. For 24981/24981 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11511 event pairs, 39 based on Foata normal form. 26/1953 useless extension candidates. Maximal degree in co-relation 10634. Up to 566 conditions per place. [2022-12-06 03:52:10,728 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 99 selfloop transitions, 253 changer transitions 0/352 dead transitions. [2022-12-06 03:52:10,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 352 transitions, 5256 flow [2022-12-06 03:52:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:52:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:52:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2022-12-06 03:52:10,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27647058823529413 [2022-12-06 03:52:10,729 INFO L175 Difference]: Start difference. First operand has 121 places, 234 transitions, 3562 flow. Second operand 15 states and 141 transitions. [2022-12-06 03:52:10,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 352 transitions, 5256 flow [2022-12-06 03:52:10,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 352 transitions, 5174 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:10,791 INFO L231 Difference]: Finished difference. Result has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:10,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3484, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5003, PETRI_PLACES=136, PETRI_TRANSITIONS=281} [2022-12-06 03:52:10,791 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 118 predicate places. [2022-12-06 03:52:10,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:10,791 INFO L89 Accepts]: Start accepts. Operand has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:10,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:10,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:10,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:10,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:10,830 INFO L130 PetriNetUnfolder]: 184/484 cut-off events. [2022-12-06 03:52:10,830 INFO L131 PetriNetUnfolder]: For 5336/5356 co-relation queries the response was YES. [2022-12-06 03:52:10,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 484 events. 184/484 cut-off events. For 5336/5356 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3154 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 3580. Up to 229 conditions per place. [2022-12-06 03:52:10,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:10,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-06 03:52:10,868 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:10,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 03:52:10,868 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 281 transitions, 5007 flow [2022-12-06 03:52:10,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:10,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:10,869 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:10,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 03:52:11,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:11,073 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1361889616, now seen corresponding path program 1 times [2022-12-06 03:52:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:11,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272835985] [2022-12-06 03:52:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:11,162 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 03:52:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272835985] [2022-12-06 03:52:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272835985] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138815692] [2022-12-06 03:52:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:11,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:11,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:11,170 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:11,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:52:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:11,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 03:52:11,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:11,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:11,388 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 03:52:11,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138815692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:11,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:11,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122683720] [2022-12-06 03:52:11,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:11,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:11,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:11,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:11,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 281 transitions, 5007 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:11,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:11,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:11,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:12,020 INFO L130 PetriNetUnfolder]: 1266/2207 cut-off events. [2022-12-06 03:52:12,020 INFO L131 PetriNetUnfolder]: For 39196/39196 co-relation queries the response was YES. [2022-12-06 03:52:12,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13568 conditions, 2207 events. 1266/2207 cut-off events. For 39196/39196 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 13472 event pairs, 132 based on Foata normal form. 30/2215 useless extension candidates. Maximal degree in co-relation 13511. Up to 1395 conditions per place. [2022-12-06 03:52:12,037 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 214 selfloop transitions, 154 changer transitions 0/368 dead transitions. [2022-12-06 03:52:12,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 368 transitions, 6552 flow [2022-12-06 03:52:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:52:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:52:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-12-06 03:52:12,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23877551020408164 [2022-12-06 03:52:12,039 INFO L175 Difference]: Start difference. First operand has 136 places, 281 transitions, 5007 flow. Second operand 14 states and 117 transitions. [2022-12-06 03:52:12,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 368 transitions, 6552 flow [2022-12-06 03:52:12,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 368 transitions, 6292 flow, removed 63 selfloop flow, removed 7 redundant places. [2022-12-06 03:52:12,139 INFO L231 Difference]: Finished difference. Result has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:12,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4775, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5968, PETRI_PLACES=152, PETRI_TRANSITIONS=319} [2022-12-06 03:52:12,140 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 134 predicate places. [2022-12-06 03:52:12,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:12,140 INFO L89 Accepts]: Start accepts. Operand has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:12,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:12,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:12,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:12,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:12,185 INFO L130 PetriNetUnfolder]: 204/534 cut-off events. [2022-12-06 03:52:12,185 INFO L131 PetriNetUnfolder]: For 7158/7178 co-relation queries the response was YES. [2022-12-06 03:52:12,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4244 conditions, 534 events. 204/534 cut-off events. For 7158/7178 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3617 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 4183. Up to 247 conditions per place. [2022-12-06 03:52:12,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:12,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-06 03:52:12,192 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:12,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 03:52:12,192 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:12,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:12,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:12,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:12,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:12,397 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 550484007, now seen corresponding path program 1 times [2022-12-06 03:52:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:12,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853201428] [2022-12-06 03:52:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:12,421 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 03:52:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:12,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853201428] [2022-12-06 03:52:12,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853201428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:12,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:12,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:52:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610956890] [2022-12-06 03:52:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:12,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:52:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:52:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:52:12,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:12,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 319 transitions, 5968 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:12,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:12,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:12,750 INFO L130 PetriNetUnfolder]: 1244/2165 cut-off events. [2022-12-06 03:52:12,750 INFO L131 PetriNetUnfolder]: For 43793/43793 co-relation queries the response was YES. [2022-12-06 03:52:12,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14811 conditions, 2165 events. 1244/2165 cut-off events. For 43793/43793 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 13316 event pairs, 250 based on Foata normal form. 125/2276 useless extension candidates. Maximal degree in co-relation 14747. Up to 856 conditions per place. [2022-12-06 03:52:12,768 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 430 selfloop transitions, 47 changer transitions 1/478 dead transitions. [2022-12-06 03:52:12,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 478 transitions, 9903 flow [2022-12-06 03:52:12,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:52:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:52:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 03:52:12,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2022-12-06 03:52:12,769 INFO L175 Difference]: Start difference. First operand has 152 places, 319 transitions, 5968 flow. Second operand 4 states and 53 transitions. [2022-12-06 03:52:12,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 478 transitions, 9903 flow [2022-12-06 03:52:12,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 478 transitions, 9710 flow, removed 87 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:12,911 INFO L231 Difference]: Finished difference. Result has 156 places, 325 transitions, 6112 flow [2022-12-06 03:52:12,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5737, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6112, PETRI_PLACES=156, PETRI_TRANSITIONS=325} [2022-12-06 03:52:12,912 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 138 predicate places. [2022-12-06 03:52:12,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:12,912 INFO L89 Accepts]: Start accepts. Operand has 156 places, 325 transitions, 6112 flow [2022-12-06 03:52:12,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:12,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:12,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 325 transitions, 6112 flow [2022-12-06 03:52:12,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 325 transitions, 6112 flow [2022-12-06 03:52:12,961 INFO L130 PetriNetUnfolder]: 201/533 cut-off events. [2022-12-06 03:52:12,961 INFO L131 PetriNetUnfolder]: For 8550/8570 co-relation queries the response was YES. [2022-12-06 03:52:12,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4451 conditions, 533 events. 201/533 cut-off events. For 8550/8570 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3578 event pairs, 1 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 4387. Up to 236 conditions per place. [2022-12-06 03:52:12,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 325 transitions, 6112 flow [2022-12-06 03:52:12,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 994 [2022-12-06 03:52:12,969 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:12,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 03:52:12,969 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 325 transitions, 6112 flow [2022-12-06 03:52:12,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:12,970 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:12,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 03:52:12,970 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash 550484565, now seen corresponding path program 1 times [2022-12-06 03:52:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:12,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062778499] [2022-12-06 03:52:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:13,055 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 03:52:13,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:13,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062778499] [2022-12-06 03:52:13,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062778499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:13,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602248295] [2022-12-06 03:52:13,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:13,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:13,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:13,073 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:13,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:52:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:13,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:13,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:13,207 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 03:52:13,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:13,298 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 03:52:13,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602248295] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:13,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:13,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:13,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134746389] [2022-12-06 03:52:13,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:13,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:13,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:13,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:13,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:13,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:13,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 325 transitions, 6112 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:13,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:13,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:13,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:13,874 INFO L130 PetriNetUnfolder]: 1288/2259 cut-off events. [2022-12-06 03:52:13,874 INFO L131 PetriNetUnfolder]: For 57627/57627 co-relation queries the response was YES. [2022-12-06 03:52:13,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16182 conditions, 2259 events. 1288/2259 cut-off events. For 57627/57627 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 13746 event pairs, 170 based on Foata normal form. 34/2279 useless extension candidates. Maximal degree in co-relation 16115. Up to 1587 conditions per place. [2022-12-06 03:52:13,889 INFO L137 encePairwiseOnDemand]: 9/35 looper letters, 238 selfloop transitions, 155 changer transitions 0/393 dead transitions. [2022-12-06 03:52:13,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 393 transitions, 7529 flow [2022-12-06 03:52:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 03:52:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 03:52:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-12-06 03:52:13,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21318681318681318 [2022-12-06 03:52:13,890 INFO L175 Difference]: Start difference. First operand has 156 places, 325 transitions, 6112 flow. Second operand 13 states and 97 transitions. [2022-12-06 03:52:13,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 393 transitions, 7529 flow [2022-12-06 03:52:14,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 393 transitions, 7529 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 03:52:14,044 INFO L231 Difference]: Finished difference. Result has 172 places, 350 transitions, 7125 flow [2022-12-06 03:52:14,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6112, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7125, PETRI_PLACES=172, PETRI_TRANSITIONS=350} [2022-12-06 03:52:14,044 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 154 predicate places. [2022-12-06 03:52:14,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:14,045 INFO L89 Accepts]: Start accepts. Operand has 172 places, 350 transitions, 7125 flow [2022-12-06 03:52:14,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:14,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:14,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 350 transitions, 7125 flow [2022-12-06 03:52:14,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 350 transitions, 7125 flow [2022-12-06 03:52:14,099 INFO L130 PetriNetUnfolder]: 211/568 cut-off events. [2022-12-06 03:52:14,099 INFO L131 PetriNetUnfolder]: For 10214/10237 co-relation queries the response was YES. [2022-12-06 03:52:14,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5014 conditions, 568 events. 211/568 cut-off events. For 10214/10237 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3884 event pairs, 0 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 4944. Up to 256 conditions per place. [2022-12-06 03:52:14,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 350 transitions, 7125 flow [2022-12-06 03:52:14,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 1046 [2022-12-06 03:52:14,106 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:14,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 03:52:14,107 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 350 transitions, 7125 flow [2022-12-06 03:52:14,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:14,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:14,107 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:14,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 03:52:14,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:14,311 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash 729903987, now seen corresponding path program 2 times [2022-12-06 03:52:14,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:14,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762178347] [2022-12-06 03:52:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:14,414 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 03:52:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762178347] [2022-12-06 03:52:14,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762178347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689226551] [2022-12-06 03:52:14,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:52:14,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:14,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:14,415 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:14,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:52:14,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:52:14,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:52:14,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:14,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:14,586 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 03:52:14,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:14,703 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 03:52:14,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689226551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:14,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:14,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701805874] [2022-12-06 03:52:14,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:14,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:14,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:14,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:14,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:14,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 350 transitions, 7125 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:14,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:14,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:14,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:15,398 INFO L130 PetriNetUnfolder]: 1518/2643 cut-off events. [2022-12-06 03:52:15,398 INFO L131 PetriNetUnfolder]: For 71549/71549 co-relation queries the response was YES. [2022-12-06 03:52:15,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19979 conditions, 2643 events. 1518/2643 cut-off events. For 71549/71549 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 16538 event pairs, 129 based on Foata normal form. 18/2647 useless extension candidates. Maximal degree in co-relation 19906. Up to 1332 conditions per place. [2022-12-06 03:52:15,419 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 233 selfloop transitions, 227 changer transitions 0/460 dead transitions. [2022-12-06 03:52:15,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 460 transitions, 9374 flow [2022-12-06 03:52:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:52:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:52:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2022-12-06 03:52:15,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24952380952380954 [2022-12-06 03:52:15,420 INFO L175 Difference]: Start difference. First operand has 172 places, 350 transitions, 7125 flow. Second operand 15 states and 131 transitions. [2022-12-06 03:52:15,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 460 transitions, 9374 flow [2022-12-06 03:52:15,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 460 transitions, 9185 flow, removed 64 selfloop flow, removed 6 redundant places. [2022-12-06 03:52:15,627 INFO L231 Difference]: Finished difference. Result has 185 places, 398 transitions, 8626 flow [2022-12-06 03:52:15,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6962, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8626, PETRI_PLACES=185, PETRI_TRANSITIONS=398} [2022-12-06 03:52:15,628 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 167 predicate places. [2022-12-06 03:52:15,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:15,628 INFO L89 Accepts]: Start accepts. Operand has 185 places, 398 transitions, 8626 flow [2022-12-06 03:52:15,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:15,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:15,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 398 transitions, 8626 flow [2022-12-06 03:52:15,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 398 transitions, 8626 flow [2022-12-06 03:52:15,699 INFO L130 PetriNetUnfolder]: 251/670 cut-off events. [2022-12-06 03:52:15,699 INFO L131 PetriNetUnfolder]: For 14560/14583 co-relation queries the response was YES. [2022-12-06 03:52:15,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6379 conditions, 670 events. 251/670 cut-off events. For 14560/14583 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 4822 event pairs, 0 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 6304. Up to 321 conditions per place. [2022-12-06 03:52:15,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 398 transitions, 8626 flow [2022-12-06 03:52:15,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 1210 [2022-12-06 03:52:15,772 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:15,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-06 03:52:15,773 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 398 transitions, 8646 flow [2022-12-06 03:52:15,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:15,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:15,773 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:15,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 03:52:15,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-06 03:52:15,977 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash 730975223, now seen corresponding path program 1 times [2022-12-06 03:52:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:15,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337686761] [2022-12-06 03:52:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:16,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:16,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337686761] [2022-12-06 03:52:16,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337686761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:16,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271971859] [2022-12-06 03:52:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:16,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:16,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:16,011 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:16,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:52:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:16,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:52:16,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:16,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:16,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271971859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:16,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:16,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 03:52:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735528972] [2022-12-06 03:52:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:16,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:52:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:52:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:52:16,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:52:16,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 398 transitions, 8646 flow. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:16,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:16,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:52:16,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:16,527 INFO L130 PetriNetUnfolder]: 1682/2881 cut-off events. [2022-12-06 03:52:16,527 INFO L131 PetriNetUnfolder]: For 85263/85263 co-relation queries the response was YES. [2022-12-06 03:52:16,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23492 conditions, 2881 events. 1682/2881 cut-off events. For 85263/85263 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 18190 event pairs, 419 based on Foata normal form. 21/2894 useless extension candidates. Maximal degree in co-relation 23414. Up to 1456 conditions per place. [2022-12-06 03:52:16,551 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 597 selfloop transitions, 19 changer transitions 1/617 dead transitions. [2022-12-06 03:52:16,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 617 transitions, 14761 flow [2022-12-06 03:52:16,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:52:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:52:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-06 03:52:16,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2747747747747748 [2022-12-06 03:52:16,552 INFO L175 Difference]: Start difference. First operand has 185 places, 398 transitions, 8646 flow. Second operand 6 states and 61 transitions. [2022-12-06 03:52:16,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 617 transitions, 14761 flow [2022-12-06 03:52:16,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 617 transitions, 14441 flow, removed 120 selfloop flow, removed 5 redundant places. [2022-12-06 03:52:16,844 INFO L231 Difference]: Finished difference. Result has 187 places, 400 transitions, 8573 flow [2022-12-06 03:52:16,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8362, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8573, PETRI_PLACES=187, PETRI_TRANSITIONS=400} [2022-12-06 03:52:16,845 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 169 predicate places. [2022-12-06 03:52:16,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:16,845 INFO L89 Accepts]: Start accepts. Operand has 187 places, 400 transitions, 8573 flow [2022-12-06 03:52:16,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:16,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:16,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 400 transitions, 8573 flow [2022-12-06 03:52:16,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 400 transitions, 8573 flow [2022-12-06 03:52:16,934 INFO L130 PetriNetUnfolder]: 278/739 cut-off events. [2022-12-06 03:52:16,934 INFO L131 PetriNetUnfolder]: For 17920/17947 co-relation queries the response was YES. [2022-12-06 03:52:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7155 conditions, 739 events. 278/739 cut-off events. For 17920/17947 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5381 event pairs, 0 based on Foata normal form. 4/740 useless extension candidates. Maximal degree in co-relation 7079. Up to 357 conditions per place. [2022-12-06 03:52:16,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 400 transitions, 8573 flow [2022-12-06 03:52:16,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 1286 [2022-12-06 03:52:16,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:16,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 03:52:16,944 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 400 transitions, 8573 flow [2022-12-06 03:52:16,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:16,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:16,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:16,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:17,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 03:52:17,149 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash 732115930, now seen corresponding path program 1 times [2022-12-06 03:52:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:17,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8198393] [2022-12-06 03:52:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:17,258 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 03:52:17,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:17,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8198393] [2022-12-06 03:52:17,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8198393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:17,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264716324] [2022-12-06 03:52:17,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:17,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:17,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:17,259 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:17,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:52:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:17,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:17,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:17,417 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 03:52:17,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:17,521 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 03:52:17,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264716324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:17,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:17,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:17,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521609301] [2022-12-06 03:52:17,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:17,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:17,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:17,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:17,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:17,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:52:17,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 400 transitions, 8573 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:17,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:17,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:52:17,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:18,438 INFO L130 PetriNetUnfolder]: 1886/3247 cut-off events. [2022-12-06 03:52:18,438 INFO L131 PetriNetUnfolder]: For 145008/145008 co-relation queries the response was YES. [2022-12-06 03:52:18,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26895 conditions, 3247 events. 1886/3247 cut-off events. For 145008/145008 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 20767 event pairs, 184 based on Foata normal form. 72/3305 useless extension candidates. Maximal degree in co-relation 26816. Up to 1863 conditions per place. [2022-12-06 03:52:18,462 INFO L137 encePairwiseOnDemand]: 10/37 looper letters, 286 selfloop transitions, 262 changer transitions 0/548 dead transitions. [2022-12-06 03:52:18,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 548 transitions, 11841 flow [2022-12-06 03:52:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:52:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:52:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 144 transitions. [2022-12-06 03:52:18,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21621621621621623 [2022-12-06 03:52:18,463 INFO L175 Difference]: Start difference. First operand has 187 places, 400 transitions, 8573 flow. Second operand 18 states and 144 transitions. [2022-12-06 03:52:18,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 548 transitions, 11841 flow [2022-12-06 03:52:18,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 548 transitions, 11808 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:18,766 INFO L231 Difference]: Finished difference. Result has 210 places, 465 transitions, 10936 flow [2022-12-06 03:52:18,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8540, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10936, PETRI_PLACES=210, PETRI_TRANSITIONS=465} [2022-12-06 03:52:18,766 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 192 predicate places. [2022-12-06 03:52:18,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:18,766 INFO L89 Accepts]: Start accepts. Operand has 210 places, 465 transitions, 10936 flow [2022-12-06 03:52:18,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:18,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:18,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 465 transitions, 10936 flow [2022-12-06 03:52:18,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 465 transitions, 10936 flow [2022-12-06 03:52:18,866 INFO L130 PetriNetUnfolder]: 307/820 cut-off events. [2022-12-06 03:52:18,866 INFO L131 PetriNetUnfolder]: For 27365/27396 co-relation queries the response was YES. [2022-12-06 03:52:18,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8680 conditions, 820 events. 307/820 cut-off events. For 27365/27396 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6122 event pairs, 0 based on Foata normal form. 4/821 useless extension candidates. Maximal degree in co-relation 8596. Up to 413 conditions per place. [2022-12-06 03:52:18,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 465 transitions, 10936 flow [2022-12-06 03:52:18,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 1480 [2022-12-06 03:52:18,877 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:18,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 03:52:18,878 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 465 transitions, 10936 flow [2022-12-06 03:52:18,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:18,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:18,878 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:18,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:19,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 03:52:19,083 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash -173255804, now seen corresponding path program 1 times [2022-12-06 03:52:19,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:19,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119641483] [2022-12-06 03:52:19,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:19,181 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 03:52:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:19,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119641483] [2022-12-06 03:52:19,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119641483] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:19,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700480724] [2022-12-06 03:52:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:19,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:19,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:19,197 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:19,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 03:52:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:19,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:52:19,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:19,371 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 03:52:19,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:19,494 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 03:52:19,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700480724] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:19,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:19,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410758542] [2022-12-06 03:52:19,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:19,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:19,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:19,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:19,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:52:19,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 465 transitions, 10936 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:19,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:19,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:52:19,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:20,801 INFO L130 PetriNetUnfolder]: 1938/3355 cut-off events. [2022-12-06 03:52:20,801 INFO L131 PetriNetUnfolder]: For 142567/142567 co-relation queries the response was YES. [2022-12-06 03:52:20,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29480 conditions, 3355 events. 1938/3355 cut-off events. For 142567/142567 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 21787 event pairs, 257 based on Foata normal form. 26/3367 useless extension candidates. Maximal degree in co-relation 29393. Up to 2558 conditions per place. [2022-12-06 03:52:20,826 INFO L137 encePairwiseOnDemand]: 9/37 looper letters, 379 selfloop transitions, 185 changer transitions 6/570 dead transitions. [2022-12-06 03:52:20,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 570 transitions, 13183 flow [2022-12-06 03:52:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 03:52:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 03:52:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 145 transitions. [2022-12-06 03:52:20,827 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17038777908343125 [2022-12-06 03:52:20,827 INFO L175 Difference]: Start difference. First operand has 210 places, 465 transitions, 10936 flow. Second operand 23 states and 145 transitions. [2022-12-06 03:52:20,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 570 transitions, 13183 flow [2022-12-06 03:52:21,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 570 transitions, 12683 flow, removed 231 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:21,274 INFO L231 Difference]: Finished difference. Result has 233 places, 495 transitions, 11811 flow [2022-12-06 03:52:21,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10436, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=11811, PETRI_PLACES=233, PETRI_TRANSITIONS=495} [2022-12-06 03:52:21,275 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 215 predicate places. [2022-12-06 03:52:21,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:21,275 INFO L89 Accepts]: Start accepts. Operand has 233 places, 495 transitions, 11811 flow [2022-12-06 03:52:21,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:21,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:21,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 495 transitions, 11811 flow [2022-12-06 03:52:21,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 495 transitions, 11811 flow [2022-12-06 03:52:21,389 INFO L130 PetriNetUnfolder]: 323/864 cut-off events. [2022-12-06 03:52:21,389 INFO L131 PetriNetUnfolder]: For 32087/32122 co-relation queries the response was YES. [2022-12-06 03:52:21,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9274 conditions, 864 events. 323/864 cut-off events. For 32087/32122 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6542 event pairs, 0 based on Foata normal form. 4/865 useless extension candidates. Maximal degree in co-relation 9185. Up to 426 conditions per place. [2022-12-06 03:52:21,401 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 495 transitions, 11811 flow [2022-12-06 03:52:21,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 1534 [2022-12-06 03:52:21,568 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:52:21,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 294 [2022-12-06 03:52:21,569 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 495 transitions, 11859 flow [2022-12-06 03:52:21,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:21,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:21,569 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:21,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:21,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:21,769 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -109285320, now seen corresponding path program 1 times [2022-12-06 03:52:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:21,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815005570] [2022-12-06 03:52:21,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:21,932 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 03:52:21,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:21,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815005570] [2022-12-06 03:52:21,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815005570] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:21,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015129627] [2022-12-06 03:52:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:21,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:21,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:21,948 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:21,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 03:52:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:22,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:22,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:22,168 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 03:52:22,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:22,279 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 03:52:22,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015129627] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:22,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:22,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:22,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380811339] [2022-12-06 03:52:22,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:22,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:22,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:22,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:22,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:22,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 03:52:22,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 495 transitions, 11859 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:22,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:22,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 03:52:22,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:23,610 INFO L130 PetriNetUnfolder]: 2268/3941 cut-off events. [2022-12-06 03:52:23,610 INFO L131 PetriNetUnfolder]: For 196893/196893 co-relation queries the response was YES. [2022-12-06 03:52:23,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35515 conditions, 3941 events. 2268/3941 cut-off events. For 196893/196893 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 26599 event pairs, 181 based on Foata normal form. 34/3961 useless extension candidates. Maximal degree in co-relation 35423. Up to 2234 conditions per place. [2022-12-06 03:52:23,644 INFO L137 encePairwiseOnDemand]: 8/41 looper letters, 348 selfloop transitions, 350 changer transitions 1/699 dead transitions. [2022-12-06 03:52:23,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 699 transitions, 16748 flow [2022-12-06 03:52:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 03:52:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 03:52:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 182 transitions. [2022-12-06 03:52:23,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17073170731707318 [2022-12-06 03:52:23,646 INFO L175 Difference]: Start difference. First operand has 233 places, 495 transitions, 11859 flow. Second operand 26 states and 182 transitions. [2022-12-06 03:52:23,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 699 transitions, 16748 flow [2022-12-06 03:52:24,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 699 transitions, 16530 flow, removed 42 selfloop flow, removed 13 redundant places. [2022-12-06 03:52:24,354 INFO L231 Difference]: Finished difference. Result has 255 places, 604 transitions, 15798 flow [2022-12-06 03:52:24,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11647, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=15798, PETRI_PLACES=255, PETRI_TRANSITIONS=604} [2022-12-06 03:52:24,355 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 237 predicate places. [2022-12-06 03:52:24,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:24,355 INFO L89 Accepts]: Start accepts. Operand has 255 places, 604 transitions, 15798 flow [2022-12-06 03:52:24,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:24,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:24,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 604 transitions, 15798 flow [2022-12-06 03:52:24,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 604 transitions, 15798 flow [2022-12-06 03:52:24,513 INFO L130 PetriNetUnfolder]: 380/1016 cut-off events. [2022-12-06 03:52:24,513 INFO L131 PetriNetUnfolder]: For 45195/45226 co-relation queries the response was YES. [2022-12-06 03:52:24,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11889 conditions, 1016 events. 380/1016 cut-off events. For 45195/45226 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 8035 event pairs, 0 based on Foata normal form. 4/1017 useless extension candidates. Maximal degree in co-relation 11789. Up to 535 conditions per place. [2022-12-06 03:52:24,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 604 transitions, 15798 flow [2022-12-06 03:52:24,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 1806 [2022-12-06 03:52:24,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [385] L687-5-->L687-5: Formula: (and (= (+ (* v_~j~0_317 2) v_~i~0_283) v_~i~0_281) (< v_~p~0_169 5) (= v_~p~0_167 (+ v_~p~0_169 2))) InVars {~j~0=v_~j~0_317, ~i~0=v_~i~0_283, ~p~0=v_~p~0_169} OutVars{~j~0=v_~j~0_317, ~i~0=v_~i~0_281, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_126|, ~p~0=v_~p~0_167} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:52:24,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:52:24,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:52:24,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2)) (< v_~p~0_72 5)) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [386] L705-6-->L687-5: Formula: (and (< v_~x~0_252 1) (= v_~next~0_138 (+ (* 144 v_~prev~0_264) (* 233 v_~cur~0_220) v_~prev~0_263)) (< v_~p~0_174 5) (= v_~next~0_138 v_~cur~0_219) (= (+ (* 377 v_~cur~0_220) (* 233 v_~prev~0_264)) v_~prev~0_263) (= (+ (* v_~j~0_319 2) v_~i~0_288) v_~i~0_287) (= v_~p~0_173 (+ v_~p~0_174 2)) (= (+ 14 v_~x~0_252) v_~x~0_251)) InVars {~j~0=v_~j~0_319, ~prev~0=v_~prev~0_264, ~i~0=v_~i~0_288, ~p~0=v_~p~0_174, ~cur~0=v_~cur~0_220, ~x~0=v_~x~0_252} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_159|, ~j~0=v_~j~0_319, ~next~0=v_~next~0_138, ~prev~0=v_~prev~0_263, ~i~0=v_~i~0_287, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_130|, ~p~0=v_~p~0_173, ~cur~0=v_~cur~0_219, ~x~0=v_~x~0_251} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:52:24,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2)) (< v_~p~0_72 5)) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [388] L705-6-->L687-5: Formula: (and (= v_~next~0_142 v_~cur~0_227) (= v_~prev~0_271 (+ (* 233 v_~prev~0_272) (* 377 v_~cur~0_228))) (= v_~next~0_142 (+ (* 144 v_~prev~0_272) v_~prev~0_271 (* 233 v_~cur~0_228))) (< v_~x~0_260 1) (= (+ 14 v_~x~0_260) v_~x~0_259) (< v_~p~0_178 6) (= (+ v_~j~0_325 v_~i~0_294) v_~i~0_293) (= v_~p~0_177 (+ v_~p~0_178 1))) InVars {~j~0=v_~j~0_325, ~prev~0=v_~prev~0_272, ~i~0=v_~i~0_294, ~p~0=v_~p~0_178, ~cur~0=v_~cur~0_228, ~x~0=v_~x~0_260} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_163|, ~j~0=v_~j~0_325, ~next~0=v_~next~0_142, ~prev~0=v_~prev~0_271, ~i~0=v_~i~0_293, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_132|, ~p~0=v_~p~0_177, ~cur~0=v_~cur~0_227, ~x~0=v_~x~0_259} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:52:25,024 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 03:52:25,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 672 [2022-12-06 03:52:25,028 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 604 transitions, 15903 flow [2022-12-06 03:52:25,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:25,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:25,028 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:25,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:25,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 03:52:25,232 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:25,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash -128789776, now seen corresponding path program 1 times [2022-12-06 03:52:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:25,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045485735] [2022-12-06 03:52:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:25,340 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 03:52:25,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:25,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045485735] [2022-12-06 03:52:25,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045485735] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:25,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464357566] [2022-12-06 03:52:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:25,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:25,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:25,357 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:25,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 03:52:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:25,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:52:25,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:25,552 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 03:52:25,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:25,669 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 03:52:25,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464357566] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:25,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:25,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003347117] [2022-12-06 03:52:25,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:25,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:25,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:25,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 03:52:25,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 604 transitions, 15903 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:25,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:25,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 03:52:25,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:27,125 INFO L130 PetriNetUnfolder]: 2408/4215 cut-off events. [2022-12-06 03:52:27,126 INFO L131 PetriNetUnfolder]: For 279379/279379 co-relation queries the response was YES. [2022-12-06 03:52:27,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40558 conditions, 4215 events. 2408/4215 cut-off events. For 279379/279379 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 28950 event pairs, 363 based on Foata normal form. 58/4253 useless extension candidates. Maximal degree in co-relation 40455. Up to 2896 conditions per place. [2022-12-06 03:52:27,165 INFO L137 encePairwiseOnDemand]: 8/47 looper letters, 433 selfloop transitions, 311 changer transitions 2/746 dead transitions. [2022-12-06 03:52:27,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 746 transitions, 19539 flow [2022-12-06 03:52:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:52:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:52:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 156 transitions. [2022-12-06 03:52:27,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1327659574468085 [2022-12-06 03:52:27,167 INFO L175 Difference]: Start difference. First operand has 255 places, 604 transitions, 15903 flow. Second operand 25 states and 156 transitions. [2022-12-06 03:52:27,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 746 transitions, 19539 flow [2022-12-06 03:52:28,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 746 transitions, 18560 flow, removed 414 selfloop flow, removed 12 redundant places. [2022-12-06 03:52:28,299 INFO L231 Difference]: Finished difference. Result has 274 places, 666 transitions, 17775 flow [2022-12-06 03:52:28,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=14936, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=17775, PETRI_PLACES=274, PETRI_TRANSITIONS=666} [2022-12-06 03:52:28,300 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 256 predicate places. [2022-12-06 03:52:28,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:28,300 INFO L89 Accepts]: Start accepts. Operand has 274 places, 666 transitions, 17775 flow [2022-12-06 03:52:28,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:28,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:28,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 666 transitions, 17775 flow [2022-12-06 03:52:28,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 666 transitions, 17775 flow [2022-12-06 03:52:28,516 INFO L130 PetriNetUnfolder]: 424/1127 cut-off events. [2022-12-06 03:52:28,516 INFO L131 PetriNetUnfolder]: For 54228/54307 co-relation queries the response was YES. [2022-12-06 03:52:28,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13366 conditions, 1127 events. 424/1127 cut-off events. For 54228/54307 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 9041 event pairs, 0 based on Foata normal form. 5/1129 useless extension candidates. Maximal degree in co-relation 13260. Up to 599 conditions per place. [2022-12-06 03:52:28,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 666 transitions, 17775 flow [2022-12-06 03:52:28,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 1928 [2022-12-06 03:52:28,890 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 03:52:28,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 591 [2022-12-06 03:52:28,891 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 666 transitions, 17874 flow [2022-12-06 03:52:28,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:28,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:28,891 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:28,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:29,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 03:52:29,095 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash -102433948, now seen corresponding path program 1 times [2022-12-06 03:52:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:29,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868114943] [2022-12-06 03:52:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:29,190 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 03:52:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:29,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868114943] [2022-12-06 03:52:29,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868114943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:29,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82069993] [2022-12-06 03:52:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:29,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:29,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:29,209 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:29,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 03:52:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:29,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:29,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:29,372 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 03:52:29,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:29,507 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 03:52:29,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82069993] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:29,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:29,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652628446] [2022-12-06 03:52:29,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:29,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 03:52:29,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 666 transitions, 17874 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:29,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:29,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 03:52:29,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:31,381 INFO L130 PetriNetUnfolder]: 2750/4817 cut-off events. [2022-12-06 03:52:31,382 INFO L131 PetriNetUnfolder]: For 325427/325427 co-relation queries the response was YES. [2022-12-06 03:52:31,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47597 conditions, 4817 events. 2750/4817 cut-off events. For 325427/325427 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 33985 event pairs, 257 based on Foata normal form. 36/4839 useless extension candidates. Maximal degree in co-relation 47488. Up to 2707 conditions per place. [2022-12-06 03:52:31,480 INFO L137 encePairwiseOnDemand]: 8/53 looper letters, 423 selfloop transitions, 443 changer transitions 2/868 dead transitions. [2022-12-06 03:52:31,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 868 transitions, 23417 flow [2022-12-06 03:52:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:52:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:52:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 190 transitions. [2022-12-06 03:52:31,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14339622641509434 [2022-12-06 03:52:31,482 INFO L175 Difference]: Start difference. First operand has 273 places, 666 transitions, 17874 flow. Second operand 25 states and 190 transitions. [2022-12-06 03:52:31,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 868 transitions, 23417 flow [2022-12-06 03:52:32,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 868 transitions, 22312 flow, removed 504 selfloop flow, removed 8 redundant places. [2022-12-06 03:52:32,723 INFO L231 Difference]: Finished difference. Result has 299 places, 775 transitions, 21392 flow [2022-12-06 03:52:32,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=16957, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=352, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=21392, PETRI_PLACES=299, PETRI_TRANSITIONS=775} [2022-12-06 03:52:32,723 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 281 predicate places. [2022-12-06 03:52:32,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:32,723 INFO L89 Accepts]: Start accepts. Operand has 299 places, 775 transitions, 21392 flow [2022-12-06 03:52:32,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:32,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:32,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 775 transitions, 21392 flow [2022-12-06 03:52:32,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 775 transitions, 21392 flow [2022-12-06 03:52:32,952 INFO L130 PetriNetUnfolder]: 485/1296 cut-off events. [2022-12-06 03:52:32,952 INFO L131 PetriNetUnfolder]: For 73824/73908 co-relation queries the response was YES. [2022-12-06 03:52:32,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16041 conditions, 1296 events. 485/1296 cut-off events. For 73824/73908 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 10710 event pairs, 1 based on Foata normal form. 5/1298 useless extension candidates. Maximal degree in co-relation 15925. Up to 716 conditions per place. [2022-12-06 03:52:32,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 775 transitions, 21392 flow [2022-12-06 03:52:32,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 2212 [2022-12-06 03:52:33,071 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:52:33,109 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:52:33,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [373] L695-5-->L695-5: Formula: (and (= v_~j~0_247 (+ v_~j~0_249 (* 2 v_~i~0_213))) (= v_~q~0_160 (+ 2 v_~q~0_162)) (< v_~q~0_160 7)) InVars {~j~0=v_~j~0_249, ~i~0=v_~i~0_213, ~q~0=v_~q~0_162} OutVars{~j~0=v_~j~0_247, ~i~0=v_~i~0_213, ~q~0=v_~q~0_160, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_115|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [402] L705-6-->L695-5: Formula: (and (= v_~j~0_383 (+ v_~j~0_384 v_~i~0_379)) (= v_~prev~0_315 (+ (* 233 v_~prev~0_316) (* 377 v_~cur~0_266))) (< v_~q~0_247 6) (= (+ 14 v_~x~0_302) v_~x~0_301) (= (+ (* 233 v_~cur~0_266) (* 144 v_~prev~0_316) v_~prev~0_315) v_~next~0_160) (= v_~q~0_246 (+ v_~q~0_247 1)) (= v_~next~0_160 v_~cur~0_265) (< v_~x~0_302 1)) InVars {~j~0=v_~j~0_384, ~prev~0=v_~prev~0_316, ~i~0=v_~i~0_379, ~q~0=v_~q~0_247, ~cur~0=v_~cur~0_266, ~x~0=v_~x~0_302} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_183|, ~j~0=v_~j~0_383, ~next~0=v_~next~0_160, ~prev~0=v_~prev~0_315, ~i~0=v_~i~0_379, ~q~0=v_~q~0_246, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_178|, ~cur~0=v_~cur~0_265, ~x~0=v_~x~0_301} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:52:33,222 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:52:33,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 500 [2022-12-06 03:52:33,223 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 775 transitions, 21422 flow [2022-12-06 03:52:33,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:33,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:33,223 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:33,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-06 03:52:33,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:33,424 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash 69073042, now seen corresponding path program 1 times [2022-12-06 03:52:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:33,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822234998] [2022-12-06 03:52:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:52:33,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:33,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822234998] [2022-12-06 03:52:33,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822234998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:33,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:33,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:52:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759449271] [2022-12-06 03:52:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:33,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:52:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:33,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:52:33,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:52:33,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:52:33,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 775 transitions, 21422 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:33,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:33,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:52:33,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:34,665 INFO L130 PetriNetUnfolder]: 2651/4642 cut-off events. [2022-12-06 03:52:34,665 INFO L131 PetriNetUnfolder]: For 310379/310379 co-relation queries the response was YES. [2022-12-06 03:52:34,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49171 conditions, 4642 events. 2651/4642 cut-off events. For 310379/310379 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 32862 event pairs, 870 based on Foata normal form. 120/4750 useless extension candidates. Maximal degree in co-relation 49052. Up to 4197 conditions per place. [2022-12-06 03:52:34,781 INFO L137 encePairwiseOnDemand]: 36/56 looper letters, 735 selfloop transitions, 59 changer transitions 1/795 dead transitions. [2022-12-06 03:52:34,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 795 transitions, 23505 flow [2022-12-06 03:52:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:52:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:52:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-06 03:52:34,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 03:52:34,782 INFO L175 Difference]: Start difference. First operand has 299 places, 775 transitions, 21422 flow. Second operand 3 states and 66 transitions. [2022-12-06 03:52:34,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 795 transitions, 23505 flow [2022-12-06 03:52:36,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 795 transitions, 22779 flow, removed 327 selfloop flow, removed 7 redundant places. [2022-12-06 03:52:36,563 INFO L231 Difference]: Finished difference. Result has 295 places, 776 transitions, 20938 flow [2022-12-06 03:52:36,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=20574, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20938, PETRI_PLACES=295, PETRI_TRANSITIONS=776} [2022-12-06 03:52:36,564 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 277 predicate places. [2022-12-06 03:52:36,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:36,564 INFO L89 Accepts]: Start accepts. Operand has 295 places, 776 transitions, 20938 flow [2022-12-06 03:52:36,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:36,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:36,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 295 places, 776 transitions, 20938 flow [2022-12-06 03:52:36,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 776 transitions, 20938 flow [2022-12-06 03:52:36,826 INFO L130 PetriNetUnfolder]: 482/1286 cut-off events. [2022-12-06 03:52:36,827 INFO L131 PetriNetUnfolder]: For 71286/71367 co-relation queries the response was YES. [2022-12-06 03:52:36,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15886 conditions, 1286 events. 482/1286 cut-off events. For 71286/71367 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 10809 event pairs, 1 based on Foata normal form. 5/1288 useless extension candidates. Maximal degree in co-relation 15769. Up to 704 conditions per place. [2022-12-06 03:52:36,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 776 transitions, 20938 flow [2022-12-06 03:52:36,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 2134 [2022-12-06 03:52:36,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:36,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 293 [2022-12-06 03:52:36,857 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 776 transitions, 20938 flow [2022-12-06 03:52:36,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:36,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:36,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:36,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 03:52:36,858 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:36,858 INFO L85 PathProgramCache]: Analyzing trace with hash 67734710, now seen corresponding path program 1 times [2022-12-06 03:52:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:36,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643743132] [2022-12-06 03:52:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:36,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643743132] [2022-12-06 03:52:36,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643743132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:36,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:36,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:52:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523846073] [2022-12-06 03:52:36,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:36,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:52:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:36,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:52:36,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:52:36,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 03:52:36,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 776 transitions, 20938 flow. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:36,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:36,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 03:52:36,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:38,237 INFO L130 PetriNetUnfolder]: 2871/4949 cut-off events. [2022-12-06 03:52:38,237 INFO L131 PetriNetUnfolder]: For 345361/345361 co-relation queries the response was YES. [2022-12-06 03:52:38,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52804 conditions, 4949 events. 2871/4949 cut-off events. For 345361/345361 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 35494 event pairs, 336 based on Foata normal form. 16/4953 useless extension candidates. Maximal degree in co-relation 52684. Up to 2145 conditions per place. [2022-12-06 03:52:38,298 INFO L137 encePairwiseOnDemand]: 33/55 looper letters, 1171 selfloop transitions, 62 changer transitions 8/1241 dead transitions. [2022-12-06 03:52:38,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1241 transitions, 36326 flow [2022-12-06 03:52:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:52:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:52:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 03:52:38,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3236363636363636 [2022-12-06 03:52:38,300 INFO L175 Difference]: Start difference. First operand has 294 places, 776 transitions, 20938 flow. Second operand 5 states and 89 transitions. [2022-12-06 03:52:38,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1241 transitions, 36326 flow [2022-12-06 03:52:40,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 1241 transitions, 36251 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:40,082 INFO L231 Difference]: Finished difference. Result has 295 places, 768 transitions, 20829 flow [2022-12-06 03:52:40,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=20685, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20829, PETRI_PLACES=295, PETRI_TRANSITIONS=768} [2022-12-06 03:52:40,083 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 277 predicate places. [2022-12-06 03:52:40,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:40,083 INFO L89 Accepts]: Start accepts. Operand has 295 places, 768 transitions, 20829 flow [2022-12-06 03:52:40,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:40,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:40,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 295 places, 768 transitions, 20829 flow [2022-12-06 03:52:40,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 768 transitions, 20829 flow [2022-12-06 03:52:40,341 INFO L130 PetriNetUnfolder]: 537/1407 cut-off events. [2022-12-06 03:52:40,341 INFO L131 PetriNetUnfolder]: For 83994/84095 co-relation queries the response was YES. [2022-12-06 03:52:40,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17813 conditions, 1407 events. 537/1407 cut-off events. For 83994/84095 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 11924 event pairs, 1 based on Foata normal form. 5/1409 useless extension candidates. Maximal degree in co-relation 17694. Up to 788 conditions per place. [2022-12-06 03:52:40,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 295 places, 768 transitions, 20829 flow [2022-12-06 03:52:40,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 2222 [2022-12-06 03:52:40,368 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:40,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 03:52:40,369 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 768 transitions, 20829 flow [2022-12-06 03:52:40,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:40,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:40,369 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:40,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 03:52:40,369 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 551300857, now seen corresponding path program 1 times [2022-12-06 03:52:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:40,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077958048] [2022-12-06 03:52:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:40,441 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 03:52:40,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:40,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077958048] [2022-12-06 03:52:40,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077958048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:40,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292048610] [2022-12-06 03:52:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:40,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:40,443 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:40,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 03:52:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:40,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:40,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:40,582 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 03:52:40,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:40,673 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 03:52:40,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292048610] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:40,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:40,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837139803] [2022-12-06 03:52:40,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:40,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:40,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:40,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:40,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 03:52:40,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 768 transitions, 20829 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:40,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:40,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 03:52:40,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:42,209 INFO L130 PetriNetUnfolder]: 2935/5081 cut-off events. [2022-12-06 03:52:42,209 INFO L131 PetriNetUnfolder]: For 383845/383845 co-relation queries the response was YES. [2022-12-06 03:52:42,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55231 conditions, 5081 events. 2935/5081 cut-off events. For 383845/383845 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 35796 event pairs, 516 based on Foata normal form. 22/5091 useless extension candidates. Maximal degree in co-relation 55109. Up to 4126 conditions per place. [2022-12-06 03:52:42,354 INFO L137 encePairwiseOnDemand]: 8/53 looper letters, 590 selfloop transitions, 262 changer transitions 1/853 dead transitions. [2022-12-06 03:52:42,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 853 transitions, 23822 flow [2022-12-06 03:52:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:52:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:52:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 114 transitions. [2022-12-06 03:52:42,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15363881401617252 [2022-12-06 03:52:42,361 INFO L175 Difference]: Start difference. First operand has 295 places, 768 transitions, 20829 flow. Second operand 14 states and 114 transitions. [2022-12-06 03:52:42,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 853 transitions, 23822 flow [2022-12-06 03:52:44,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 853 transitions, 23749 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:44,861 INFO L231 Difference]: Finished difference. Result has 311 places, 798 transitions, 22575 flow [2022-12-06 03:52:44,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=20768, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=22575, PETRI_PLACES=311, PETRI_TRANSITIONS=798} [2022-12-06 03:52:44,861 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 293 predicate places. [2022-12-06 03:52:44,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:44,861 INFO L89 Accepts]: Start accepts. Operand has 311 places, 798 transitions, 22575 flow [2022-12-06 03:52:44,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:44,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:44,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 798 transitions, 22575 flow [2022-12-06 03:52:44,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 798 transitions, 22575 flow [2022-12-06 03:52:45,149 INFO L130 PetriNetUnfolder]: 551/1458 cut-off events. [2022-12-06 03:52:45,149 INFO L131 PetriNetUnfolder]: For 96414/96525 co-relation queries the response was YES. [2022-12-06 03:52:45,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19125 conditions, 1458 events. 551/1458 cut-off events. For 96414/96525 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 12491 event pairs, 1 based on Foata normal form. 5/1460 useless extension candidates. Maximal degree in co-relation 19001. Up to 820 conditions per place. [2022-12-06 03:52:45,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 798 transitions, 22575 flow [2022-12-06 03:52:45,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 2286 [2022-12-06 03:52:45,182 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:45,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-06 03:52:45,185 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 798 transitions, 22575 flow [2022-12-06 03:52:45,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:45,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:45,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:45,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:45,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:45,390 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -100356669, now seen corresponding path program 1 times [2022-12-06 03:52:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:45,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344413160] [2022-12-06 03:52:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:45,556 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 03:52:45,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:45,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344413160] [2022-12-06 03:52:45,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344413160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:45,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340906739] [2022-12-06 03:52:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:45,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:45,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:45,570 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:45,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 03:52:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:45,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:45,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:45,792 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 03:52:45,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:45,897 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 03:52:45,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340906739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:45,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:45,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498793148] [2022-12-06 03:52:45,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:45,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:45,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 03:52:45,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 798 transitions, 22575 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:45,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:45,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 03:52:45,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:48,062 INFO L130 PetriNetUnfolder]: 3079/5371 cut-off events. [2022-12-06 03:52:48,062 INFO L131 PetriNetUnfolder]: For 493230/493230 co-relation queries the response was YES. [2022-12-06 03:52:48,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59755 conditions, 5371 events. 3079/5371 cut-off events. For 493230/493230 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 38463 event pairs, 269 based on Foata normal form. 52/5411 useless extension candidates. Maximal degree in co-relation 59628. Up to 3299 conditions per place. [2022-12-06 03:52:48,120 INFO L137 encePairwiseOnDemand]: 8/53 looper letters, 451 selfloop transitions, 528 changer transitions 0/979 dead transitions. [2022-12-06 03:52:48,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 979 transitions, 27675 flow [2022-12-06 03:52:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:52:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:52:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 163 transitions. [2022-12-06 03:52:48,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14645103324348607 [2022-12-06 03:52:48,121 INFO L175 Difference]: Start difference. First operand has 311 places, 798 transitions, 22575 flow. Second operand 21 states and 163 transitions. [2022-12-06 03:52:48,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 979 transitions, 27675 flow [2022-12-06 03:52:50,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 979 transitions, 27497 flow, removed 35 selfloop flow, removed 7 redundant places. [2022-12-06 03:52:50,423 INFO L231 Difference]: Finished difference. Result has 331 places, 877 transitions, 26608 flow [2022-12-06 03:52:50,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=22411, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=460, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=26608, PETRI_PLACES=331, PETRI_TRANSITIONS=877} [2022-12-06 03:52:50,424 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 313 predicate places. [2022-12-06 03:52:50,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:50,424 INFO L89 Accepts]: Start accepts. Operand has 331 places, 877 transitions, 26608 flow [2022-12-06 03:52:50,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:50,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:50,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 877 transitions, 26608 flow [2022-12-06 03:52:50,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 877 transitions, 26608 flow [2022-12-06 03:52:50,811 INFO L130 PetriNetUnfolder]: 600/1579 cut-off events. [2022-12-06 03:52:50,812 INFO L131 PetriNetUnfolder]: For 111338/111456 co-relation queries the response was YES. [2022-12-06 03:52:50,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21877 conditions, 1579 events. 600/1579 cut-off events. For 111338/111456 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 13695 event pairs, 2 based on Foata normal form. 5/1581 useless extension candidates. Maximal degree in co-relation 21745. Up to 902 conditions per place. [2022-12-06 03:52:50,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 877 transitions, 26608 flow [2022-12-06 03:52:50,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 2436 [2022-12-06 03:52:50,843 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:50,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 420 [2022-12-06 03:52:50,844 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 877 transitions, 26608 flow [2022-12-06 03:52:50,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:50,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:50,844 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:50,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:51,047 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1525904651, now seen corresponding path program 1 times [2022-12-06 03:52:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:51,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139857549] [2022-12-06 03:52:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:51,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139857549] [2022-12-06 03:52:51,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139857549] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:51,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850952812] [2022-12-06 03:52:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:51,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:51,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:51,122 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 03:52:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:51,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:52:51,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:51,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:51,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850952812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:51,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:51,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 03:52:51,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071383953] [2022-12-06 03:52:51,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:51,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:52:51,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:51,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:52:51,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:52:51,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 03:52:51,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 877 transitions, 26608 flow. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:51,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:51,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 03:52:51,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:52,890 INFO L130 PetriNetUnfolder]: 3147/5475 cut-off events. [2022-12-06 03:52:52,890 INFO L131 PetriNetUnfolder]: For 467834/467834 co-relation queries the response was YES. [2022-12-06 03:52:52,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64522 conditions, 5475 events. 3147/5475 cut-off events. For 467834/467834 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 40527 event pairs, 586 based on Foata normal form. 76/5539 useless extension candidates. Maximal degree in co-relation 64387. Up to 2662 conditions per place. [2022-12-06 03:52:52,963 INFO L137 encePairwiseOnDemand]: 44/53 looper letters, 1255 selfloop transitions, 59 changer transitions 8/1322 dead transitions. [2022-12-06 03:52:52,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1322 transitions, 43509 flow [2022-12-06 03:52:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:52:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:52:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-06 03:52:52,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27672955974842767 [2022-12-06 03:52:52,964 INFO L175 Difference]: Start difference. First operand has 331 places, 877 transitions, 26608 flow. Second operand 6 states and 88 transitions. [2022-12-06 03:52:52,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 1322 transitions, 43509 flow [2022-12-06 03:52:55,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1322 transitions, 42601 flow, removed 400 selfloop flow, removed 7 redundant places. [2022-12-06 03:52:55,324 INFO L231 Difference]: Finished difference. Result has 332 places, 883 transitions, 26588 flow [2022-12-06 03:52:55,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=25631, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=810, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=26588, PETRI_PLACES=332, PETRI_TRANSITIONS=883} [2022-12-06 03:52:55,324 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 314 predicate places. [2022-12-06 03:52:55,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:55,325 INFO L89 Accepts]: Start accepts. Operand has 332 places, 883 transitions, 26588 flow [2022-12-06 03:52:55,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:55,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:55,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 883 transitions, 26588 flow [2022-12-06 03:52:55,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 883 transitions, 26588 flow [2022-12-06 03:52:55,676 INFO L130 PetriNetUnfolder]: 616/1653 cut-off events. [2022-12-06 03:52:55,677 INFO L131 PetriNetUnfolder]: For 125488/125577 co-relation queries the response was YES. [2022-12-06 03:52:55,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23326 conditions, 1653 events. 616/1653 cut-off events. For 125488/125577 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 14654 event pairs, 2 based on Foata normal form. 9/1659 useless extension candidates. Maximal degree in co-relation 23192. Up to 944 conditions per place. [2022-12-06 03:52:55,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 332 places, 883 transitions, 26588 flow [2022-12-06 03:52:55,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 2528 [2022-12-06 03:52:55,711 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:55,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-06 03:52:55,711 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 883 transitions, 26588 flow [2022-12-06 03:52:55,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:55,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:55,711 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:55,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:55,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:55,916 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash -85294234, now seen corresponding path program 1 times [2022-12-06 03:52:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:55,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062190350] [2022-12-06 03:52:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:56,004 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 03:52:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:56,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062190350] [2022-12-06 03:52:56,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062190350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:56,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390046917] [2022-12-06 03:52:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:56,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:56,005 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:56,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 03:52:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:56,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:52:56,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:56,177 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 03:52:56,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:56,294 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 03:52:56,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390046917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:56,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:56,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:56,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356775893] [2022-12-06 03:52:56,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:56,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:56,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:56,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:56,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:56,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 03:52:56,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 883 transitions, 26588 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:56,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:56,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 03:52:56,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:58,689 INFO L130 PetriNetUnfolder]: 3709/6377 cut-off events. [2022-12-06 03:52:58,689 INFO L131 PetriNetUnfolder]: For 657068/657068 co-relation queries the response was YES. [2022-12-06 03:52:58,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78130 conditions, 6377 events. 3709/6377 cut-off events. For 657068/657068 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 46231 event pairs, 158 based on Foata normal form. 42/6407 useless extension candidates. Maximal degree in co-relation 77993. Up to 2559 conditions per place. [2022-12-06 03:52:58,773 INFO L137 encePairwiseOnDemand]: 8/53 looper letters, 333 selfloop transitions, 776 changer transitions 0/1109 dead transitions. [2022-12-06 03:52:58,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1109 transitions, 33507 flow [2022-12-06 03:52:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 03:52:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 03:52:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 168 transitions. [2022-12-06 03:52:58,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16683217477656406 [2022-12-06 03:52:58,774 INFO L175 Difference]: Start difference. First operand has 332 places, 883 transitions, 26588 flow. Second operand 19 states and 168 transitions. [2022-12-06 03:52:58,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1109 transitions, 33507 flow [2022-12-06 03:53:02,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1109 transitions, 33290 flow, removed 108 selfloop flow, removed 1 redundant places. [2022-12-06 03:53:02,048 INFO L231 Difference]: Finished difference. Result has 354 places, 983 transitions, 32409 flow [2022-12-06 03:53:02,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=26435, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=693, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=32409, PETRI_PLACES=354, PETRI_TRANSITIONS=983} [2022-12-06 03:53:02,049 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 336 predicate places. [2022-12-06 03:53:02,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:02,049 INFO L89 Accepts]: Start accepts. Operand has 354 places, 983 transitions, 32409 flow [2022-12-06 03:53:02,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:02,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:02,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 983 transitions, 32409 flow [2022-12-06 03:53:02,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 354 places, 983 transitions, 32409 flow [2022-12-06 03:53:02,515 INFO L130 PetriNetUnfolder]: 718/1898 cut-off events. [2022-12-06 03:53:02,515 INFO L131 PetriNetUnfolder]: For 169286/169386 co-relation queries the response was YES. [2022-12-06 03:53:02,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29175 conditions, 1898 events. 718/1898 cut-off events. For 169286/169386 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 17297 event pairs, 2 based on Foata normal form. 9/1904 useless extension candidates. Maximal degree in co-relation 29035. Up to 1110 conditions per place. [2022-12-06 03:53:02,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 354 places, 983 transitions, 32409 flow [2022-12-06 03:53:02,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 2878 [2022-12-06 03:53:02,557 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:02,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 509 [2022-12-06 03:53:02,558 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 983 transitions, 32409 flow [2022-12-06 03:53:02,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:02,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:02,558 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:02,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:02,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 03:53:02,762 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:02,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash -171718607, now seen corresponding path program 1 times [2022-12-06 03:53:02,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:02,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361070862] [2022-12-06 03:53:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:02,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:02,847 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 03:53:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:02,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361070862] [2022-12-06 03:53:02,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361070862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:02,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508204253] [2022-12-06 03:53:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:02,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:02,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:02,849 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:02,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 03:53:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:02,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:53:02,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:03,026 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 03:53:03,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:03,137 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 03:53:03,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508204253] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:03,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:03,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725873219] [2022-12-06 03:53:03,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:03,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:03,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:03,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 03:53:03,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 983 transitions, 32409 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:03,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:03,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 03:53:03,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:05,972 INFO L130 PetriNetUnfolder]: 3750/6469 cut-off events. [2022-12-06 03:53:05,972 INFO L131 PetriNetUnfolder]: For 669230/669230 co-relation queries the response was YES. [2022-12-06 03:53:06,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83011 conditions, 6469 events. 3750/6469 cut-off events. For 669230/669230 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 47479 event pairs, 586 based on Foata normal form. 24/6481 useless extension candidates. Maximal degree in co-relation 82868. Up to 5232 conditions per place. [2022-12-06 03:53:06,065 INFO L137 encePairwiseOnDemand]: 8/53 looper letters, 771 selfloop transitions, 341 changer transitions 2/1114 dead transitions. [2022-12-06 03:53:06,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1114 transitions, 36499 flow [2022-12-06 03:53:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:53:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:53:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 155 transitions. [2022-12-06 03:53:06,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13293310463121785 [2022-12-06 03:53:06,066 INFO L175 Difference]: Start difference. First operand has 354 places, 983 transitions, 32409 flow. Second operand 22 states and 155 transitions. [2022-12-06 03:53:06,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1114 transitions, 36499 flow [2022-12-06 03:53:09,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 1114 transitions, 35237 flow, removed 540 selfloop flow, removed 10 redundant places. [2022-12-06 03:53:09,328 INFO L231 Difference]: Finished difference. Result has 369 places, 1015 transitions, 33363 flow [2022-12-06 03:53:09,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=31205, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=983, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=33363, PETRI_PLACES=369, PETRI_TRANSITIONS=1015} [2022-12-06 03:53:09,329 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 351 predicate places. [2022-12-06 03:53:09,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:09,329 INFO L89 Accepts]: Start accepts. Operand has 369 places, 1015 transitions, 33363 flow [2022-12-06 03:53:09,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:09,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:09,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 1015 transitions, 33363 flow [2022-12-06 03:53:09,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 1015 transitions, 33363 flow [2022-12-06 03:53:09,830 INFO L130 PetriNetUnfolder]: 731/1937 cut-off events. [2022-12-06 03:53:09,830 INFO L131 PetriNetUnfolder]: For 168767/168889 co-relation queries the response was YES. [2022-12-06 03:53:09,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29367 conditions, 1937 events. 731/1937 cut-off events. For 168767/168889 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 17682 event pairs, 2 based on Foata normal form. 9/1943 useless extension candidates. Maximal degree in co-relation 29226. Up to 1134 conditions per place. [2022-12-06 03:53:09,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 369 places, 1015 transitions, 33363 flow [2022-12-06 03:53:09,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 2934 [2022-12-06 03:53:10,039 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:53:10,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 711 [2022-12-06 03:53:10,040 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 1015 transitions, 33414 flow [2022-12-06 03:53:10,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:10,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:10,040 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:10,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-06 03:53:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 03:53:10,246 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1897697766, now seen corresponding path program 1 times [2022-12-06 03:53:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:10,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034104317] [2022-12-06 03:53:10,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:10,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:10,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034104317] [2022-12-06 03:53:10,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034104317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:10,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711689644] [2022-12-06 03:53:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:10,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:10,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:10,292 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:10,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 03:53:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:10,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:53:10,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:10,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:10,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711689644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:10,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:10,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-06 03:53:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992286342] [2022-12-06 03:53:10,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:10,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:53:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:53:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:53:10,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 03:53:10,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 1015 transitions, 33414 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:10,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:10,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 03:53:10,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:12,567 INFO L130 PetriNetUnfolder]: 3674/6365 cut-off events. [2022-12-06 03:53:12,568 INFO L131 PetriNetUnfolder]: For 653045/653045 co-relation queries the response was YES. [2022-12-06 03:53:12,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81384 conditions, 6365 events. 3674/6365 cut-off events. For 653045/653045 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 47329 event pairs, 640 based on Foata normal form. 72/6425 useless extension candidates. Maximal degree in co-relation 81240. Up to 3132 conditions per place. [2022-12-06 03:53:12,659 INFO L137 encePairwiseOnDemand]: 49/55 looper letters, 1441 selfloop transitions, 31 changer transitions 34/1506 dead transitions. [2022-12-06 03:53:12,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1506 transitions, 52599 flow [2022-12-06 03:53:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:53:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:53:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 03:53:12,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2872727272727273 [2022-12-06 03:53:12,660 INFO L175 Difference]: Start difference. First operand has 369 places, 1015 transitions, 33414 flow. Second operand 5 states and 79 transitions. [2022-12-06 03:53:12,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 1506 transitions, 52599 flow [2022-12-06 03:53:15,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 1506 transitions, 52290 flow, removed 91 selfloop flow, removed 8 redundant places. [2022-12-06 03:53:15,446 INFO L231 Difference]: Finished difference. Result has 368 places, 1001 transitions, 33064 flow [2022-12-06 03:53:15,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=32513, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=33064, PETRI_PLACES=368, PETRI_TRANSITIONS=1001} [2022-12-06 03:53:15,447 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 350 predicate places. [2022-12-06 03:53:15,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:15,447 INFO L89 Accepts]: Start accepts. Operand has 368 places, 1001 transitions, 33064 flow [2022-12-06 03:53:15,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:15,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:15,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 368 places, 1001 transitions, 33064 flow [2022-12-06 03:53:15,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 1001 transitions, 33064 flow [2022-12-06 03:53:16,002 INFO L130 PetriNetUnfolder]: 699/1909 cut-off events. [2022-12-06 03:53:16,002 INFO L131 PetriNetUnfolder]: For 187350/187462 co-relation queries the response was YES. [2022-12-06 03:53:16,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30026 conditions, 1909 events. 699/1909 cut-off events. For 187350/187462 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 17592 event pairs, 2 based on Foata normal form. 23/1929 useless extension candidates. Maximal degree in co-relation 29881. Up to 1105 conditions per place. [2022-12-06 03:53:16,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 368 places, 1001 transitions, 33064 flow [2022-12-06 03:53:16,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 2924 [2022-12-06 03:53:16,042 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:16,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 596 [2022-12-06 03:53:16,043 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 1001 transitions, 33064 flow [2022-12-06 03:53:16,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:16,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:16,043 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:16,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:16,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 03:53:16,247 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2011022730, now seen corresponding path program 1 times [2022-12-06 03:53:16,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:16,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499330604] [2022-12-06 03:53:16,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:16,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:16,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499330604] [2022-12-06 03:53:16,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499330604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:16,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422612632] [2022-12-06 03:53:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:16,281 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:16,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 03:53:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:16,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:53:16,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:16,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:16,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422612632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:16,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:16,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 03:53:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660061432] [2022-12-06 03:53:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:16,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:53:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:16,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:53:16,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:53:16,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 03:53:16,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1001 transitions, 33064 flow. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:16,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:16,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 03:53:16,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:19,275 INFO L130 PetriNetUnfolder]: 4267/7224 cut-off events. [2022-12-06 03:53:19,275 INFO L131 PetriNetUnfolder]: For 853674/853674 co-relation queries the response was YES. [2022-12-06 03:53:19,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97980 conditions, 7224 events. 4267/7224 cut-off events. For 853674/853674 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 53036 event pairs, 598 based on Foata normal form. 124/7336 useless extension candidates. Maximal degree in co-relation 97832. Up to 3751 conditions per place. [2022-12-06 03:53:19,369 INFO L137 encePairwiseOnDemand]: 41/55 looper letters, 1406 selfloop transitions, 159 changer transitions 34/1599 dead transitions. [2022-12-06 03:53:19,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 1599 transitions, 55845 flow [2022-12-06 03:53:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:53:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:53:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 03:53:19,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24675324675324675 [2022-12-06 03:53:19,370 INFO L175 Difference]: Start difference. First operand has 368 places, 1001 transitions, 33064 flow. Second operand 7 states and 95 transitions. [2022-12-06 03:53:19,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 1599 transitions, 55845 flow [2022-12-06 03:53:22,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1599 transitions, 55690 flow, removed 77 selfloop flow, removed 1 redundant places. [2022-12-06 03:53:23,016 INFO L231 Difference]: Finished difference. Result has 375 places, 1043 transitions, 35071 flow [2022-12-06 03:53:23,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=32703, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=35071, PETRI_PLACES=375, PETRI_TRANSITIONS=1043} [2022-12-06 03:53:23,017 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 357 predicate places. [2022-12-06 03:53:23,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:23,017 INFO L89 Accepts]: Start accepts. Operand has 375 places, 1043 transitions, 35071 flow [2022-12-06 03:53:23,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:23,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:23,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 1043 transitions, 35071 flow [2022-12-06 03:53:23,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 1043 transitions, 35071 flow [2022-12-06 03:53:23,641 INFO L130 PetriNetUnfolder]: 809/2184 cut-off events. [2022-12-06 03:53:23,641 INFO L131 PetriNetUnfolder]: For 267046/267183 co-relation queries the response was YES. [2022-12-06 03:53:23,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36077 conditions, 2184 events. 809/2184 cut-off events. For 267046/267183 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 20578 event pairs, 3 based on Foata normal form. 20/2200 useless extension candidates. Maximal degree in co-relation 35929. Up to 1281 conditions per place. [2022-12-06 03:53:23,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 1043 transitions, 35071 flow [2022-12-06 03:53:23,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 3288 [2022-12-06 03:53:23,694 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:23,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 678 [2022-12-06 03:53:23,695 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 1043 transitions, 35071 flow [2022-12-06 03:53:23,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:23,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:23,695 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:23,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:23,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 03:53:23,899 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:23,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -853637330, now seen corresponding path program 1 times [2022-12-06 03:53:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:23,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103008567] [2022-12-06 03:53:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:23,999 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 03:53:23,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:23,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103008567] [2022-12-06 03:53:24,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103008567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:24,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766759230] [2022-12-06 03:53:24,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:24,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:24,001 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:24,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 03:53:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:24,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:53:24,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:24,184 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 03:53:24,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:24,319 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 03:53:24,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766759230] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:24,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:24,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:53:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811360856] [2022-12-06 03:53:24,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:24,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:53:24,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:24,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:53:24,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:53:24,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 03:53:24,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1043 transitions, 35071 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:24,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:24,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 03:53:24,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:28,679 INFO L130 PetriNetUnfolder]: 4821/8170 cut-off events. [2022-12-06 03:53:28,679 INFO L131 PetriNetUnfolder]: For 1091527/1091527 co-relation queries the response was YES. [2022-12-06 03:53:28,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114147 conditions, 8170 events. 4821/8170 cut-off events. For 1091527/1091527 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 60460 event pairs, 323 based on Foata normal form. 58/8216 useless extension candidates. Maximal degree in co-relation 113996. Up to 4616 conditions per place. [2022-12-06 03:53:28,788 INFO L137 encePairwiseOnDemand]: 8/55 looper letters, 664 selfloop transitions, 735 changer transitions 1/1400 dead transitions. [2022-12-06 03:53:28,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1400 transitions, 45830 flow [2022-12-06 03:53:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 03:53:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 03:53:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 250 transitions. [2022-12-06 03:53:28,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12285012285012285 [2022-12-06 03:53:28,790 INFO L175 Difference]: Start difference. First operand has 375 places, 1043 transitions, 35071 flow. Second operand 37 states and 250 transitions. [2022-12-06 03:53:28,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 1400 transitions, 45830 flow [2022-12-06 03:53:33,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 1400 transitions, 44959 flow, removed 435 selfloop flow, removed 1 redundant places. [2022-12-06 03:53:33,730 INFO L231 Difference]: Finished difference. Result has 423 places, 1180 transitions, 42094 flow [2022-12-06 03:53:33,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=34322, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=615, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=42094, PETRI_PLACES=423, PETRI_TRANSITIONS=1180} [2022-12-06 03:53:33,731 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 405 predicate places. [2022-12-06 03:53:33,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:33,731 INFO L89 Accepts]: Start accepts. Operand has 423 places, 1180 transitions, 42094 flow [2022-12-06 03:53:33,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:33,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:33,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 423 places, 1180 transitions, 42094 flow [2022-12-06 03:53:33,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 423 places, 1180 transitions, 42094 flow [2022-12-06 03:53:34,491 INFO L130 PetriNetUnfolder]: 937/2483 cut-off events. [2022-12-06 03:53:34,491 INFO L131 PetriNetUnfolder]: For 337400/337574 co-relation queries the response was YES. [2022-12-06 03:53:34,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43118 conditions, 2483 events. 937/2483 cut-off events. For 337400/337574 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 23885 event pairs, 4 based on Foata normal form. 23/2502 useless extension candidates. Maximal degree in co-relation 42956. Up to 1488 conditions per place. [2022-12-06 03:53:34,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 423 places, 1180 transitions, 42094 flow [2022-12-06 03:53:34,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 3682 [2022-12-06 03:53:34,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:53:34,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 909 [2022-12-06 03:53:34,640 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 1180 transitions, 42116 flow [2022-12-06 03:53:34,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:34,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:34,640 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:34,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:34,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 03:53:34,845 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:34,845 INFO L85 PathProgramCache]: Analyzing trace with hash -219575815, now seen corresponding path program 1 times [2022-12-06 03:53:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:34,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298656332] [2022-12-06 03:53:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:34,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298656332] [2022-12-06 03:53:34,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298656332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:34,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844111541] [2022-12-06 03:53:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:34,879 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:34,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 03:53:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:34,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:53:34,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:34,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:34,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844111541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:34,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:34,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 03:53:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079290681] [2022-12-06 03:53:34,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:34,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:53:34,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:34,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:53:34,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:53:34,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:53:34,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 1180 transitions, 42116 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:34,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:34,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:53:34,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:38,858 INFO L130 PetriNetUnfolder]: 5077/8540 cut-off events. [2022-12-06 03:53:38,858 INFO L131 PetriNetUnfolder]: For 1139266/1139266 co-relation queries the response was YES. [2022-12-06 03:53:38,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123849 conditions, 8540 events. 5077/8540 cut-off events. For 1139266/1139266 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 64893 event pairs, 730 based on Foata normal form. 46/8574 useless extension candidates. Maximal degree in co-relation 123684. Up to 4264 conditions per place. [2022-12-06 03:53:38,985 INFO L137 encePairwiseOnDemand]: 40/56 looper letters, 1662 selfloop transitions, 170 changer transitions 42/1874 dead transitions. [2022-12-06 03:53:38,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1874 transitions, 71189 flow [2022-12-06 03:53:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:53:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:53:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-06 03:53:38,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2576530612244898 [2022-12-06 03:53:38,986 INFO L175 Difference]: Start difference. First operand has 423 places, 1180 transitions, 42116 flow. Second operand 7 states and 101 transitions. [2022-12-06 03:53:38,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1874 transitions, 71189 flow [2022-12-06 03:53:44,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 1874 transitions, 68633 flow, removed 1174 selfloop flow, removed 11 redundant places. [2022-12-06 03:53:44,399 INFO L231 Difference]: Finished difference. Result has 421 places, 1211 transitions, 42368 flow [2022-12-06 03:53:44,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=40316, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=42368, PETRI_PLACES=421, PETRI_TRANSITIONS=1211} [2022-12-06 03:53:44,400 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 403 predicate places. [2022-12-06 03:53:44,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:44,400 INFO L89 Accepts]: Start accepts. Operand has 421 places, 1211 transitions, 42368 flow [2022-12-06 03:53:44,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:44,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:44,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 421 places, 1211 transitions, 42368 flow [2022-12-06 03:53:44,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 421 places, 1211 transitions, 42368 flow [2022-12-06 03:53:45,271 INFO L130 PetriNetUnfolder]: 994/2612 cut-off events. [2022-12-06 03:53:45,271 INFO L131 PetriNetUnfolder]: For 363299/363514 co-relation queries the response was YES. [2022-12-06 03:53:45,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45277 conditions, 2612 events. 994/2612 cut-off events. For 363299/363514 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 25163 event pairs, 3 based on Foata normal form. 30/2638 useless extension candidates. Maximal degree in co-relation 45111. Up to 1548 conditions per place. [2022-12-06 03:53:45,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 421 places, 1211 transitions, 42368 flow [2022-12-06 03:53:45,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 3896 [2022-12-06 03:53:45,339 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:45,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 940 [2022-12-06 03:53:45,340 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 1211 transitions, 42368 flow [2022-12-06 03:53:45,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:45,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:45,340 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:45,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:45,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:45,544 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:45,545 INFO L85 PathProgramCache]: Analyzing trace with hash -77269202, now seen corresponding path program 1 times [2022-12-06 03:53:45,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:45,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466600176] [2022-12-06 03:53:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:45,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466600176] [2022-12-06 03:53:45,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466600176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:45,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960437162] [2022-12-06 03:53:45,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:45,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:45,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:45,639 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:45,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 03:53:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:45,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:53:45,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:45,814 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 03:53:45,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:45,923 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 03:53:45,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960437162] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:45,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:45,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057725787] [2022-12-06 03:53:45,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:45,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:45,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:45,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:53:45,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 1211 transitions, 42368 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:45,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:45,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:53:45,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:50,281 INFO L130 PetriNetUnfolder]: 5187/8768 cut-off events. [2022-12-06 03:53:50,281 INFO L131 PetriNetUnfolder]: For 1289389/1289389 co-relation queries the response was YES. [2022-12-06 03:53:50,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127259 conditions, 8768 events. 5187/8768 cut-off events. For 1289389/1289389 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 65239 event pairs, 618 based on Foata normal form. 54/8810 useless extension candidates. Maximal degree in co-relation 127090. Up to 6365 conditions per place. [2022-12-06 03:53:50,407 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 842 selfloop transitions, 596 changer transitions 2/1440 dead transitions. [2022-12-06 03:53:50,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 1440 transitions, 49645 flow [2022-12-06 03:53:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 03:53:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 03:53:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 162 transitions. [2022-12-06 03:53:50,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12053571428571429 [2022-12-06 03:53:50,408 INFO L175 Difference]: Start difference. First operand has 421 places, 1211 transitions, 42368 flow. Second operand 24 states and 162 transitions. [2022-12-06 03:53:50,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 1440 transitions, 49645 flow [2022-12-06 03:53:56,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 1440 transitions, 48569 flow, removed 536 selfloop flow, removed 2 redundant places. [2022-12-06 03:53:56,764 INFO L231 Difference]: Finished difference. Result has 449 places, 1259 transitions, 45498 flow [2022-12-06 03:53:56,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=41480, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=554, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=45498, PETRI_PLACES=449, PETRI_TRANSITIONS=1259} [2022-12-06 03:53:56,765 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 431 predicate places. [2022-12-06 03:53:56,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:56,765 INFO L89 Accepts]: Start accepts. Operand has 449 places, 1259 transitions, 45498 flow [2022-12-06 03:53:56,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:56,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:56,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 449 places, 1259 transitions, 45498 flow [2022-12-06 03:53:56,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 449 places, 1259 transitions, 45498 flow [2022-12-06 03:53:57,734 INFO L130 PetriNetUnfolder]: 1058/2741 cut-off events. [2022-12-06 03:53:57,734 INFO L131 PetriNetUnfolder]: For 411336/411685 co-relation queries the response was YES. [2022-12-06 03:53:57,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48601 conditions, 2741 events. 1058/2741 cut-off events. For 411336/411685 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 26376 event pairs, 3 based on Foata normal form. 25/2762 useless extension candidates. Maximal degree in co-relation 48427. Up to 1643 conditions per place. [2022-12-06 03:53:57,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 449 places, 1259 transitions, 45498 flow [2022-12-06 03:53:57,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 3986 [2022-12-06 03:53:57,807 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:57,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1042 [2022-12-06 03:53:57,807 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 1259 transitions, 45498 flow [2022-12-06 03:53:57,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:57,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:57,807 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:57,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:58,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:58,013 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1891348308, now seen corresponding path program 1 times [2022-12-06 03:53:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:58,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783448778] [2022-12-06 03:53:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:58,135 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 03:53:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:58,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783448778] [2022-12-06 03:53:58,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783448778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:58,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036334933] [2022-12-06 03:53:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:58,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:58,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:58,137 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:58,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 03:53:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:58,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:53:58,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:58,350 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 03:53:58,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:58,484 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 03:53:58,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036334933] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:58,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:58,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:53:58,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448381834] [2022-12-06 03:53:58,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:58,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:53:58,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:58,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:53:58,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:53:58,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:53:58,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 1259 transitions, 45498 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:58,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:58,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:53:58,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:03,898 INFO L130 PetriNetUnfolder]: 5731/9682 cut-off events. [2022-12-06 03:54:03,898 INFO L131 PetriNetUnfolder]: For 1595826/1595826 co-relation queries the response was YES. [2022-12-06 03:54:03,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143016 conditions, 9682 events. 5731/9682 cut-off events. For 1595826/1595826 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 73154 event pairs, 272 based on Foata normal form. 82/9752 useless extension candidates. Maximal degree in co-relation 142839. Up to 4793 conditions per place. [2022-12-06 03:54:04,042 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 682 selfloop transitions, 950 changer transitions 0/1632 dead transitions. [2022-12-06 03:54:04,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 1632 transitions, 57466 flow [2022-12-06 03:54:04,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 03:54:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 03:54:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 221 transitions. [2022-12-06 03:54:04,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11607142857142858 [2022-12-06 03:54:04,044 INFO L175 Difference]: Start difference. First operand has 449 places, 1259 transitions, 45498 flow. Second operand 34 states and 221 transitions. [2022-12-06 03:54:04,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 1632 transitions, 57466 flow [2022-12-06 03:54:12,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 1632 transitions, 56702 flow, removed 285 selfloop flow, removed 11 redundant places. [2022-12-06 03:54:12,053 INFO L231 Difference]: Finished difference. Result has 484 places, 1383 transitions, 53378 flow [2022-12-06 03:54:12,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=44535, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=839, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=53378, PETRI_PLACES=484, PETRI_TRANSITIONS=1383} [2022-12-06 03:54:12,054 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 466 predicate places. [2022-12-06 03:54:12,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:12,054 INFO L89 Accepts]: Start accepts. Operand has 484 places, 1383 transitions, 53378 flow [2022-12-06 03:54:12,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:12,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:12,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 484 places, 1383 transitions, 53378 flow [2022-12-06 03:54:12,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 484 places, 1383 transitions, 53378 flow [2022-12-06 03:54:13,137 INFO L130 PetriNetUnfolder]: 1170/3031 cut-off events. [2022-12-06 03:54:13,137 INFO L131 PetriNetUnfolder]: For 506950/507290 co-relation queries the response was YES. [2022-12-06 03:54:13,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57167 conditions, 3031 events. 1170/3031 cut-off events. For 506950/507290 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 29610 event pairs, 4 based on Foata normal form. 23/3050 useless extension candidates. Maximal degree in co-relation 56981. Up to 1824 conditions per place. [2022-12-06 03:54:13,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 484 places, 1383 transitions, 53378 flow [2022-12-06 03:54:13,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 4366 [2022-12-06 03:54:13,221 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:13,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1167 [2022-12-06 03:54:13,221 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 1383 transitions, 53378 flow [2022-12-06 03:54:13,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:13,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:13,221 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:13,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-06 03:54:13,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:13,425 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:13,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:13,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1862681957, now seen corresponding path program 2 times [2022-12-06 03:54:13,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:13,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383353710] [2022-12-06 03:54:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:13,529 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 03:54:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:13,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383353710] [2022-12-06 03:54:13,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383353710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:13,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810056116] [2022-12-06 03:54:13,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:54:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:13,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:13,531 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:13,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 03:54:13,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:54:13,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:54:13,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:54:13,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:13,723 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 03:54:13,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:13,855 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 03:54:13,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810056116] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:13,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:13,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:54:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658313245] [2022-12-06 03:54:13,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:13,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:54:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:54:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:54:13,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:54:13,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 1383 transitions, 53378 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:13,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:13,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:54:13,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:20,339 INFO L130 PetriNetUnfolder]: 6676/11177 cut-off events. [2022-12-06 03:54:20,339 INFO L131 PetriNetUnfolder]: For 2113693/2113693 co-relation queries the response was YES. [2022-12-06 03:54:20,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177233 conditions, 11177 events. 6676/11177 cut-off events. For 2113693/2113693 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 84895 event pairs, 217 based on Foata normal form. 56/11221 useless extension candidates. Maximal degree in co-relation 177044. Up to 4564 conditions per place. [2022-12-06 03:54:20,527 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 504 selfloop transitions, 1251 changer transitions 0/1755 dead transitions. [2022-12-06 03:54:20,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 1755 transitions, 66083 flow [2022-12-06 03:54:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 03:54:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 03:54:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 179 transitions. [2022-12-06 03:54:20,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1389751552795031 [2022-12-06 03:54:20,529 INFO L175 Difference]: Start difference. First operand has 484 places, 1383 transitions, 53378 flow. Second operand 23 states and 179 transitions. [2022-12-06 03:54:20,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 1755 transitions, 66083 flow [2022-12-06 03:54:31,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 1755 transitions, 63455 flow, removed 1143 selfloop flow, removed 16 redundant places. [2022-12-06 03:54:31,122 INFO L231 Difference]: Finished difference. Result has 497 places, 1525 transitions, 61224 flow [2022-12-06 03:54:31,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=50886, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=61224, PETRI_PLACES=497, PETRI_TRANSITIONS=1525} [2022-12-06 03:54:31,123 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 479 predicate places. [2022-12-06 03:54:31,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:31,123 INFO L89 Accepts]: Start accepts. Operand has 497 places, 1525 transitions, 61224 flow [2022-12-06 03:54:31,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:31,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:31,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 497 places, 1525 transitions, 61224 flow [2022-12-06 03:54:31,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 497 places, 1525 transitions, 61224 flow [2022-12-06 03:54:32,503 INFO L130 PetriNetUnfolder]: 1328/3435 cut-off events. [2022-12-06 03:54:32,503 INFO L131 PetriNetUnfolder]: For 648897/649973 co-relation queries the response was YES. [2022-12-06 03:54:32,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68181 conditions, 3435 events. 1328/3435 cut-off events. For 648897/649973 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 34098 event pairs, 7 based on Foata normal form. 26/3456 useless extension candidates. Maximal degree in co-relation 67992. Up to 1992 conditions per place. [2022-12-06 03:54:32,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 497 places, 1525 transitions, 61224 flow [2022-12-06 03:54:32,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 4926 [2022-12-06 03:54:32,606 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:32,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1483 [2022-12-06 03:54:32,606 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 1525 transitions, 61224 flow [2022-12-06 03:54:32,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:32,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:32,606 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:32,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-06 03:54:32,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 03:54:32,810 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:32,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:32,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1642495436, now seen corresponding path program 1 times [2022-12-06 03:54:32,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:32,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185869315] [2022-12-06 03:54:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:32,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:32,904 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 03:54:32,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:32,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185869315] [2022-12-06 03:54:32,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185869315] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:32,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560487512] [2022-12-06 03:54:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:32,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:32,906 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:32,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 03:54:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:32,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:54:32,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:33,116 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 03:54:33,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:33,227 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 03:54:33,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560487512] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:33,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:33,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:54:33,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589698652] [2022-12-06 03:54:33,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:33,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:54:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:54:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:54:33,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:54:33,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 1525 transitions, 61224 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:33,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:33,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:54:33,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:40,641 INFO L130 PetriNetUnfolder]: 6877/11633 cut-off events. [2022-12-06 03:54:40,641 INFO L131 PetriNetUnfolder]: For 2524045/2524045 co-relation queries the response was YES. [2022-12-06 03:54:40,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184755 conditions, 11633 events. 6877/11633 cut-off events. For 2524045/2524045 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 90508 event pairs, 817 based on Foata normal form. 173/11794 useless extension candidates. Maximal degree in co-relation 184563. Up to 8358 conditions per place. [2022-12-06 03:54:40,882 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 1099 selfloop transitions, 789 changer transitions 1/1889 dead transitions. [2022-12-06 03:54:40,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 1889 transitions, 73534 flow [2022-12-06 03:54:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 03:54:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 03:54:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 189 transitions. [2022-12-06 03:54:40,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11637931034482758 [2022-12-06 03:54:40,883 INFO L175 Difference]: Start difference. First operand has 497 places, 1525 transitions, 61224 flow. Second operand 29 states and 189 transitions. [2022-12-06 03:54:40,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 1889 transitions, 73534 flow [2022-12-06 03:54:53,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 1889 transitions, 72051 flow, removed 527 selfloop flow, removed 15 redundant places. [2022-12-06 03:54:53,258 INFO L231 Difference]: Finished difference. Result has 518 places, 1652 transitions, 68051 flow [2022-12-06 03:54:53,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=59835, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=683, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=776, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=68051, PETRI_PLACES=518, PETRI_TRANSITIONS=1652} [2022-12-06 03:54:53,261 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 500 predicate places. [2022-12-06 03:54:53,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:53,261 INFO L89 Accepts]: Start accepts. Operand has 518 places, 1652 transitions, 68051 flow [2022-12-06 03:54:53,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:53,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:53,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 518 places, 1652 transitions, 68051 flow [2022-12-06 03:54:53,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 518 places, 1652 transitions, 68051 flow [2022-12-06 03:54:54,826 INFO L130 PetriNetUnfolder]: 1421/3685 cut-off events. [2022-12-06 03:54:54,826 INFO L131 PetriNetUnfolder]: For 651818/652553 co-relation queries the response was YES. [2022-12-06 03:54:54,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72828 conditions, 3685 events. 1421/3685 cut-off events. For 651818/652553 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 37143 event pairs, 9 based on Foata normal form. 28/3707 useless extension candidates. Maximal degree in co-relation 72637. Up to 2141 conditions per place. [2022-12-06 03:54:54,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 518 places, 1652 transitions, 68051 flow [2022-12-06 03:54:54,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 5230 [2022-12-06 03:54:54,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:54:54,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:54:55,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:54:55,169 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:54:55,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1908 [2022-12-06 03:54:55,169 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 1652 transitions, 68589 flow [2022-12-06 03:54:55,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:55,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:55,169 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:55,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-06 03:54:55,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-06 03:54:55,376 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:55,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1045486354, now seen corresponding path program 1 times [2022-12-06 03:54:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:55,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133648859] [2022-12-06 03:54:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:55,473 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 03:54:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:55,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133648859] [2022-12-06 03:54:55,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133648859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:55,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158974212] [2022-12-06 03:54:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:55,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:55,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:55,475 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:55,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 03:54:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:55,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:54:55,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:55,665 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 03:54:55,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:55,788 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 03:54:55,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158974212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:55,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:55,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:54:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534283045] [2022-12-06 03:54:55,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:55,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:54:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:55,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:54:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:54:55,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 03:54:55,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 1652 transitions, 68589 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:55,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:55,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 03:54:55,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:04,265 INFO L130 PetriNetUnfolder]: 7026/11948 cut-off events. [2022-12-06 03:55:04,265 INFO L131 PetriNetUnfolder]: For 2166044/2166044 co-relation queries the response was YES. [2022-12-06 03:55:04,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189710 conditions, 11948 events. 7026/11948 cut-off events. For 2166044/2166044 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 94121 event pairs, 1076 based on Foata normal form. 88/12024 useless extension candidates. Maximal degree in co-relation 189516. Up to 9637 conditions per place. [2022-12-06 03:55:04,476 INFO L137 encePairwiseOnDemand]: 11/60 looper letters, 1344 selfloop transitions, 585 changer transitions 8/1937 dead transitions. [2022-12-06 03:55:04,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 1937 transitions, 78857 flow [2022-12-06 03:55:04,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 03:55:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 03:55:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 216 transitions. [2022-12-06 03:55:04,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0972972972972973 [2022-12-06 03:55:04,477 INFO L175 Difference]: Start difference. First operand has 518 places, 1652 transitions, 68589 flow. Second operand 37 states and 216 transitions. [2022-12-06 03:55:04,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 1937 transitions, 78857 flow [2022-12-06 03:55:19,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 1937 transitions, 76923 flow, removed 911 selfloop flow, removed 7 redundant places. [2022-12-06 03:55:20,019 INFO L231 Difference]: Finished difference. Result has 552 places, 1739 transitions, 72662 flow [2022-12-06 03:55:20,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=66733, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=514, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1093, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=72662, PETRI_PLACES=552, PETRI_TRANSITIONS=1739} [2022-12-06 03:55:20,021 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 534 predicate places. [2022-12-06 03:55:20,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:20,021 INFO L89 Accepts]: Start accepts. Operand has 552 places, 1739 transitions, 72662 flow [2022-12-06 03:55:20,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:20,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:20,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 552 places, 1739 transitions, 72662 flow [2022-12-06 03:55:20,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 552 places, 1739 transitions, 72662 flow [2022-12-06 03:55:21,864 INFO L130 PetriNetUnfolder]: 1496/3852 cut-off events. [2022-12-06 03:55:21,864 INFO L131 PetriNetUnfolder]: For 690380/691109 co-relation queries the response was YES. [2022-12-06 03:55:21,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76529 conditions, 3852 events. 1496/3852 cut-off events. For 690380/691109 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 38844 event pairs, 7 based on Foata normal form. 24/3873 useless extension candidates. Maximal degree in co-relation 76332. Up to 2227 conditions per place. [2022-12-06 03:55:21,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 552 places, 1739 transitions, 72662 flow [2022-12-06 03:55:21,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 5410 [2022-12-06 03:55:22,113 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:55:22,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2093 [2022-12-06 03:55:22,114 INFO L495 AbstractCegarLoop]: Abstraction has has 551 places, 1738 transitions, 72679 flow [2022-12-06 03:55:22,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:22,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:22,114 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:22,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:22,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 03:55:22,319 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1634857005, now seen corresponding path program 1 times [2022-12-06 03:55:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:22,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758047385] [2022-12-06 03:55:22,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:22,401 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 03:55:22,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:22,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758047385] [2022-12-06 03:55:22,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758047385] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:22,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222214238] [2022-12-06 03:55:22,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:22,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:22,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:22,403 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:22,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 03:55:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:22,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:55:22,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:22,551 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 03:55:22,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:22,691 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 03:55:22,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222214238] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:22,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:22,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:55:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136376436] [2022-12-06 03:55:22,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:22,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:55:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:55:22,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:55:22,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 03:55:22,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 1738 transitions, 72679 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:22,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:22,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 03:55:22,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:31,512 INFO L130 PetriNetUnfolder]: 7151/12198 cut-off events. [2022-12-06 03:55:31,512 INFO L131 PetriNetUnfolder]: For 2186089/2186089 co-relation queries the response was YES. [2022-12-06 03:55:31,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194452 conditions, 12198 events. 7151/12198 cut-off events. For 2186089/2186089 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 97033 event pairs, 920 based on Foata normal form. 82/12268 useless extension candidates. Maximal degree in co-relation 194252. Up to 9026 conditions per place. [2022-12-06 03:55:31,822 INFO L137 encePairwiseOnDemand]: 8/63 looper letters, 1280 selfloop transitions, 742 changer transitions 1/2023 dead transitions. [2022-12-06 03:55:31,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 2023 transitions, 81942 flow [2022-12-06 03:55:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 03:55:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 03:55:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 192 transitions. [2022-12-06 03:55:31,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10509031198686371 [2022-12-06 03:55:31,823 INFO L175 Difference]: Start difference. First operand has 551 places, 1738 transitions, 72679 flow. Second operand 29 states and 192 transitions. [2022-12-06 03:55:31,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 2023 transitions, 81942 flow [2022-12-06 03:55:48,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 2023 transitions, 81226 flow, removed 249 selfloop flow, removed 19 redundant places. [2022-12-06 03:55:48,645 INFO L231 Difference]: Finished difference. Result has 564 places, 1785 transitions, 76425 flow [2022-12-06 03:55:48,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=71763, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=699, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1003, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=76425, PETRI_PLACES=564, PETRI_TRANSITIONS=1785} [2022-12-06 03:55:48,647 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 546 predicate places. [2022-12-06 03:55:48,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:48,647 INFO L89 Accepts]: Start accepts. Operand has 564 places, 1785 transitions, 76425 flow [2022-12-06 03:55:48,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:48,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:48,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 564 places, 1785 transitions, 76425 flow [2022-12-06 03:55:48,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 564 places, 1785 transitions, 76425 flow [2022-12-06 03:55:50,609 INFO L130 PetriNetUnfolder]: 1531/3980 cut-off events. [2022-12-06 03:55:50,609 INFO L131 PetriNetUnfolder]: For 739869/740583 co-relation queries the response was YES. [2022-12-06 03:55:50,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80475 conditions, 3980 events. 1531/3980 cut-off events. For 739869/740583 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 40637 event pairs, 8 based on Foata normal form. 28/4005 useless extension candidates. Maximal degree in co-relation 80272. Up to 2308 conditions per place. [2022-12-06 03:55:50,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 564 places, 1785 transitions, 76425 flow [2022-12-06 03:55:50,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 5536 [2022-12-06 03:55:50,741 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:55:50,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2095 [2022-12-06 03:55:50,742 INFO L495 AbstractCegarLoop]: Abstraction has has 564 places, 1785 transitions, 76425 flow [2022-12-06 03:55:50,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:50,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:50,743 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:50,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:50,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-06 03:55:50,947 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash 332019695, now seen corresponding path program 1 times [2022-12-06 03:55:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:50,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516031792] [2022-12-06 03:55:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:50,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:51,196 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 03:55:51,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:51,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516031792] [2022-12-06 03:55:51,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516031792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:51,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781799941] [2022-12-06 03:55:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:51,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:51,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:51,198 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:51,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 03:55:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:51,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:55:51,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:51,418 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 03:55:51,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:51,582 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 03:55:51,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781799941] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:51,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:51,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:55:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749125778] [2022-12-06 03:55:51,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:51,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:55:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:55:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:55:51,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 03:55:51,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 1785 transitions, 76425 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:51,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:51,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 03:55:51,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:01,353 INFO L130 PetriNetUnfolder]: 7609/13093 cut-off events. [2022-12-06 03:56:01,353 INFO L131 PetriNetUnfolder]: For 2687434/2687434 co-relation queries the response was YES. [2022-12-06 03:56:01,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212183 conditions, 13093 events. 7609/13093 cut-off events. For 2687434/2687434 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 106580 event pairs, 1278 based on Foata normal form. 135/13216 useless extension candidates. Maximal degree in co-relation 211977. Up to 9857 conditions per place. [2022-12-06 03:56:01,619 INFO L137 encePairwiseOnDemand]: 8/60 looper letters, 1409 selfloop transitions, 758 changer transitions 3/2170 dead transitions. [2022-12-06 03:56:01,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 2170 transitions, 92110 flow [2022-12-06 03:56:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 03:56:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 03:56:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 176 transitions. [2022-12-06 03:56:01,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10864197530864197 [2022-12-06 03:56:01,620 INFO L175 Difference]: Start difference. First operand has 564 places, 1785 transitions, 76425 flow. Second operand 27 states and 176 transitions. [2022-12-06 03:56:01,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 2170 transitions, 92110 flow [2022-12-06 03:56:20,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 2170 transitions, 90605 flow, removed 648 selfloop flow, removed 12 redundant places. [2022-12-06 03:56:20,208 INFO L231 Difference]: Finished difference. Result has 585 places, 1968 transitions, 86493 flow [2022-12-06 03:56:20,209 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=75094, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1785, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=611, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=86493, PETRI_PLACES=585, PETRI_TRANSITIONS=1968} [2022-12-06 03:56:20,210 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 567 predicate places. [2022-12-06 03:56:20,210 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:56:20,210 INFO L89 Accepts]: Start accepts. Operand has 585 places, 1968 transitions, 86493 flow [2022-12-06 03:56:20,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:56:20,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:56:20,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 585 places, 1968 transitions, 86493 flow [2022-12-06 03:56:20,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 585 places, 1968 transitions, 86493 flow [2022-12-06 03:56:22,197 INFO L130 PetriNetUnfolder]: 1661/4336 cut-off events. [2022-12-06 03:56:22,198 INFO L131 PetriNetUnfolder]: For 832907/833869 co-relation queries the response was YES. [2022-12-06 03:56:22,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88837 conditions, 4336 events. 1661/4336 cut-off events. For 832907/833869 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 45031 event pairs, 7 based on Foata normal form. 32/4365 useless extension candidates. Maximal degree in co-relation 88627. Up to 2519 conditions per place. [2022-12-06 03:56:22,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 585 places, 1968 transitions, 86493 flow [2022-12-06 03:56:22,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 5966 [2022-12-06 03:56:22,342 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:56:22,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2132 [2022-12-06 03:56:22,342 INFO L495 AbstractCegarLoop]: Abstraction has has 585 places, 1968 transitions, 86493 flow [2022-12-06 03:56:22,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:56:22,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:56:22,342 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:56:22,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 03:56:22,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:22,547 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:56:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:56:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash 326099992, now seen corresponding path program 1 times [2022-12-06 03:56:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:56:22,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894746489] [2022-12-06 03:56:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:56:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:56:22,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894746489] [2022-12-06 03:56:22,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894746489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:56:22,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352876042] [2022-12-06 03:56:22,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:22,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:22,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:56:22,659 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:56:22,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 03:56:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:22,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:56:22,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:56:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:22,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:56:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:23,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352876042] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:56:23,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:56:23,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 03:56:23,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960628069] [2022-12-06 03:56:23,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:56:23,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:56:23,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:56:23,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:56:23,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-12-06 03:56:23,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 03:56:23,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 1968 transitions, 86493 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 03:56:23,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:56:23,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 03:56:23,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:36,496 INFO L130 PetriNetUnfolder]: 8763/15073 cut-off events. [2022-12-06 03:56:36,496 INFO L131 PetriNetUnfolder]: For 3648643/3648643 co-relation queries the response was YES. [2022-12-06 03:56:36,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250180 conditions, 15073 events. 8763/15073 cut-off events. For 3648643/3648643 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 125495 event pairs, 553 based on Foata normal form. 182/15243 useless extension candidates. Maximal degree in co-relation 249967. Up to 8403 conditions per place. [2022-12-06 03:56:36,833 INFO L137 encePairwiseOnDemand]: 8/60 looper letters, 1193 selfloop transitions, 1412 changer transitions 7/2612 dead transitions. [2022-12-06 03:56:36,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 2612 transitions, 109633 flow [2022-12-06 03:56:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-06 03:56:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-06 03:56:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 315 transitions. [2022-12-06 03:56:36,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10294117647058823 [2022-12-06 03:56:36,835 INFO L175 Difference]: Start difference. First operand has 585 places, 1968 transitions, 86493 flow. Second operand 51 states and 315 transitions. [2022-12-06 03:56:36,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 2612 transitions, 109633 flow [2022-12-06 03:57:01,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 2612 transitions, 106236 flow, removed 1638 selfloop flow, removed 9 redundant places. [2022-12-06 03:57:01,594 INFO L231 Difference]: Finished difference. Result has 641 places, 2240 transitions, 100841 flow [2022-12-06 03:57:01,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=83490, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=100841, PETRI_PLACES=641, PETRI_TRANSITIONS=2240} [2022-12-06 03:57:01,596 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 623 predicate places. [2022-12-06 03:57:01,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:57:01,596 INFO L89 Accepts]: Start accepts. Operand has 641 places, 2240 transitions, 100841 flow [2022-12-06 03:57:01,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:57:01,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:57:01,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 641 places, 2240 transitions, 100841 flow [2022-12-06 03:57:01,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 641 places, 2240 transitions, 100841 flow [2022-12-06 03:57:04,056 INFO L130 PetriNetUnfolder]: 1947/4998 cut-off events. [2022-12-06 03:57:04,056 INFO L131 PetriNetUnfolder]: For 1079120/1079958 co-relation queries the response was YES. [2022-12-06 03:57:04,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105590 conditions, 4998 events. 1947/4998 cut-off events. For 1079120/1079958 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 52872 event pairs, 7 based on Foata normal form. 31/5026 useless extension candidates. Maximal degree in co-relation 105364. Up to 2902 conditions per place. [2022-12-06 03:57:04,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 641 places, 2240 transitions, 100841 flow [2022-12-06 03:57:04,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 6772 [2022-12-06 03:57:04,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [416] L687-5-->L687-5: Formula: (and (= (+ v_~p~0_333 2) v_~p~0_331) (< v_~p~0_331 7) (= v_~i~0_477 (+ (* v_~j~0_491 2) v_~i~0_479))) InVars {~j~0=v_~j~0_491, ~i~0=v_~i~0_479, ~p~0=v_~p~0_333} OutVars{~j~0=v_~j~0_491, ~i~0=v_~i~0_477, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_239|, ~p~0=v_~p~0_331} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:57:04,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:57:04,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:57:04,599 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [421] L705-6-->L687-5: Formula: (and (= (+ (* v_~j~0_501 2) v_~i~0_508) v_~i~0_507) (= v_~next~0_183 v_~cur~0_298) (< v_~x~0_354 1) (= (+ (* 377 v_~cur~0_299) (* 233 v_~prev~0_368)) v_~prev~0_367) (= v_~x~0_353 (+ 14 v_~x~0_354)) (= v_~next~0_183 (+ (* 233 v_~cur~0_299) v_~prev~0_367 (* 144 v_~prev~0_368))) (< v_~p~0_361 7) (= v_~p~0_361 (+ v_~p~0_362 2))) InVars {~j~0=v_~j~0_501, ~prev~0=v_~prev~0_368, ~i~0=v_~i~0_508, ~p~0=v_~p~0_362, ~cur~0=v_~cur~0_299, ~x~0=v_~x~0_354} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_219|, ~j~0=v_~j~0_501, ~next~0=v_~next~0_183, ~prev~0=v_~prev~0_367, ~i~0=v_~i~0_507, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_259|, ~p~0=v_~p~0_361, ~cur~0=v_~cur~0_298, ~x~0=v_~x~0_353} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:57:04,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [422] L705-6-->L687-5: Formula: (and (= v_~next~0_185 (+ (* 144 v_~prev~0_372) v_~prev~0_371 (* 233 v_~cur~0_303))) (= (+ (* 233 v_~prev~0_372) (* 377 v_~cur~0_303)) v_~prev~0_371) (= (+ v_~j~0_503 v_~i~0_512) v_~i~0_511) (< v_~x~0_358 1) (< v_~p~0_366 6) (= v_~next~0_185 v_~cur~0_302) (= (+ 14 v_~x~0_358) v_~x~0_357) (= v_~p~0_365 (+ v_~p~0_366 1))) InVars {~j~0=v_~j~0_503, ~prev~0=v_~prev~0_372, ~i~0=v_~i~0_512, ~p~0=v_~p~0_366, ~cur~0=v_~cur~0_303, ~x~0=v_~x~0_358} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_221|, ~j~0=v_~j~0_503, ~next~0=v_~next~0_185, ~prev~0=v_~prev~0_371, ~i~0=v_~i~0_511, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_261|, ~p~0=v_~p~0_365, ~cur~0=v_~cur~0_302, ~x~0=v_~x~0_357} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:57:04,702 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 03:57:04,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3106 [2022-12-06 03:57:04,702 INFO L495 AbstractCegarLoop]: Abstraction has has 640 places, 2239 transitions, 100939 flow [2022-12-06 03:57:04,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 03:57:04,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:57:04,703 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:57:04,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-06 03:57:04,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 03:57:04,907 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:57:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:57:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash 308842912, now seen corresponding path program 2 times [2022-12-06 03:57:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:57:04,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498176343] [2022-12-06 03:57:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:57:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:57:05,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498176343] [2022-12-06 03:57:05,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498176343] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:57:05,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67364179] [2022-12-06 03:57:05,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:57:05,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:05,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:57:05,020 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:57:05,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-06 03:57:05,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:57:05,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:57:05,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:57:05,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:57:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:05,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:57:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:05,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67364179] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:57:05,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:57:05,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 03:57:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902852444] [2022-12-06 03:57:05,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:57:05,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:57:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:57:05,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:57:05,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2022-12-06 03:57:05,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 03:57:05,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 2239 transitions, 100939 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 03:57:05,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:57:05,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 03:57:05,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:57:21,606 INFO L130 PetriNetUnfolder]: 10089/17309 cut-off events. [2022-12-06 03:57:21,607 INFO L131 PetriNetUnfolder]: For 4485443/4485443 co-relation queries the response was YES. [2022-12-06 03:57:21,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300959 conditions, 17309 events. 10089/17309 cut-off events. For 4485443/4485443 co-relation queries the response was YES. Maximal size of possible extension queue 1829. Compared 145966 event pairs, 472 based on Foata normal form. 134/17431 useless extension candidates. Maximal degree in co-relation 300730. Up to 7005 conditions per place. [2022-12-06 03:57:21,941 INFO L137 encePairwiseOnDemand]: 8/68 looper letters, 1029 selfloop transitions, 1863 changer transitions 9/2901 dead transitions. [2022-12-06 03:57:21,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 2901 transitions, 125781 flow [2022-12-06 03:57:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 03:57:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 03:57:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 309 transitions. [2022-12-06 03:57:21,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09878516624040921 [2022-12-06 03:57:21,943 INFO L175 Difference]: Start difference. First operand has 640 places, 2239 transitions, 100939 flow. Second operand 46 states and 309 transitions. [2022-12-06 03:57:21,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 2901 transitions, 125781 flow [2022-12-06 03:58:01,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 2901 transitions, 120637 flow, removed 2381 selfloop flow, removed 17 redundant places. [2022-12-06 03:58:01,316 INFO L231 Difference]: Finished difference. Result has 682 places, 2506 transitions, 115775 flow [2022-12-06 03:58:01,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=96245, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=115775, PETRI_PLACES=682, PETRI_TRANSITIONS=2506} [2022-12-06 03:58:01,318 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 664 predicate places. [2022-12-06 03:58:01,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:58:01,319 INFO L89 Accepts]: Start accepts. Operand has 682 places, 2506 transitions, 115775 flow [2022-12-06 03:58:01,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:58:01,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:58:01,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 682 places, 2506 transitions, 115775 flow [2022-12-06 03:58:01,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 681 places, 2506 transitions, 115775 flow [2022-12-06 03:58:05,101 INFO L130 PetriNetUnfolder]: 2223/5686 cut-off events. [2022-12-06 03:58:05,102 INFO L131 PetriNetUnfolder]: For 1472641/1473278 co-relation queries the response was YES. [2022-12-06 03:58:05,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125761 conditions, 5686 events. 2223/5686 cut-off events. For 1472641/1473278 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 61125 event pairs, 12 based on Foata normal form. 37/5715 useless extension candidates. Maximal degree in co-relation 125523. Up to 3308 conditions per place. [2022-12-06 03:58:05,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 681 places, 2506 transitions, 115775 flow [2022-12-06 03:58:05,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 7592 [2022-12-06 03:58:05,374 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:58:05,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4056 [2022-12-06 03:58:05,375 INFO L495 AbstractCegarLoop]: Abstraction has has 681 places, 2506 transitions, 115816 flow [2022-12-06 03:58:05,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 03:58:05,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:58:05,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:58:05,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-06 03:58:05,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 03:58:05,576 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:58:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:58:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash -82354814, now seen corresponding path program 1 times [2022-12-06 03:58:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:58:05,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217792290] [2022-12-06 03:58:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:58:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:05,668 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 03:58:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:58:05,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217792290] [2022-12-06 03:58:05,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217792290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:58:05,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484649317] [2022-12-06 03:58:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:05,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:58:05,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:58:05,669 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:58:05,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-06 03:58:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:05,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 03:58:05,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:58:05,840 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 03:58:05,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:58:05,942 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 03:58:05,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484649317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:58:05,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:58:05,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:58:05,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494838801] [2022-12-06 03:58:05,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:58:05,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:58:05,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:58:05,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:58:05,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:58:05,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 03:58:05,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 2506 transitions, 115816 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:58:05,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:58:05,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 03:58:05,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:58:24,248 INFO L130 PetriNetUnfolder]: 10164/17541 cut-off events. [2022-12-06 03:58:24,249 INFO L131 PetriNetUnfolder]: For 4529058/4529058 co-relation queries the response was YES. [2022-12-06 03:58:24,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307984 conditions, 17541 events. 10164/17541 cut-off events. For 4529058/4529058 co-relation queries the response was YES. Maximal size of possible extension queue 1859. Compared 149655 event pairs, 1573 based on Foata normal form. 94/17623 useless extension candidates. Maximal degree in co-relation 307743. Up to 13743 conditions per place. [2022-12-06 03:58:24,597 INFO L137 encePairwiseOnDemand]: 8/70 looper letters, 1880 selfloop transitions, 935 changer transitions 3/2818 dead transitions. [2022-12-06 03:58:24,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 2818 transitions, 128595 flow [2022-12-06 03:58:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:58:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:58:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 198 transitions. [2022-12-06 03:58:24,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11314285714285714 [2022-12-06 03:58:24,599 INFO L175 Difference]: Start difference. First operand has 681 places, 2506 transitions, 115816 flow. Second operand 25 states and 198 transitions. [2022-12-06 03:58:24,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 2818 transitions, 128595 flow [2022-12-06 03:59:05,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 2818 transitions, 123274 flow, removed 2498 selfloop flow, removed 18 redundant places. [2022-12-06 03:59:05,581 INFO L231 Difference]: Finished difference. Result has 696 places, 2588 transitions, 117692 flow [2022-12-06 03:59:05,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=110789, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=861, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=117692, PETRI_PLACES=696, PETRI_TRANSITIONS=2588} [2022-12-06 03:59:05,583 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 678 predicate places. [2022-12-06 03:59:05,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:59:05,583 INFO L89 Accepts]: Start accepts. Operand has 696 places, 2588 transitions, 117692 flow [2022-12-06 03:59:05,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:59:05,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:59:05,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 696 places, 2588 transitions, 117692 flow [2022-12-06 03:59:05,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 696 places, 2588 transitions, 117692 flow [2022-12-06 03:59:09,086 INFO L130 PetriNetUnfolder]: 2230/5736 cut-off events. [2022-12-06 03:59:09,086 INFO L131 PetriNetUnfolder]: For 1453917/1454958 co-relation queries the response was YES. [2022-12-06 03:59:09,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123266 conditions, 5736 events. 2230/5736 cut-off events. For 1453917/1454958 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 61978 event pairs, 9 based on Foata normal form. 34/5767 useless extension candidates. Maximal degree in co-relation 123023. Up to 3191 conditions per place. [2022-12-06 03:59:09,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 696 places, 2588 transitions, 117692 flow [2022-12-06 03:59:09,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 7750 [2022-12-06 03:59:09,335 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:59:09,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3752 [2022-12-06 03:59:09,336 INFO L495 AbstractCegarLoop]: Abstraction has has 696 places, 2588 transitions, 117704 flow [2022-12-06 03:59:09,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:09,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:59:09,336 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:59:09,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-06 03:59:09,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-12-06 03:59:09,539 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:59:09,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:59:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1041745739, now seen corresponding path program 1 times [2022-12-06 03:59:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:59:09,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338013383] [2022-12-06 03:59:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:59:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:09,722 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 03:59:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:59:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338013383] [2022-12-06 03:59:09,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338013383] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:59:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828334903] [2022-12-06 03:59:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:09,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:59:09,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:59:09,724 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:59:09,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-06 03:59:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:09,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:59:09,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:59:09,909 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 03:59:09,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:59:10,030 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 03:59:10,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828334903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:59:10,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:59:10,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:59:10,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449712963] [2022-12-06 03:59:10,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:59:10,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:59:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:59:10,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:59:10,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:59:10,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 03:59:10,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 2588 transitions, 117704 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:10,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:59:10,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 03:59:10,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:59:29,123 INFO L130 PetriNetUnfolder]: 10338/17887 cut-off events. [2022-12-06 03:59:29,123 INFO L131 PetriNetUnfolder]: For 4175866/4175866 co-relation queries the response was YES. [2022-12-06 03:59:29,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309463 conditions, 17887 events. 10338/17887 cut-off events. For 4175866/4175866 co-relation queries the response was YES. Maximal size of possible extension queue 1902. Compared 153596 event pairs, 1925 based on Foata normal form. 28/17903 useless extension candidates. Maximal degree in co-relation 309217. Up to 14612 conditions per place. [2022-12-06 03:59:29,575 INFO L137 encePairwiseOnDemand]: 9/71 looper letters, 2022 selfloop transitions, 864 changer transitions 12/2898 dead transitions. [2022-12-06 03:59:29,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 2898 transitions, 130559 flow [2022-12-06 03:59:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 03:59:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 03:59:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 242 transitions. [2022-12-06 03:59:29,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0831329440054964 [2022-12-06 03:59:29,586 INFO L175 Difference]: Start difference. First operand has 696 places, 2588 transitions, 117704 flow. Second operand 41 states and 242 transitions. [2022-12-06 03:59:29,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 2898 transitions, 130559 flow [2022-12-06 04:00:17,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 2898 transitions, 129717 flow, removed 300 selfloop flow, removed 9 redundant places. [2022-12-06 04:00:17,866 INFO L231 Difference]: Finished difference. Result has 733 places, 2664 transitions, 123853 flow [2022-12-06 04:00:17,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=116864, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=794, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=123853, PETRI_PLACES=733, PETRI_TRANSITIONS=2664} [2022-12-06 04:00:17,877 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 715 predicate places. [2022-12-06 04:00:17,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:00:17,877 INFO L89 Accepts]: Start accepts. Operand has 733 places, 2664 transitions, 123853 flow [2022-12-06 04:00:17,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:00:17,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:00:17,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 733 places, 2664 transitions, 123853 flow [2022-12-06 04:00:17,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 733 places, 2664 transitions, 123853 flow [2022-12-06 04:00:22,091 INFO L130 PetriNetUnfolder]: 2260/5869 cut-off events. [2022-12-06 04:00:22,091 INFO L131 PetriNetUnfolder]: For 1537976/1539074 co-relation queries the response was YES. [2022-12-06 04:00:22,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127869 conditions, 5869 events. 2260/5869 cut-off events. For 1537976/1539074 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 63950 event pairs, 11 based on Foata normal form. 35/5901 useless extension candidates. Maximal degree in co-relation 127622. Up to 3275 conditions per place. [2022-12-06 04:00:22,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 733 places, 2664 transitions, 123853 flow [2022-12-06 04:00:22,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 7914 [2022-12-06 04:00:22,420 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:00:22,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4544 [2022-12-06 04:00:22,421 INFO L495 AbstractCegarLoop]: Abstraction has has 733 places, 2664 transitions, 123953 flow [2022-12-06 04:00:22,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:00:22,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:00:22,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:00:22,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-06 04:00:22,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:00:22,622 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:00:22,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:00:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1750953214, now seen corresponding path program 1 times [2022-12-06 04:00:22,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:00:22,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817523751] [2022-12-06 04:00:22,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:00:22,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:00:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:00:22,727 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 04:00:22,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:00:22,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817523751] [2022-12-06 04:00:22,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817523751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:00:22,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012414847] [2022-12-06 04:00:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:00:22,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:00:22,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:00:22,729 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:00:22,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-06 04:00:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:00:22,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 04:00:22,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:00:22,922 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 04:00:22,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:00:23,059 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 04:00:23,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012414847] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:00:23,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:00:23,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:00:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694137345] [2022-12-06 04:00:23,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:00:23,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:00:23,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:00:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:00:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:00:23,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 04:00:23,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 2664 transitions, 123953 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:00:23,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:00:23,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 04:00:23,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:00:48,775 INFO L130 PetriNetUnfolder]: 12521/21497 cut-off events. [2022-12-06 04:00:48,775 INFO L131 PetriNetUnfolder]: For 7119176/7119176 co-relation queries the response was YES. [2022-12-06 04:00:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402250 conditions, 21497 events. 12521/21497 cut-off events. For 7119176/7119176 co-relation queries the response was YES. Maximal size of possible extension queue 2337. Compared 186805 event pairs, 552 based on Foata normal form. 56/21541 useless extension candidates. Maximal degree in co-relation 402000. Up to 8075 conditions per place. [2022-12-06 04:00:49,466 INFO L137 encePairwiseOnDemand]: 8/74 looper letters, 734 selfloop transitions, 2621 changer transitions 4/3359 dead transitions. [2022-12-06 04:00:49,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 3359 transitions, 154772 flow [2022-12-06 04:00:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 04:00:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 04:00:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 227 transitions. [2022-12-06 04:00:49,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11361361361361362 [2022-12-06 04:00:49,468 INFO L175 Difference]: Start difference. First operand has 733 places, 2664 transitions, 123953 flow. Second operand 27 states and 227 transitions. [2022-12-06 04:00:49,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 759 places, 3359 transitions, 154772 flow [2022-12-06 04:02:04,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 3359 transitions, 153476 flow, removed 555 selfloop flow, removed 17 redundant places. [2022-12-06 04:02:04,288 INFO L231 Difference]: Finished difference. Result has 750 places, 3050 transitions, 151748 flow [2022-12-06 04:02:04,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=122879, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=151748, PETRI_PLACES=750, PETRI_TRANSITIONS=3050} [2022-12-06 04:02:04,290 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 732 predicate places. [2022-12-06 04:02:04,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:02:04,290 INFO L89 Accepts]: Start accepts. Operand has 750 places, 3050 transitions, 151748 flow [2022-12-06 04:02:04,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:02:04,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:02:04,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 750 places, 3050 transitions, 151748 flow [2022-12-06 04:02:04,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 750 places, 3050 transitions, 151748 flow [2022-12-06 04:02:09,917 INFO L130 PetriNetUnfolder]: 2741/7000 cut-off events. [2022-12-06 04:02:09,918 INFO L131 PetriNetUnfolder]: For 2650670/2652064 co-relation queries the response was YES. [2022-12-06 04:02:10,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171877 conditions, 7000 events. 2741/7000 cut-off events. For 2650670/2652064 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 77649 event pairs, 34 based on Foata normal form. 33/7030 useless extension candidates. Maximal degree in co-relation 171621. Up to 3996 conditions per place. [2022-12-06 04:02:10,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 750 places, 3050 transitions, 151748 flow [2022-12-06 04:02:10,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 9204 [2022-12-06 04:02:10,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:02:10,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5943 [2022-12-06 04:02:10,233 INFO L495 AbstractCegarLoop]: Abstraction has has 750 places, 3050 transitions, 151767 flow [2022-12-06 04:02:10,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:02:10,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:02:10,233 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:02:10,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-06 04:02:10,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:02:10,437 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:02:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:02:10,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1747777388, now seen corresponding path program 1 times [2022-12-06 04:02:10,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:02:10,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985274755] [2022-12-06 04:02:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:02:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:10,533 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 04:02:10,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:02:10,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985274755] [2022-12-06 04:02:10,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985274755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:02:10,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734634409] [2022-12-06 04:02:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:10,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:02:10,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:02:10,537 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:02:10,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-06 04:02:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:10,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 04:02:10,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:02:10,720 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 04:02:10,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:02:10,862 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 04:02:10,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734634409] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:02:10,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:02:10,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:02:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021712039] [2022-12-06 04:02:10,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:02:10,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:02:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:02:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:02:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:02:10,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 04:02:10,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 3050 transitions, 151767 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:02:10,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:02:10,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 04:02:10,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:02:43,707 INFO L130 PetriNetUnfolder]: 12767/22054 cut-off events. [2022-12-06 04:02:43,708 INFO L131 PetriNetUnfolder]: For 8968358/8968358 co-relation queries the response was YES. [2022-12-06 04:02:44,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421453 conditions, 22054 events. 12767/22054 cut-off events. For 8968358/8968358 co-relation queries the response was YES. Maximal size of possible extension queue 2427. Compared 194323 event pairs, 2251 based on Foata normal form. 275/22317 useless extension candidates. Maximal degree in co-relation 421194. Up to 16834 conditions per place. [2022-12-06 04:02:44,397 INFO L137 encePairwiseOnDemand]: 8/75 looper letters, 2253 selfloop transitions, 1222 changer transitions 10/3485 dead transitions. [2022-12-06 04:02:44,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 785 places, 3485 transitions, 171089 flow [2022-12-06 04:02:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 04:02:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 04:02:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 236 transitions. [2022-12-06 04:02:44,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0874074074074074 [2022-12-06 04:02:44,404 INFO L175 Difference]: Start difference. First operand has 750 places, 3050 transitions, 151767 flow. Second operand 36 states and 236 transitions. [2022-12-06 04:02:44,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 785 places, 3485 transitions, 171089 flow [2022-12-06 04:04:06,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 769 places, 3485 transitions, 164682 flow, removed 2938 selfloop flow, removed 16 redundant places. [2022-12-06 04:04:06,962 INFO L231 Difference]: Finished difference. Result has 775 places, 3189 transitions, 158015 flow [2022-12-06 04:04:06,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=146052, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=158015, PETRI_PLACES=775, PETRI_TRANSITIONS=3189} [2022-12-06 04:04:06,964 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 757 predicate places. [2022-12-06 04:04:06,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:06,964 INFO L89 Accepts]: Start accepts. Operand has 775 places, 3189 transitions, 158015 flow [2022-12-06 04:04:07,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:07,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:07,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 775 places, 3189 transitions, 158015 flow [2022-12-06 04:04:07,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 775 places, 3189 transitions, 158015 flow [2022-12-06 04:04:12,303 INFO L130 PetriNetUnfolder]: 2806/7260 cut-off events. [2022-12-06 04:04:12,303 INFO L131 PetriNetUnfolder]: For 2413606/2414522 co-relation queries the response was YES. [2022-12-06 04:04:12,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171214 conditions, 7260 events. 2806/7260 cut-off events. For 2413606/2414522 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 81335 event pairs, 22 based on Foata normal form. 34/7283 useless extension candidates. Maximal degree in co-relation 170958. Up to 4142 conditions per place. [2022-12-06 04:04:12,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 775 places, 3189 transitions, 158015 flow [2022-12-06 04:04:12,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 9582 [2022-12-06 04:04:13,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:04:13,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6116 [2022-12-06 04:04:13,080 INFO L495 AbstractCegarLoop]: Abstraction has has 775 places, 3189 transitions, 158046 flow [2022-12-06 04:04:13,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:04:13,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:13,083 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:04:13,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-06 04:04:13,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:04:13,288 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:04:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1233265733, now seen corresponding path program 2 times [2022-12-06 04:04:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:13,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057680741] [2022-12-06 04:04:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:13,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:13,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057680741] [2022-12-06 04:04:13,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057680741] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:04:13,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313872247] [2022-12-06 04:04:13,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:04:13,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:04:13,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:04:13,778 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:04:13,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-06 04:04:13,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:04:13,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:04:13,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 04:04:13,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:04:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:14,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:04:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:14,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313872247] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:04:14,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:04:14,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 04:04:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106960565] [2022-12-06 04:04:14,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:04:14,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 04:04:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 04:04:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-12-06 04:04:14,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-06 04:04:14,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 3189 transitions, 158046 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 04:04:14,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:14,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-06 04:04:14,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:47,120 INFO L130 PetriNetUnfolder]: 13152/22787 cut-off events. [2022-12-06 04:04:47,120 INFO L131 PetriNetUnfolder]: For 7615525/7615525 co-relation queries the response was YES. [2022-12-06 04:04:47,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429069 conditions, 22787 events. 13152/22787 cut-off events. For 7615525/7615525 co-relation queries the response was YES. Maximal size of possible extension queue 2516. Compared 202788 event pairs, 1845 based on Foata normal form. 104/22879 useless extension candidates. Maximal degree in co-relation 428810. Up to 16422 conditions per place. [2022-12-06 04:04:47,677 INFO L137 encePairwiseOnDemand]: 8/76 looper letters, 2213 selfloop transitions, 1450 changer transitions 10/3673 dead transitions. [2022-12-06 04:04:47,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 824 places, 3673 transitions, 177317 flow [2022-12-06 04:04:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 04:04:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 04:04:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 304 transitions. [2022-12-06 04:04:47,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08 [2022-12-06 04:04:47,678 INFO L175 Difference]: Start difference. First operand has 775 places, 3189 transitions, 158046 flow. Second operand 50 states and 304 transitions. [2022-12-06 04:04:47,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 824 places, 3673 transitions, 177317 flow Received shutdown request... [2022-12-06 04:05:56,155 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 04:05:56,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-06 04:05:56,180 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 04:05:56,181 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 04:05:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-06 04:05:56,362 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 04:05:56,363 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 04:05:56,363 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 04:05:56,364 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:56,366 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:05:56,366 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:05:56,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:05:56 BasicIcfg [2022-12-06 04:05:56,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:05:56,368 INFO L158 Benchmark]: Toolchain (without parser) took 845493.56ms. Allocated memory was 231.7MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 207.2MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 04:05:56,368 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 231.7MB. Free memory was 208.6MB in the beginning and 208.6MB in the end (delta: 62.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:05:56,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.37ms. Allocated memory is still 231.7MB. Free memory was 206.8MB in the beginning and 186.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 04:05:56,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.76ms. Allocated memory is still 231.7MB. Free memory was 186.9MB in the beginning and 184.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:05:56,370 INFO L158 Benchmark]: Boogie Preprocessor took 30.03ms. Allocated memory is still 231.7MB. Free memory was 184.8MB in the beginning and 183.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:05:56,374 INFO L158 Benchmark]: RCFGBuilder took 336.85ms. Allocated memory is still 231.7MB. Free memory was 183.2MB in the beginning and 168.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 04:05:56,375 INFO L158 Benchmark]: TraceAbstraction took 844701.67ms. Allocated memory was 231.7MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 167.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 04:05:56,377 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.10ms. Allocated memory is still 231.7MB. Free memory was 208.6MB in the beginning and 208.6MB in the end (delta: 62.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 374.37ms. Allocated memory is still 231.7MB. Free memory was 206.8MB in the beginning and 186.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.76ms. Allocated memory is still 231.7MB. Free memory was 186.9MB in the beginning and 184.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.03ms. Allocated memory is still 231.7MB. Free memory was 184.8MB in the beginning and 183.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 336.85ms. Allocated memory is still 231.7MB. Free memory was 183.2MB in the beginning and 168.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 844701.67ms. Allocated memory was 231.7MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 167.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 91 PlacesBefore, 18 PlacesAfterwards, 91 TransitionsBefore, 14 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 1109, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1122, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1096, unknown conditional: 0, unknown unconditional: 1096] , Statistics on independence cache: Total cache size (in pairs): 1947, Positive cache size: 1936, Positive conditional cache size: 0, Positive unconditional cache size: 1936, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 18 PlacesBefore, 18 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 42, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 102, Positive conditional cache size: 102, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 150, Positive conditional cache size: 150, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 240, Positive conditional cache size: 240, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 20 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 258, Positive conditional cache size: 258, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 26 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 290, Positive conditional cache size: 290, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 290, Positive conditional cache size: 290, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 37 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 408, Positive conditional cache size: 408, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 408, Positive conditional cache size: 408, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 408, Positive conditional cache size: 408, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 408, Positive conditional cache size: 408, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 56 PlacesBefore, 56 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 461, Positive cache size: 461, Positive conditional cache size: 461, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 519, Positive conditional cache size: 519, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 78 PlacesBefore, 78 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 678, Positive cache size: 678, Positive conditional cache size: 678, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 93 PlacesBefore, 93 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 795, Positive conditional cache size: 795, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 862, Positive cache size: 862, Positive conditional cache size: 862, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 121 PlacesBefore, 121 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 976, Positive conditional cache size: 976, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 1048, Positive conditional cache size: 1048, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 319 TransitionsBefore, 319 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 1048, Positive conditional cache size: 1048, 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, 156 PlacesBefore, 156 PlacesAfterwards, 325 TransitionsBefore, 325 TransitionsAfterwards, 994 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): 1048, Positive cache size: 1048, Positive conditional cache size: 1048, 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, 172 PlacesBefore, 172 PlacesAfterwards, 350 TransitionsBefore, 350 TransitionsAfterwards, 1046 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): 1048, Positive cache size: 1048, Positive conditional cache size: 1048, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 185 PlacesBefore, 185 PlacesAfterwards, 398 TransitionsBefore, 398 TransitionsAfterwards, 1210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1171, Positive conditional cache size: 1171, 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, 187 PlacesBefore, 187 PlacesAfterwards, 400 TransitionsBefore, 400 TransitionsAfterwards, 1286 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): 1171, Positive cache size: 1171, Positive conditional cache size: 1171, 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, 210 PlacesBefore, 210 PlacesAfterwards, 465 TransitionsBefore, 465 TransitionsAfterwards, 1480 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): 1171, Positive cache size: 1171, Positive conditional cache size: 1171, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 233 PlacesBefore, 233 PlacesAfterwards, 495 TransitionsBefore, 495 TransitionsAfterwards, 1534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1366, Positive cache size: 1366, Positive conditional cache size: 1366, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 255 PlacesBefore, 255 PlacesAfterwards, 604 TransitionsBefore, 604 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1705, Positive cache size: 1705, Positive conditional cache size: 1705, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 273 PlacesBefore, 273 PlacesAfterwards, 666 TransitionsBefore, 666 TransitionsAfterwards, 1928 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1850, Positive cache size: 1850, Positive conditional cache size: 1850, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 299 PlacesBefore, 299 PlacesAfterwards, 775 TransitionsBefore, 775 TransitionsAfterwards, 2212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2029, Positive cache size: 2027, Positive conditional cache size: 2027, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 294 PlacesBefore, 294 PlacesAfterwards, 776 TransitionsBefore, 776 TransitionsAfterwards, 2134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 2028, Positive conditional cache size: 2028, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 295 PlacesBefore, 295 PlacesAfterwards, 768 TransitionsBefore, 768 TransitionsAfterwards, 2222 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): 2030, Positive cache size: 2028, Positive conditional cache size: 2028, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 311 PlacesBefore, 311 PlacesAfterwards, 798 TransitionsBefore, 798 TransitionsAfterwards, 2286 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): 2030, Positive cache size: 2028, Positive conditional cache size: 2028, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 331 PlacesBefore, 331 PlacesAfterwards, 877 TransitionsBefore, 877 TransitionsAfterwards, 2436 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): 2030, Positive cache size: 2028, Positive conditional cache size: 2028, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 332 PlacesBefore, 332 PlacesAfterwards, 883 TransitionsBefore, 883 TransitionsAfterwards, 2528 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): 2030, Positive cache size: 2028, Positive conditional cache size: 2028, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 354 PlacesBefore, 354 PlacesAfterwards, 983 TransitionsBefore, 983 TransitionsAfterwards, 2878 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): 2030, Positive cache size: 2028, Positive conditional cache size: 2028, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 369 PlacesBefore, 369 PlacesAfterwards, 1015 TransitionsBefore, 1015 TransitionsAfterwards, 2934 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2104, Positive cache size: 2102, Positive conditional cache size: 2102, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 368 PlacesBefore, 368 PlacesAfterwards, 1001 TransitionsBefore, 1001 TransitionsAfterwards, 2924 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): 2104, Positive cache size: 2102, Positive conditional cache size: 2102, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 375 PlacesBefore, 375 PlacesAfterwards, 1043 TransitionsBefore, 1043 TransitionsAfterwards, 3288 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): 2104, Positive cache size: 2102, Positive conditional cache size: 2102, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 423 PlacesBefore, 423 PlacesAfterwards, 1180 TransitionsBefore, 1180 TransitionsAfterwards, 3682 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2216, Positive cache size: 2214, Positive conditional cache size: 2214, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 421 PlacesBefore, 421 PlacesAfterwards, 1211 TransitionsBefore, 1211 TransitionsAfterwards, 3896 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): 2216, Positive cache size: 2214, Positive conditional cache size: 2214, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 449 PlacesBefore, 449 PlacesAfterwards, 1259 TransitionsBefore, 1259 TransitionsAfterwards, 3986 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): 2216, Positive cache size: 2214, Positive conditional cache size: 2214, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 484 PlacesBefore, 484 PlacesAfterwards, 1383 TransitionsBefore, 1383 TransitionsAfterwards, 4366 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): 2216, Positive cache size: 2214, Positive conditional cache size: 2214, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 497 PlacesBefore, 497 PlacesAfterwards, 1525 TransitionsBefore, 1525 TransitionsAfterwards, 4926 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): 2216, Positive cache size: 2214, Positive conditional cache size: 2214, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 518 PlacesBefore, 518 PlacesAfterwards, 1652 TransitionsBefore, 1652 TransitionsAfterwards, 5230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2281, Positive cache size: 2279, Positive conditional cache size: 2279, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 552 PlacesBefore, 551 PlacesAfterwards, 1739 TransitionsBefore, 1738 TransitionsAfterwards, 5410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2476, Positive cache size: 2474, Positive conditional cache size: 2474, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 564 PlacesBefore, 564 PlacesAfterwards, 1785 TransitionsBefore, 1785 TransitionsAfterwards, 5536 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): 2476, Positive cache size: 2474, Positive conditional cache size: 2474, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 585 PlacesBefore, 585 PlacesAfterwards, 1968 TransitionsBefore, 1968 TransitionsAfterwards, 5966 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): 2476, Positive cache size: 2474, Positive conditional cache size: 2474, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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.5s, 641 PlacesBefore, 640 PlacesAfterwards, 2240 TransitionsBefore, 2239 TransitionsAfterwards, 6772 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2928, Positive cache size: 2926, Positive conditional cache size: 2926, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 681 PlacesBefore, 681 PlacesAfterwards, 2506 TransitionsBefore, 2506 TransitionsAfterwards, 7592 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3062, Positive cache size: 3060, Positive conditional cache size: 3060, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 696 PlacesBefore, 696 PlacesAfterwards, 2588 TransitionsBefore, 2588 TransitionsAfterwards, 7750 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3141, Positive cache size: 3139, Positive conditional cache size: 3139, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 733 PlacesBefore, 733 PlacesAfterwards, 2664 TransitionsBefore, 2664 TransitionsAfterwards, 7914 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3367, Positive cache size: 3365, Positive conditional cache size: 3365, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, 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, 750 PlacesBefore, 750 PlacesAfterwards, 3050 TransitionsBefore, 3050 TransitionsAfterwards, 9204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3451, Positive cache size: 3449, Positive conditional cache size: 3449, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 775 PlacesBefore, 775 PlacesAfterwards, 3189 TransitionsBefore, 3189 TransitionsAfterwards, 9582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3452, Positive cache size: 3450, Positive conditional cache size: 3450, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 844.6s, OverallIterations: 55, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 762.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6304 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6304 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22388 IncrementalHoareTripleChecker+Invalid, 30546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8158 mSolverCounterUnsat, 0 mSDtfsCounter, 22388 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1783 GetRequests, 558 SyntacticMatches, 2 SemanticMatches, 1223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10308 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158046occurred in iteration=54, InterpolantAutomatonStates: 914, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 1136 NumberOfCodeBlocks, 1136 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 1462 ConstructedInterpolants, 0 QuantifiedInterpolants, 20330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7580 ConjunctsInSsa, 617 ConjunctsInUnsatCore, 147 InterpolantComputations, 12 PerfectInterpolantSequences, 74/425 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