/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:17:08,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:17:08,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:17:08,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:17:08,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:17:08,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:17:08,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:17:08,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:17:08,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:17:08,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:17:08,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:17:08,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:17:08,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:17:08,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:17:08,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:17:08,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:17:08,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:17:08,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:17:08,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:17:08,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:17:08,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:17:08,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:17:08,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:17:08,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:17:08,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:17:08,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:17:08,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:17:08,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:17:08,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:17:08,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:17:08,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:17:08,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:17:08,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:17:08,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:17:08,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:17:08,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:17:08,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:17:08,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:17:08,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:17:08,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:17:08,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:17:08,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:17:08,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:17:08,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:17:08,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:17:08,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:17:08,259 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:17:08,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:17:08,259 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:17:08,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:17:08,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:17:08,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:17:08,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:17:08,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:17:08,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:17:08,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:17:08,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:17:08,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:17:08,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:17:08,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:17:08,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:17:08,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:17:08,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:17:08,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:17:08,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:17:08,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:17:08,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:17:08,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:17:08,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:17:08,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:17:08,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:17:08,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:17:08,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:17:08,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:17:08,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:17:08,591 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:17:08,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 03:17:09,688 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:17:09,954 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:17:09,954 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 03:17:09,966 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0762fada3/67fbf5648fba4ff98e81d613e93fd62a/FLAG363e7b4b4 [2022-12-13 03:17:09,981 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0762fada3/67fbf5648fba4ff98e81d613e93fd62a [2022-12-13 03:17:09,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:17:09,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:17:09,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:17:09,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:17:09,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:17:09,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:17:09" (1/1) ... [2022-12-13 03:17:09,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a86c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:09, skipping insertion in model container [2022-12-13 03:17:09,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:17:09" (1/1) ... [2022-12-13 03:17:09,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:17:10,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:17:10,168 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-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 03:17:10,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:17:10,363 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:17:10,371 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-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 03:17:10,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:10,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:10,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:17:10,490 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:17:10,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10 WrapperNode [2022-12-13 03:17:10,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:17:10,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:17:10,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:17:10,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:17:10,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,546 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 03:17:10,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:17:10,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:17:10,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:17:10,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:17:10,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,580 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:17:10,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:17:10,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:17:10,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:17:10,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (1/1) ... [2022-12-13 03:17:10,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:17:10,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:17:10,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:17:10,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:17:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:17:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:17:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:17:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:17:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:17:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:17:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:17:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:17:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:17:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:17:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:17:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:17:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:17:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:17:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:17:10,711 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:17:10,861 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:17:10,863 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:17:11,142 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:17:11,259 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:17:11,259 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:17:11,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:17:11 BoogieIcfgContainer [2022-12-13 03:17:11,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:17:11,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:17:11,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:17:11,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:17:11,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:17:09" (1/3) ... [2022-12-13 03:17:11,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179be99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:17:11, skipping insertion in model container [2022-12-13 03:17:11,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:10" (2/3) ... [2022-12-13 03:17:11,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179be99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:17:11, skipping insertion in model container [2022-12-13 03:17:11,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:17:11" (3/3) ... [2022-12-13 03:17:11,267 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 03:17:11,280 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:17:11,280 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 03:17:11,280 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:17:11,324 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:17:11,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-13 03:17:11,433 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-13 03:17:11,433 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:17:11,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 03:17:11,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-13 03:17:11,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-13 03:17:11,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:11,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-13 03:17:11,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-13 03:17:11,473 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-13 03:17:11,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:17:11,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 03:17:11,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-13 03:17:11,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 2022 [2022-12-13 03:17:19,012 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 03:17:19,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:17:19,037 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;@2fcb75d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:17:19,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 03:17:19,041 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 03:17:19,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:17:19,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:19,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 03:17:19,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash 534766748, now seen corresponding path program 1 times [2022-12-13 03:17:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:19,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58943269] [2022-12-13 03:17:19,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:19,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58943269] [2022-12-13 03:17:19,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58943269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:19,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:19,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:17:19,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779721294] [2022-12-13 03:17:19,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:19,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:17:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:19,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:17:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:17:19,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-13 03:17:19,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:19,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:19,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-13 03:17:19,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:21,800 INFO L130 PetriNetUnfolder]: 13749/21906 cut-off events. [2022-12-13 03:17:21,800 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 03:17:21,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41431 conditions, 21906 events. 13749/21906 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 167836 event pairs, 1853 based on Foata normal form. 0/14290 useless extension candidates. Maximal degree in co-relation 41420. Up to 16433 conditions per place. [2022-12-13 03:17:21,846 INFO L137 encePairwiseOnDemand]: 57/63 looper letters, 38 selfloop transitions, 2 changer transitions 52/101 dead transitions. [2022-12-13 03:17:21,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 398 flow [2022-12-13 03:17:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:17:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:17:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-12-13 03:17:21,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 03:17:21,857 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2022-12-13 03:17:21,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 101 transitions, 398 flow [2022-12-13 03:17:21,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 49 transitions, 190 flow [2022-12-13 03:17:21,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:21,956 INFO L89 Accepts]: Start accepts. Operand has 45 places, 49 transitions, 190 flow [2022-12-13 03:17:21,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:21,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:21,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 49 transitions, 190 flow [2022-12-13 03:17:21,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 49 transitions, 190 flow [2022-12-13 03:17:21,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-13 03:17:22,431 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:22,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 479 [2022-12-13 03:17:22,435 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 49 transitions, 190 flow [2022-12-13 03:17:22,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:22,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:22,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:22,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:17:22,439 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:22,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1359137346, now seen corresponding path program 1 times [2022-12-13 03:17:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:22,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891054920] [2022-12-13 03:17:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:22,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:22,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891054920] [2022-12-13 03:17:22,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891054920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:22,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:22,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:17:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037417050] [2022-12-13 03:17:22,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:22,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:17:22,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:22,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:17:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:17:22,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 03:17:22,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 49 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:22,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:22,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 03:17:22,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:22,919 INFO L130 PetriNetUnfolder]: 1774/2851 cut-off events. [2022-12-13 03:17:22,919 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-13 03:17:22,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8161 conditions, 2851 events. 1774/2851 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15577 event pairs, 162 based on Foata normal form. 90/2520 useless extension candidates. Maximal degree in co-relation 8147. Up to 2197 conditions per place. [2022-12-13 03:17:22,931 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 61 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2022-12-13 03:17:22,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 73 transitions, 423 flow [2022-12-13 03:17:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:17:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:17:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 03:17:22,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2022-12-13 03:17:22,933 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -25 predicate places. [2022-12-13 03:17:22,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 73 transitions, 423 flow [2022-12-13 03:17:22,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 73 transitions, 423 flow [2022-12-13 03:17:22,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:22,951 INFO L89 Accepts]: Start accepts. Operand has 47 places, 73 transitions, 423 flow [2022-12-13 03:17:22,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:22,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:22,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 73 transitions, 423 flow [2022-12-13 03:17:22,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 73 transitions, 423 flow [2022-12-13 03:17:22,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 03:17:22,959 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:22,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:17:22,960 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 73 transitions, 423 flow [2022-12-13 03:17:22,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:22,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:22,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:22,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:17:22,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1524847112, now seen corresponding path program 1 times [2022-12-13 03:17:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:22,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528827632] [2022-12-13 03:17:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:23,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528827632] [2022-12-13 03:17:23,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528827632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:23,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:23,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:17:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106747737] [2022-12-13 03:17:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:23,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:17:23,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:23,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:17:23,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:17:23,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 03:17:23,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 73 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-13 03:17:23,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:23,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 03:17:23,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:23,474 INFO L130 PetriNetUnfolder]: 1723/2711 cut-off events. [2022-12-13 03:17:23,474 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-13 03:17:23,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10418 conditions, 2711 events. 1723/2711 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13683 event pairs, 92 based on Foata normal form. 20/2319 useless extension candidates. Maximal degree in co-relation 10401. Up to 2137 conditions per place. [2022-12-13 03:17:23,488 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 87 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2022-12-13 03:17:23,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 101 transitions, 775 flow [2022-12-13 03:17:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:17:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:17:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 03:17:23,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2022-12-13 03:17:23,490 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2022-12-13 03:17:23,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 101 transitions, 775 flow [2022-12-13 03:17:23,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 101 transitions, 775 flow [2022-12-13 03:17:23,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:23,514 INFO L89 Accepts]: Start accepts. Operand has 49 places, 101 transitions, 775 flow [2022-12-13 03:17:23,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:23,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:23,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 101 transitions, 775 flow [2022-12-13 03:17:23,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 101 transitions, 775 flow [2022-12-13 03:17:23,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-13 03:17:23,521 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:23,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:17:23,522 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 101 transitions, 775 flow [2022-12-13 03:17:23,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-13 03:17:23,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:23,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:23,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:17:23,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash 25618169, now seen corresponding path program 1 times [2022-12-13 03:17:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:23,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486632688] [2022-12-13 03:17:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:23,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486632688] [2022-12-13 03:17:23,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486632688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:23,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:23,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:17:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244966436] [2022-12-13 03:17:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:23,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:23,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:23,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 03:17:23,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 101 transitions, 775 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:23,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:23,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 03:17:23,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:24,254 INFO L130 PetriNetUnfolder]: 2866/4505 cut-off events. [2022-12-13 03:17:24,255 INFO L131 PetriNetUnfolder]: For 2298/2298 co-relation queries the response was YES. [2022-12-13 03:17:24,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21077 conditions, 4505 events. 2866/4505 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 25010 event pairs, 76 based on Foata normal form. 120/3932 useless extension candidates. Maximal degree in co-relation 21057. Up to 3731 conditions per place. [2022-12-13 03:17:24,273 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 80 selfloop transitions, 4 changer transitions 66/158 dead transitions. [2022-12-13 03:17:24,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 158 transitions, 1537 flow [2022-12-13 03:17:24,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 03:17:24,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2022-12-13 03:17:24,276 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2022-12-13 03:17:24,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 158 transitions, 1537 flow [2022-12-13 03:17:24,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 92 transitions, 877 flow [2022-12-13 03:17:24,308 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:24,308 INFO L89 Accepts]: Start accepts. Operand has 52 places, 92 transitions, 877 flow [2022-12-13 03:17:24,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:24,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:24,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 92 transitions, 877 flow [2022-12-13 03:17:24,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 92 transitions, 877 flow [2022-12-13 03:17:24,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 03:17:25,410 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:17:25,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1103 [2022-12-13 03:17:25,411 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 92 transitions, 877 flow [2022-12-13 03:17:25,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:25,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:25,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:25,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:17:25,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1079319120, now seen corresponding path program 1 times [2022-12-13 03:17:25,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:25,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701415580] [2022-12-13 03:17:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:26,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:26,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701415580] [2022-12-13 03:17:26,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701415580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:26,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:26,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:17:26,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367424271] [2022-12-13 03:17:26,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:26,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:17:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:26,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:17:26,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:17:26,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 03:17:26,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 92 transitions, 877 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:26,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 03:17:26,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:26,513 INFO L130 PetriNetUnfolder]: 2238/3598 cut-off events. [2022-12-13 03:17:26,513 INFO L131 PetriNetUnfolder]: For 524/524 co-relation queries the response was YES. [2022-12-13 03:17:26,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20558 conditions, 3598 events. 2238/3598 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19583 event pairs, 72 based on Foata normal form. 160/3123 useless extension candidates. Maximal degree in co-relation 20535. Up to 3271 conditions per place. [2022-12-13 03:17:26,533 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 111 selfloop transitions, 15 changer transitions 0/135 dead transitions. [2022-12-13 03:17:26,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 135 transitions, 1565 flow [2022-12-13 03:17:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:17:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:17:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-13 03:17:26,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2022-12-13 03:17:26,535 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -16 predicate places. [2022-12-13 03:17:26,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 135 transitions, 1565 flow [2022-12-13 03:17:26,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 135 transitions, 1565 flow [2022-12-13 03:17:26,573 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:26,573 INFO L89 Accepts]: Start accepts. Operand has 56 places, 135 transitions, 1565 flow [2022-12-13 03:17:26,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:26,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:26,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 135 transitions, 1565 flow [2022-12-13 03:17:26,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 135 transitions, 1565 flow [2022-12-13 03:17:26,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 772 [2022-12-13 03:17:26,584 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:26,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:17:26,586 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 135 transitions, 1565 flow [2022-12-13 03:17:26,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:26,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:26,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:17:26,586 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -794268428, now seen corresponding path program 1 times [2022-12-13 03:17:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:26,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353388962] [2022-12-13 03:17:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:26,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:26,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:26,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353388962] [2022-12-13 03:17:26,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353388962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:26,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:26,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:17:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879025235] [2022-12-13 03:17:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:26,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:17:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:26,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:17:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:17:26,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 03:17:26,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 135 transitions, 1565 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:26,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 03:17:26,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:27,199 INFO L130 PetriNetUnfolder]: 3109/4857 cut-off events. [2022-12-13 03:17:27,200 INFO L131 PetriNetUnfolder]: For 8117/8117 co-relation queries the response was YES. [2022-12-13 03:17:27,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30392 conditions, 4857 events. 3109/4857 cut-off events. For 8117/8117 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 26724 event pairs, 389 based on Foata normal form. 74/4213 useless extension candidates. Maximal degree in co-relation 30366. Up to 4555 conditions per place. [2022-12-13 03:17:27,226 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 150 selfloop transitions, 40 changer transitions 12/208 dead transitions. [2022-12-13 03:17:27,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 208 transitions, 2836 flow [2022-12-13 03:17:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:17:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:17:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 03:17:27,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 03:17:27,231 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2022-12-13 03:17:27,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 208 transitions, 2836 flow [2022-12-13 03:17:27,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 196 transitions, 2668 flow [2022-12-13 03:17:27,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:27,376 INFO L89 Accepts]: Start accepts. Operand has 58 places, 196 transitions, 2668 flow [2022-12-13 03:17:27,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:27,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:27,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 196 transitions, 2668 flow [2022-12-13 03:17:27,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 196 transitions, 2668 flow [2022-12-13 03:17:27,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-13 03:17:30,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:17:30,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3348 [2022-12-13 03:17:30,724 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 198 transitions, 2708 flow [2022-12-13 03:17:30,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:30,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:30,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:30,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:17:30,725 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1179157113, now seen corresponding path program 1 times [2022-12-13 03:17:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:30,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090222167] [2022-12-13 03:17:30,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:30,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:30,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090222167] [2022-12-13 03:17:30,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090222167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:30,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:30,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:17:30,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144854793] [2022-12-13 03:17:30,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:30,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:30,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:30,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:30,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2022-12-13 03:17:30,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 198 transitions, 2708 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-13 03:17:30,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:30,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2022-12-13 03:17:30,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:31,231 INFO L130 PetriNetUnfolder]: 1466/2648 cut-off events. [2022-12-13 03:17:31,231 INFO L131 PetriNetUnfolder]: For 6669/6669 co-relation queries the response was YES. [2022-12-13 03:17:31,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19158 conditions, 2648 events. 1466/2648 cut-off events. For 6669/6669 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15713 event pairs, 85 based on Foata normal form. 210/2484 useless extension candidates. Maximal degree in co-relation 19129. Up to 2354 conditions per place. [2022-12-13 03:17:31,246 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 137 selfloop transitions, 63 changer transitions 16/222 dead transitions. [2022-12-13 03:17:31,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 222 transitions, 3440 flow [2022-12-13 03:17:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 03:17:31,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6418918918918919 [2022-12-13 03:17:31,249 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2022-12-13 03:17:31,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 222 transitions, 3440 flow [2022-12-13 03:17:31,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 206 transitions, 3184 flow [2022-12-13 03:17:31,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:31,277 INFO L89 Accepts]: Start accepts. Operand has 61 places, 206 transitions, 3184 flow [2022-12-13 03:17:31,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:31,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:31,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 206 transitions, 3184 flow [2022-12-13 03:17:31,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 206 transitions, 3184 flow [2022-12-13 03:17:31,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-13 03:17:31,286 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:31,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:17:31,287 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 206 transitions, 3184 flow [2022-12-13 03:17:31,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-13 03:17:31,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:31,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:31,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:17:31,287 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:31,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash 413190968, now seen corresponding path program 1 times [2022-12-13 03:17:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:31,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777382] [2022-12-13 03:17:31,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:31,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:31,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777382] [2022-12-13 03:17:31,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:31,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:31,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:17:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552102317] [2022-12-13 03:17:31,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:31,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:17:31,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:31,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:17:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:17:31,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 03:17:31,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 206 transitions, 3184 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:31,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:31,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 03:17:31,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:31,692 INFO L130 PetriNetUnfolder]: 914/1682 cut-off events. [2022-12-13 03:17:31,692 INFO L131 PetriNetUnfolder]: For 4962/4962 co-relation queries the response was YES. [2022-12-13 03:17:31,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13581 conditions, 1682 events. 914/1682 cut-off events. For 4962/4962 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9180 event pairs, 8 based on Foata normal form. 144/1579 useless extension candidates. Maximal degree in co-relation 13549. Up to 1388 conditions per place. [2022-12-13 03:17:31,703 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 122 selfloop transitions, 72 changer transitions 1/201 dead transitions. [2022-12-13 03:17:31,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 201 transitions, 3494 flow [2022-12-13 03:17:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:17:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:17:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 03:17:31,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2022-12-13 03:17:31,708 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2022-12-13 03:17:31,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 201 transitions, 3494 flow [2022-12-13 03:17:31,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 200 transitions, 3476 flow [2022-12-13 03:17:31,730 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:31,730 INFO L89 Accepts]: Start accepts. Operand has 64 places, 200 transitions, 3476 flow [2022-12-13 03:17:31,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:31,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:31,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 200 transitions, 3476 flow [2022-12-13 03:17:31,737 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 200 transitions, 3476 flow [2022-12-13 03:17:31,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-13 03:17:33,112 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:17:33,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1383 [2022-12-13 03:17:33,113 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 199 transitions, 3458 flow [2022-12-13 03:17:33,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:33,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:33,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:33,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:17:33,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1980551351, now seen corresponding path program 1 times [2022-12-13 03:17:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:33,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597186673] [2022-12-13 03:17:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:33,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597186673] [2022-12-13 03:17:33,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597186673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:33,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:33,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:17:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562904813] [2022-12-13 03:17:33,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:33,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:17:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:17:33,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:17:33,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 03:17:33,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 199 transitions, 3458 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:33,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:33,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 03:17:33,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:33,974 INFO L130 PetriNetUnfolder]: 1734/3164 cut-off events. [2022-12-13 03:17:33,975 INFO L131 PetriNetUnfolder]: For 10314/10314 co-relation queries the response was YES. [2022-12-13 03:17:33,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27422 conditions, 3164 events. 1734/3164 cut-off events. For 10314/10314 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20544 event pairs, 8 based on Foata normal form. 54/2658 useless extension candidates. Maximal degree in co-relation 27387. Up to 2758 conditions per place. [2022-12-13 03:17:33,990 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 249 selfloop transitions, 44 changer transitions 113/421 dead transitions. [2022-12-13 03:17:33,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 421 transitions, 8293 flow [2022-12-13 03:17:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:17:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:17:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-12-13 03:17:33,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6205357142857143 [2022-12-13 03:17:33,993 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2022-12-13 03:17:33,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 421 transitions, 8293 flow [2022-12-13 03:17:34,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 308 transitions, 6030 flow [2022-12-13 03:17:34,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:34,039 INFO L89 Accepts]: Start accepts. Operand has 67 places, 308 transitions, 6030 flow [2022-12-13 03:17:34,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:34,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:34,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 308 transitions, 6030 flow [2022-12-13 03:17:34,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 308 transitions, 6030 flow [2022-12-13 03:17:34,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 894 [2022-12-13 03:17:34,057 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:34,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 03:17:34,058 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 308 transitions, 6030 flow [2022-12-13 03:17:34,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:34,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:34,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:34,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:17:34,058 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1962957925, now seen corresponding path program 1 times [2022-12-13 03:17:34,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:34,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119785983] [2022-12-13 03:17:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:34,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:34,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119785983] [2022-12-13 03:17:34,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119785983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:34,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:34,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:17:34,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339478414] [2022-12-13 03:17:34,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:34,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:17:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:17:34,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:17:34,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 03:17:34,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 308 transitions, 6030 flow. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:34,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:34,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 03:17:34,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:35,333 INFO L130 PetriNetUnfolder]: 1367/2471 cut-off events. [2022-12-13 03:17:35,333 INFO L131 PetriNetUnfolder]: For 10765/10765 co-relation queries the response was YES. [2022-12-13 03:17:35,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23504 conditions, 2471 events. 1367/2471 cut-off events. For 10765/10765 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 14837 event pairs, 8 based on Foata normal form. 54/2105 useless extension candidates. Maximal degree in co-relation 23466. Up to 2089 conditions per place. [2022-12-13 03:17:35,346 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 209 selfloop transitions, 39 changer transitions 88/351 dead transitions. [2022-12-13 03:17:35,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 351 transitions, 7562 flow [2022-12-13 03:17:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:17:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:17:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-13 03:17:35,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-13 03:17:35,348 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2022-12-13 03:17:35,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 351 transitions, 7562 flow [2022-12-13 03:17:35,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 263 transitions, 5617 flow [2022-12-13 03:17:35,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:35,384 INFO L89 Accepts]: Start accepts. Operand has 73 places, 263 transitions, 5617 flow [2022-12-13 03:17:35,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:35,386 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:35,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 263 transitions, 5617 flow [2022-12-13 03:17:35,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 263 transitions, 5617 flow [2022-12-13 03:17:35,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-13 03:17:35,398 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:35,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 03:17:35,398 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 263 transitions, 5617 flow [2022-12-13 03:17:35,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:35,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:35,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:35,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:17:35,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash 753364731, now seen corresponding path program 2 times [2022-12-13 03:17:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:35,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585802049] [2022-12-13 03:17:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:48,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:48,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585802049] [2022-12-13 03:17:48,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585802049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:48,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:48,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:17:48,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571060574] [2022-12-13 03:17:48,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:48,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:17:48,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:48,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:17:48,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:17:48,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 03:17:48,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 263 transitions, 5617 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:48,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:48,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 03:17:48,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:49,468 INFO L130 PetriNetUnfolder]: 1729/3134 cut-off events. [2022-12-13 03:17:49,469 INFO L131 PetriNetUnfolder]: For 18524/18524 co-relation queries the response was YES. [2022-12-13 03:17:49,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32138 conditions, 3134 events. 1729/3134 cut-off events. For 18524/18524 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20046 event pairs, 0 based on Foata normal form. 54/2633 useless extension candidates. Maximal degree in co-relation 32097. Up to 2717 conditions per place. [2022-12-13 03:17:49,500 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 289 selfloop transitions, 70 changer transitions 95/469 dead transitions. [2022-12-13 03:17:49,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 469 transitions, 11090 flow [2022-12-13 03:17:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:17:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:17:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2022-12-13 03:17:49,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-13 03:17:49,502 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 9 predicate places. [2022-12-13 03:17:49,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 469 transitions, 11090 flow [2022-12-13 03:17:49,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 374 transitions, 8807 flow [2022-12-13 03:17:49,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:49,553 INFO L89 Accepts]: Start accepts. Operand has 79 places, 374 transitions, 8807 flow [2022-12-13 03:17:49,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:49,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:49,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 374 transitions, 8807 flow [2022-12-13 03:17:49,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 374 transitions, 8807 flow [2022-12-13 03:17:49,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-13 03:17:49,574 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:49,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 03:17:49,574 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 374 transitions, 8807 flow [2022-12-13 03:17:49,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:49,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:49,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:49,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:17:49,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 223210265, now seen corresponding path program 3 times [2022-12-13 03:17:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:49,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077620187] [2022-12-13 03:17:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:18:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:04,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077620187] [2022-12-13 03:18:04,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077620187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:04,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:04,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:18:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016829798] [2022-12-13 03:18:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:04,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:18:04,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:04,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:18:04,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:18:04,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 03:18:04,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 374 transitions, 8807 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:04,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:04,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 03:18:04,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:04,593 INFO L130 PetriNetUnfolder]: 1262/2284 cut-off events. [2022-12-13 03:18:04,594 INFO L131 PetriNetUnfolder]: For 18868/18868 co-relation queries the response was YES. [2022-12-13 03:18:04,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25536 conditions, 2284 events. 1262/2284 cut-off events. For 18868/18868 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13637 event pairs, 0 based on Foata normal form. 27/1952 useless extension candidates. Maximal degree in co-relation 25492. Up to 1889 conditions per place. [2022-12-13 03:18:04,637 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 292 selfloop transitions, 37 changer transitions 54/398 dead transitions. [2022-12-13 03:18:04,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 398 transitions, 10152 flow [2022-12-13 03:18:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:18:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:18:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2022-12-13 03:18:04,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 03:18:04,640 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2022-12-13 03:18:04,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 398 transitions, 10152 flow [2022-12-13 03:18:04,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 344 transitions, 8742 flow [2022-12-13 03:18:04,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:04,680 INFO L89 Accepts]: Start accepts. Operand has 84 places, 344 transitions, 8742 flow [2022-12-13 03:18:04,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:04,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:04,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 344 transitions, 8742 flow [2022-12-13 03:18:04,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 344 transitions, 8742 flow [2022-12-13 03:18:04,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 960 [2022-12-13 03:18:04,696 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:04,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 03:18:04,697 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 344 transitions, 8742 flow [2022-12-13 03:18:04,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:04,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:04,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:04,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 03:18:04,697 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:18:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1836423048, now seen corresponding path program 1 times [2022-12-13 03:18:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:04,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657049518] [2022-12-13 03:18:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:04,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:18:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:24,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657049518] [2022-12-13 03:18:24,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657049518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:24,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:24,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:18:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65300822] [2022-12-13 03:18:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:24,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:18:24,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:24,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:18:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:18:24,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 03:18:24,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 344 transitions, 8742 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:24,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:24,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 03:18:24,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:25,307 INFO L130 PetriNetUnfolder]: 1260/2254 cut-off events. [2022-12-13 03:18:25,308 INFO L131 PetriNetUnfolder]: For 22337/22337 co-relation queries the response was YES. [2022-12-13 03:18:25,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27092 conditions, 2254 events. 1260/2254 cut-off events. For 22337/22337 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13071 event pairs, 0 based on Foata normal form. 27/1926 useless extension candidates. Maximal degree in co-relation 27045. Up to 1868 conditions per place. [2022-12-13 03:18:25,346 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 256 selfloop transitions, 38 changer transitions 66/375 dead transitions. [2022-12-13 03:18:25,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 375 transitions, 10268 flow [2022-12-13 03:18:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:18:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:18:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-13 03:18:25,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-13 03:18:25,348 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2022-12-13 03:18:25,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 375 transitions, 10268 flow [2022-12-13 03:18:25,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 309 transitions, 8393 flow [2022-12-13 03:18:25,387 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:25,387 INFO L89 Accepts]: Start accepts. Operand has 84 places, 309 transitions, 8393 flow [2022-12-13 03:18:25,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:25,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:25,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 309 transitions, 8393 flow [2022-12-13 03:18:25,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 309 transitions, 8393 flow [2022-12-13 03:18:25,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 816 [2022-12-13 03:18:25,402 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:25,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 03:18:25,404 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 309 transitions, 8393 flow [2022-12-13 03:18:25,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:25,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:25,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:25,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 03:18:25,405 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:18:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1269477111, now seen corresponding path program 1 times [2022-12-13 03:18:25,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:25,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909810445] [2022-12-13 03:18:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:18:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:25,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909810445] [2022-12-13 03:18:25,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909810445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:25,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:25,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:18:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497500689] [2022-12-13 03:18:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:25,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:18:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:25,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:18:25,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:18:25,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:18:25,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 309 transitions, 8393 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:25,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:25,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:18:25,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:26,106 INFO L130 PetriNetUnfolder]: 1224/2373 cut-off events. [2022-12-13 03:18:26,106 INFO L131 PetriNetUnfolder]: For 24716/24716 co-relation queries the response was YES. [2022-12-13 03:18:26,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29057 conditions, 2373 events. 1224/2373 cut-off events. For 24716/24716 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15460 event pairs, 0 based on Foata normal form. 27/2007 useless extension candidates. Maximal degree in co-relation 29007. Up to 2010 conditions per place. [2022-12-13 03:18:26,120 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 279 selfloop transitions, 19 changer transitions 83/396 dead transitions. [2022-12-13 03:18:26,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 396 transitions, 11603 flow [2022-12-13 03:18:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:18:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:18:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-13 03:18:26,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2022-12-13 03:18:26,122 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 17 predicate places. [2022-12-13 03:18:26,122 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 396 transitions, 11603 flow [2022-12-13 03:18:26,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 313 transitions, 9101 flow [2022-12-13 03:18:26,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:26,160 INFO L89 Accepts]: Start accepts. Operand has 87 places, 313 transitions, 9101 flow [2022-12-13 03:18:26,162 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:26,162 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:26,162 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 313 transitions, 9101 flow [2022-12-13 03:18:26,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 313 transitions, 9101 flow [2022-12-13 03:18:26,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-13 03:18:26,173 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:26,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 03:18:26,174 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 313 transitions, 9101 flow [2022-12-13 03:18:26,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:26,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:26,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:26,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 03:18:26,174 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:18:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1530018809, now seen corresponding path program 2 times [2022-12-13 03:18:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:26,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545728690] [2022-12-13 03:18:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:26,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:18:26,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:26,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545728690] [2022-12-13 03:18:26,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545728690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:26,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:26,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:18:26,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952635389] [2022-12-13 03:18:26,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:26,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:18:26,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:26,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:18:26,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:18:26,853 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:18:26,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 313 transitions, 9101 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:26,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:26,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:18:26,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:27,386 INFO L130 PetriNetUnfolder]: 1453/2746 cut-off events. [2022-12-13 03:18:27,386 INFO L131 PetriNetUnfolder]: For 30378/30378 co-relation queries the response was YES. [2022-12-13 03:18:27,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35548 conditions, 2746 events. 1453/2746 cut-off events. For 30378/30378 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 18115 event pairs, 0 based on Foata normal form. 54/2293 useless extension candidates. Maximal degree in co-relation 35495. Up to 2391 conditions per place. [2022-12-13 03:18:27,403 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 203 selfloop transitions, 49 changer transitions 144/411 dead transitions. [2022-12-13 03:18:27,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 411 transitions, 12833 flow [2022-12-13 03:18:27,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:18:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:18:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2022-12-13 03:18:27,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2022-12-13 03:18:27,405 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 21 predicate places. [2022-12-13 03:18:27,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 411 transitions, 12833 flow [2022-12-13 03:18:27,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 267 transitions, 8207 flow [2022-12-13 03:18:27,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:27,449 INFO L89 Accepts]: Start accepts. Operand has 93 places, 267 transitions, 8207 flow [2022-12-13 03:18:27,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:27,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:27,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 267 transitions, 8207 flow [2022-12-13 03:18:27,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 267 transitions, 8207 flow [2022-12-13 03:18:27,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 03:18:27,462 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:27,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 03:18:27,463 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 267 transitions, 8207 flow [2022-12-13 03:18:27,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:27,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:27,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:27,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 03:18:27,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:18:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash 760007733, now seen corresponding path program 3 times [2022-12-13 03:18:27,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:27,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454651540] [2022-12-13 03:18:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:27,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:18:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:41,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454651540] [2022-12-13 03:18:41,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454651540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:41,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:41,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:18:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064893246] [2022-12-13 03:18:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:41,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:18:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:41,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:18:41,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:18:41,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:18:41,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 267 transitions, 8207 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:41,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:41,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:18:41,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:41,911 INFO L130 PetriNetUnfolder]: 1263/2440 cut-off events. [2022-12-13 03:18:41,912 INFO L131 PetriNetUnfolder]: For 29242/29242 co-relation queries the response was YES. [2022-12-13 03:18:41,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33171 conditions, 2440 events. 1263/2440 cut-off events. For 29242/29242 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 16237 event pairs, 0 based on Foata normal form. 54/2027 useless extension candidates. Maximal degree in co-relation 33115. Up to 2141 conditions per place. [2022-12-13 03:18:41,944 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 248 selfloop transitions, 9 changer transitions 94/366 dead transitions. [2022-12-13 03:18:41,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 366 transitions, 12083 flow [2022-12-13 03:18:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:18:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:18:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-13 03:18:41,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2022-12-13 03:18:41,946 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 26 predicate places. [2022-12-13 03:18:41,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 366 transitions, 12083 flow [2022-12-13 03:18:41,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 272 transitions, 8887 flow [2022-12-13 03:18:41,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:41,994 INFO L89 Accepts]: Start accepts. Operand has 97 places, 272 transitions, 8887 flow [2022-12-13 03:18:41,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:41,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:41,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 272 transitions, 8887 flow [2022-12-13 03:18:42,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 272 transitions, 8887 flow [2022-12-13 03:18:42,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-13 03:18:42,007 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:42,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 03:18:42,007 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 272 transitions, 8887 flow [2022-12-13 03:18:42,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:42,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:42,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:42,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 03:18:42,008 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:18:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:42,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1320901971, now seen corresponding path program 4 times [2022-12-13 03:18:42,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:42,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747274170] [2022-12-13 03:18:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:42,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:18:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747274170] [2022-12-13 03:18:42,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747274170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:42,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:42,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:18:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114465192] [2022-12-13 03:18:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:42,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:18:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:42,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:18:42,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:18:42,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:18:42,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 272 transitions, 8887 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:42,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:42,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:18:42,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:42,986 INFO L130 PetriNetUnfolder]: 944/1825 cut-off events. [2022-12-13 03:18:42,986 INFO L131 PetriNetUnfolder]: For 26837/26837 co-relation queries the response was YES. [2022-12-13 03:18:42,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26282 conditions, 1825 events. 944/1825 cut-off events. For 26837/26837 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11306 event pairs, 0 based on Foata normal form. 27/1511 useless extension candidates. Maximal degree in co-relation 26223. Up to 1592 conditions per place. [2022-12-13 03:18:42,998 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 231 selfloop transitions, 34 changer transitions 69/349 dead transitions. [2022-12-13 03:18:42,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 349 transitions, 12173 flow [2022-12-13 03:18:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:18:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:18:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2022-12-13 03:18:43,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2022-12-13 03:18:43,017 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 32 predicate places. [2022-12-13 03:18:43,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 349 transitions, 12173 flow [2022-12-13 03:18:43,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 280 transitions, 9689 flow [2022-12-13 03:18:43,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:43,049 INFO L89 Accepts]: Start accepts. Operand has 103 places, 280 transitions, 9689 flow [2022-12-13 03:18:43,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:43,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:43,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 280 transitions, 9689 flow [2022-12-13 03:18:43,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 280 transitions, 9689 flow [2022-12-13 03:18:43,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 676 [2022-12-13 03:18:43,060 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:43,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:18:43,061 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 280 transitions, 9689 flow [2022-12-13 03:18:43,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:43,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:43,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:43,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 03:18:43,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:18:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2031738989, now seen corresponding path program 1 times [2022-12-13 03:18:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:43,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586696910] [2022-12-13 03:18:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:18:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586696910] [2022-12-13 03:18:43,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586696910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:43,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:43,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:18:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878843432] [2022-12-13 03:18:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:43,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:18:43,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:18:43,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:18:43,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:18:43,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 280 transitions, 9689 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:43,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:43,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:18:43,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:44,003 INFO L130 PetriNetUnfolder]: 1062/1992 cut-off events. [2022-12-13 03:18:44,003 INFO L131 PetriNetUnfolder]: For 33454/33454 co-relation queries the response was YES. [2022-12-13 03:18:44,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30343 conditions, 1992 events. 1062/1992 cut-off events. For 33454/33454 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 12284 event pairs, 0 based on Foata normal form. 54/1650 useless extension candidates. Maximal degree in co-relation 30281. Up to 1760 conditions per place. [2022-12-13 03:18:44,015 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 212 selfloop transitions, 30 changer transitions 94/351 dead transitions. [2022-12-13 03:18:44,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 351 transitions, 12923 flow [2022-12-13 03:18:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:18:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:18:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2022-12-13 03:18:44,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5362903225806451 [2022-12-13 03:18:44,017 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 38 predicate places. [2022-12-13 03:18:44,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 351 transitions, 12923 flow [2022-12-13 03:18:44,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 257 transitions, 9345 flow [2022-12-13 03:18:44,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:44,047 INFO L89 Accepts]: Start accepts. Operand has 110 places, 257 transitions, 9345 flow [2022-12-13 03:18:44,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:44,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:44,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 257 transitions, 9345 flow [2022-12-13 03:18:44,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 257 transitions, 9345 flow [2022-12-13 03:18:44,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-13 03:18:44,057 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:44,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 03:18:44,060 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 257 transitions, 9345 flow [2022-12-13 03:18:44,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:44,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:44,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:44,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 03:18:44,061 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:18:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2035515881, now seen corresponding path program 5 times [2022-12-13 03:18:44,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:44,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107979364] [2022-12-13 03:18:44,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:44,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:18:57,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:57,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107979364] [2022-12-13 03:18:57,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107979364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:57,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:57,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:18:57,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243145550] [2022-12-13 03:18:57,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:57,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:18:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:18:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:18:57,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:18:57,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 257 transitions, 9345 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:57,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:57,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:18:57,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:58,187 INFO L130 PetriNetUnfolder]: 1075/2057 cut-off events. [2022-12-13 03:18:58,187 INFO L131 PetriNetUnfolder]: For 34665/34665 co-relation queries the response was YES. [2022-12-13 03:18:58,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32164 conditions, 2057 events. 1075/2057 cut-off events. For 34665/34665 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 13355 event pairs, 0 based on Foata normal form. 54/1688 useless extension candidates. Maximal degree in co-relation 32099. Up to 1847 conditions per place. [2022-12-13 03:18:58,199 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 174 selfloop transitions, 26 changer transitions 128/343 dead transitions. [2022-12-13 03:18:58,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 343 transitions, 13269 flow [2022-12-13 03:18:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:18:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:18:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-12-13 03:18:58,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2022-12-13 03:18:58,207 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 46 predicate places. [2022-12-13 03:18:58,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 343 transitions, 13269 flow [2022-12-13 03:18:58,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 215 transitions, 8137 flow [2022-12-13 03:18:58,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:58,240 INFO L89 Accepts]: Start accepts. Operand has 116 places, 215 transitions, 8137 flow [2022-12-13 03:18:58,242 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:58,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:58,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 215 transitions, 8137 flow [2022-12-13 03:18:58,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 215 transitions, 8137 flow [2022-12-13 03:18:58,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 03:18:58,249 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:58,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:18:58,250 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 215 transitions, 8137 flow [2022-12-13 03:18:58,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:58,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:58,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:58,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 03:18:58,251 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:18:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1644734427, now seen corresponding path program 6 times [2022-12-13 03:18:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:58,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796739700] [2022-12-13 03:18:58,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:19:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:19:37,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:19:37,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796739700] [2022-12-13 03:19:37,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796739700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:19:37,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:19:37,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:19:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144858500] [2022-12-13 03:19:37,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:19:37,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:19:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:19:37,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:19:37,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:19:37,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:19:37,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 215 transitions, 8137 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:19:37,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:19:37,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:19:37,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:19:38,449 INFO L130 PetriNetUnfolder]: 630/1253 cut-off events. [2022-12-13 03:19:38,449 INFO L131 PetriNetUnfolder]: For 26516/26516 co-relation queries the response was YES. [2022-12-13 03:19:38,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20463 conditions, 1253 events. 630/1253 cut-off events. For 26516/26516 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7505 event pairs, 0 based on Foata normal form. 27/1041 useless extension candidates. Maximal degree in co-relation 20395. Up to 1074 conditions per place. [2022-12-13 03:19:38,457 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 160 selfloop transitions, 16 changer transitions 79/270 dead transitions. [2022-12-13 03:19:38,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 270 transitions, 10853 flow [2022-12-13 03:19:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 03:19:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 03:19:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2022-12-13 03:19:38,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5387096774193548 [2022-12-13 03:19:38,459 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 53 predicate places. [2022-12-13 03:19:38,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 270 transitions, 10853 flow [2022-12-13 03:19:38,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 191 transitions, 7535 flow [2022-12-13 03:19:38,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:19:38,479 INFO L89 Accepts]: Start accepts. Operand has 118 places, 191 transitions, 7535 flow [2022-12-13 03:19:38,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:19:38,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:19:38,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 191 transitions, 7535 flow [2022-12-13 03:19:38,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 191 transitions, 7535 flow [2022-12-13 03:19:38,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-13 03:19:38,486 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:19:38,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:19:38,486 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 191 transitions, 7535 flow [2022-12-13 03:19:38,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:19:38,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:19:38,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:19:38,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 03:19:38,487 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:19:38,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:19:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash 135405559, now seen corresponding path program 7 times [2022-12-13 03:19:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:19:38,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848229729] [2022-12-13 03:19:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:19:38,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:19:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:19:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:19:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:19:38,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848229729] [2022-12-13 03:19:38,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848229729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:19:38,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:19:38,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:19:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638154202] [2022-12-13 03:19:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:19:38,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:19:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:19:38,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:19:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:19:38,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:19:38,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 191 transitions, 7535 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:19:38,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:19:38,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:19:38,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:19:39,229 INFO L130 PetriNetUnfolder]: 483/950 cut-off events. [2022-12-13 03:19:39,230 INFO L131 PetriNetUnfolder]: For 23901/23901 co-relation queries the response was YES. [2022-12-13 03:19:39,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16452 conditions, 950 events. 483/950 cut-off events. For 23901/23901 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5058 event pairs, 0 based on Foata normal form. 27/793 useless extension candidates. Maximal degree in co-relation 16381. Up to 792 conditions per place. [2022-12-13 03:19:39,239 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 121 selfloop transitions, 35 changer transitions 74/245 dead transitions. [2022-12-13 03:19:39,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 245 transitions, 10263 flow [2022-12-13 03:19:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:19:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:19:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-13 03:19:39,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5529953917050692 [2022-12-13 03:19:39,243 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 52 predicate places. [2022-12-13 03:19:39,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 245 transitions, 10263 flow [2022-12-13 03:19:39,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 171 transitions, 6995 flow [2022-12-13 03:19:39,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:19:39,273 INFO L89 Accepts]: Start accepts. Operand has 124 places, 171 transitions, 6995 flow [2022-12-13 03:19:39,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:19:39,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:19:39,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 171 transitions, 6995 flow [2022-12-13 03:19:39,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 171 transitions, 6995 flow [2022-12-13 03:19:39,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 03:19:39,280 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:19:39,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:19:39,281 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 171 transitions, 6995 flow [2022-12-13 03:19:39,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:19:39,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:19:39,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:19:39,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 03:19:39,282 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:19:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:19:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash 629193831, now seen corresponding path program 8 times [2022-12-13 03:19:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:19:39,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569445231] [2022-12-13 03:19:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:19:39,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:19:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:19:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:19:52,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:19:52,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569445231] [2022-12-13 03:19:52,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569445231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:19:52,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:19:52,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:19:52,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157317876] [2022-12-13 03:19:52,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:19:52,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:19:52,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:19:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:19:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:19:52,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 03:19:52,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 171 transitions, 6995 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:19:52,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:19:52,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 03:19:52,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:19:53,077 INFO L130 PetriNetUnfolder]: 404/760 cut-off events. [2022-12-13 03:19:53,077 INFO L131 PetriNetUnfolder]: For 20291/20291 co-relation queries the response was YES. [2022-12-13 03:19:53,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14147 conditions, 760 events. 404/760 cut-off events. For 20291/20291 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3621 event pairs, 0 based on Foata normal form. 27/631 useless extension candidates. Maximal degree in co-relation 14073. Up to 637 conditions per place. [2022-12-13 03:19:53,089 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 101 selfloop transitions, 8 changer transitions 96/217 dead transitions. [2022-12-13 03:19:53,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 217 transitions, 9423 flow [2022-12-13 03:19:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:19:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:19:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-12-13 03:19:53,091 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45564516129032256 [2022-12-13 03:19:53,091 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 59 predicate places. [2022-12-13 03:19:53,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 217 transitions, 9423 flow [2022-12-13 03:19:53,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 121 transitions, 5109 flow [2022-12-13 03:19:53,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:19:53,105 INFO L89 Accepts]: Start accepts. Operand has 117 places, 121 transitions, 5109 flow [2022-12-13 03:19:53,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:19:53,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:19:53,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 121 transitions, 5109 flow [2022-12-13 03:19:53,113 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 121 transitions, 5109 flow [2022-12-13 03:19:53,113 INFO L226 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-13 03:19:53,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] $Ultimate##0-->L830: Formula: (let ((.cse3 (= (mod v_~y$r_buff1_thd3~0_140 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd3~0_148 256) 0))) (let ((.cse9 (not .cse8)) (.cse6 (and .cse8 .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_540 256) 0)) (.cse7 (and (= 0 (mod v_~y$w_buff1_used~0_513 256)) .cse8))) (let ((.cse10 (or .cse6 .cse12 .cse7)) (.cse11 (and (not .cse12) .cse9))) (let ((.cse2 (= (mod v_~y$w_buff1_used~0_512 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_539 256) 0)) (.cse5 (ite .cse10 v_~y~0_488 (ite .cse11 v_~y$w_buff0~0_359 v_~y$w_buff1~0_342))) (.cse0 (not (= (mod v_~weak$$choice2~0_194 256) 0)))) (and (= (ite .cse0 v_~y$r_buff1_thd3~0_140 (ite (let ((.cse1 (= (mod v_~y$r_buff0_thd3~0_147 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~y$r_buff1_thd3~0_140 0)) v_~y$r_buff1_thd3~0_139) (= v_~__unbuffered_p2_EBX~0_122 .cse5) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= v_~y$w_buff0~0_359 v_~y$w_buff0~0_358) (= (ite .cse0 v_~y$w_buff1_used~0_513 (ite (or .cse6 .cse7 .cse4) v_~y$w_buff1_used~0_513 0)) v_~y$w_buff1_used~0_512) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= (ite .cse0 v_~y$r_buff0_thd3~0_148 (ite (or .cse6 (and .cse2 .cse8) .cse4) v_~y$r_buff0_thd3~0_148 (ite (and (not .cse4) .cse9) 0 v_~y$r_buff0_thd3~0_148))) v_~y$r_buff0_thd3~0_147) (= v_~weak$$choice0~0_133 |v_P2Thread1of1ForFork0_#t~nondet5_22|) (= v_~y~0_487 (ite .cse0 v_~y$mem_tmp~0_164 .cse5)) (= v_~y$flush_delayed~0_183 0) (= v_~weak$$choice2~0_194 |v_P2Thread1of1ForFork0_#t~nondet6_22|) (= v_~y~0_488 v_~y$mem_tmp~0_164) (= v_~y$w_buff0_used~0_539 (ite .cse0 v_~y$w_buff0_used~0_540 (ite .cse10 v_~y$w_buff0_used~0_540 (ite .cse11 0 v_~y$w_buff0_used~0_540)))) (= v_~y$w_buff1~0_342 v_~y$w_buff1~0_341) (= v_~x~0_47 v_~__unbuffered_p2_EAX~0_119)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_140, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_540, ~y$w_buff1~0=v_~y$w_buff1~0_342, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_148, ~y$w_buff0~0=v_~y$w_buff0~0_359, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_22|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_22|, ~y~0=v_~y~0_488, ~x~0=v_~x~0_47, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_513} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_122, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_539, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~weak$$choice0~0=v_~weak$$choice0~0_133, ~y$mem_tmp~0=v_~y$mem_tmp~0_164, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_139, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_147, ~y$w_buff0~0=v_~y$w_buff0~0_358, ~y$flush_delayed~0=v_~y$flush_delayed~0_183, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_119, ~y~0=v_~y~0_487, ~weak$$choice2~0=v_~weak$$choice2~0_194, ~x~0=v_~x~0_47, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_512} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [467] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_240 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_240, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 03:19:53,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [552] $Ultimate##0-->L745: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd3~0_144 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd3~0_152 256) 0))) (let ((.cse7 (not .cse4)) (.cse3 (and .cse10 .cse4)) (.cse8 (and .cse4 (= (mod v_~y$w_buff1_used~0_517 256) 0))) (.cse11 (= (mod v_~y$w_buff0_used~0_544 256) 0))) (let ((.cse1 (or .cse3 .cse8 .cse11)) (.cse2 (and (not .cse11) .cse7)) (.cse0 (not (= (mod v_~weak$$choice2~0_196 256) 0))) (.cse5 (= (mod v_~y$w_buff1_used~0_516 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_543 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_544 (ite .cse1 v_~y$w_buff0_used~0_544 (ite .cse2 0 v_~y$w_buff0_used~0_544))) v_~y$w_buff0_used~0_543) (= v_~weak$$choice0~0_135 |v_P2Thread1of1ForFork0_#t~nondet5_26|) (= (ite .cse0 v_~y$r_buff0_thd3~0_152 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~y$r_buff0_thd3~0_152 (ite (and (not .cse6) .cse7) 0 v_~y$r_buff0_thd3~0_152))) v_~y$r_buff0_thd3~0_151) (= v_~y~0_493 v_~y$mem_tmp~0_166) (= v_~y~0_491 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= v_~y$w_buff0~0_363 v_~y$w_buff0~0_362) (= (ite .cse0 v_~y$w_buff1_used~0_517 (ite (or .cse3 .cse8 .cse6) v_~y$w_buff1_used~0_517 0)) v_~y$w_buff1_used~0_516) (= v_~x~0_49 v_~__unbuffered_p2_EAX~0_121) (= v_~y$w_buff1~0_346 v_~y$w_buff1~0_345) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~weak$$choice2~0_196 |v_P2Thread1of1ForFork0_#t~nondet6_26|) (= v_P0Thread1of1ForFork1_~arg.base_9 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= v_~__unbuffered_p2_EBX~0_124 (ite .cse1 v_~y~0_493 (ite .cse2 v_~y$w_buff0~0_363 v_~y$w_buff1~0_346))) (= (ite .cse0 v_~y$r_buff1_thd3~0_144 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_151 256) 0))) (or (and .cse9 .cse5) (and .cse10 .cse9) .cse6)) v_~y$r_buff1_thd3~0_144 0)) v_~y$r_buff1_thd3~0_143) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23) (= v_~y$flush_delayed~0_185 0))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_544, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_26|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_26|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_144, ~y$w_buff1~0=v_~y$w_buff1~0_346, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_152, ~y$w_buff0~0=v_~y$w_buff0~0_363, ~y~0=v_~y~0_493, ~x~0=v_~x~0_49, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_517} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_124, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_543, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9, ~weak$$choice0~0=v_~weak$$choice0~0_135, ~y$mem_tmp~0=v_~y$mem_tmp~0_166, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_143, ~y$w_buff1~0=v_~y$w_buff1~0_345, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y$w_buff0~0=v_~y$w_buff0~0_362, ~y$flush_delayed~0=v_~y$flush_delayed~0_185, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_121, ~y~0=v_~y~0_491, ~weak$$choice2~0=v_~weak$$choice2~0_196, ~x~0=v_~x~0_49, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_516} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, P0Thread1of1ForFork1_~arg.base, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [411] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_139 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_46 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_40 256) 0)))) (let ((.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_140 256) 0)) .cse5))) (and (= v_~y$r_buff0_thd3~0_45 (ite .cse0 0 v_~y$r_buff0_thd3~0_46)) (= v_~y~0_97 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse2 v_~y$w_buff1~0_51 v_~y~0_98))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_125) v_~y$w_buff1_used~0_124) (= v_~y$w_buff0_used~0_139 (ite .cse1 0 v_~y$w_buff0_used~0_140)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_45 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_40) v_~y$r_buff1_thd3~0_39)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_140, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_139, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_97, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 03:19:54,099 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:19:54,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 995 [2022-12-13 03:19:54,100 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 119 transitions, 5021 flow [2022-12-13 03:19:54,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:19:54,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:19:54,101 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:19:54,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 03:19:54,102 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:19:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:19:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1602940525, now seen corresponding path program 1 times [2022-12-13 03:19:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:19:54,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023142709] [2022-12-13 03:19:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:19:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:19:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:19:54,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:19:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:19:54,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:19:54,329 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:19:54,331 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 03:19:54,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 03:19:54,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 03:19:54,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 03:19:54,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 03:19:54,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 03:19:54,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 03:19:54,334 INFO L445 BasicCegarLoop]: Path program histogram: [8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:19:54,340 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:19:54,340 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:19:54,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:19:54 BasicIcfg [2022-12-13 03:19:54,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:19:54,410 INFO L158 Benchmark]: Toolchain (without parser) took 164426.73ms. Allocated memory was 181.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 157.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 410.6MB. Max. memory is 8.0GB. [2022-12-13 03:19:54,410 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:19:54,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.08ms. Allocated memory is still 181.4MB. Free memory was 156.6MB in the beginning and 127.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 03:19:54,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.09ms. Allocated memory is still 181.4MB. Free memory was 127.2MB in the beginning and 124.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 03:19:54,411 INFO L158 Benchmark]: Boogie Preprocessor took 36.78ms. Allocated memory is still 181.4MB. Free memory was 124.0MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:19:54,422 INFO L158 Benchmark]: RCFGBuilder took 677.21ms. Allocated memory is still 181.4MB. Free memory was 122.0MB in the beginning and 72.7MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-12-13 03:19:54,422 INFO L158 Benchmark]: TraceAbstraction took 163146.79ms. Allocated memory was 181.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 71.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 325.7MB. Max. memory is 8.0GB. [2022-12-13 03:19:54,423 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 504.08ms. Allocated memory is still 181.4MB. Free memory was 156.6MB in the beginning and 127.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.09ms. Allocated memory is still 181.4MB. Free memory was 127.2MB in the beginning and 124.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.78ms. Allocated memory is still 181.4MB. Free memory was 124.0MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 677.21ms. Allocated memory is still 181.4MB. Free memory was 122.0MB in the beginning and 72.7MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * TraceAbstraction took 163146.79ms. Allocated memory was 181.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 71.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 325.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 114 PlacesBefore, 72 PlacesAfterwards, 106 TransitionsBefore, 63 TransitionsAfterwards, 2022 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 2892, independent unconditional: 0, dependent: 127, dependent conditional: 127, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1819, independent: 1761, independent conditional: 0, independent unconditional: 1761, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1819, independent: 1746, independent conditional: 0, independent unconditional: 1746, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 399, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3019, independent: 1131, independent conditional: 0, independent unconditional: 1131, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 1819, unknown conditional: 0, unknown unconditional: 1819] , Statistics on independence cache: Total cache size (in pairs): 3487, Positive cache size: 3429, Positive conditional cache size: 0, Positive unconditional cache size: 3429, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, 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, 45 PlacesBefore, 45 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 21, independent conditional: 21, 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: 22, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 73 TransitionsBefore, 73 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 48, independent conditional: 48, 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: 51, independent: 48, independent conditional: 18, independent unconditional: 30, 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: 51, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 52 PlacesBefore, 52 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 772 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): 44, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 58 PlacesBefore, 59 PlacesAfterwards, 196 TransitionsBefore, 198 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 47, Positive cache size: 45, Positive conditional cache size: 1, Positive unconditional cache size: 44, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 658 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 45, Positive conditional cache size: 1, Positive unconditional cache size: 44, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 64 PlacesBefore, 63 PlacesAfterwards, 200 TransitionsBefore, 199 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 308 TransitionsBefore, 308 TransitionsAfterwards, 894 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 263 TransitionsBefore, 263 TransitionsAfterwards, 784 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 374 TransitionsBefore, 374 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 344 TransitionsBefore, 344 TransitionsAfterwards, 960 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 309 TransitionsBefore, 309 TransitionsAfterwards, 816 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 313 TransitionsBefore, 313 TransitionsAfterwards, 820 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 267 TransitionsBefore, 267 TransitionsAfterwards, 666 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 272 TransitionsBefore, 272 TransitionsAfterwards, 660 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 280 TransitionsBefore, 280 TransitionsAfterwards, 676 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 110 PlacesBefore, 110 PlacesAfterwards, 257 TransitionsBefore, 257 TransitionsAfterwards, 598 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 116 PlacesBefore, 116 PlacesAfterwards, 215 TransitionsBefore, 215 TransitionsAfterwards, 478 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 118 PlacesBefore, 118 PlacesAfterwards, 191 TransitionsBefore, 191 TransitionsAfterwards, 426 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 124 PlacesBefore, 124 PlacesAfterwards, 171 TransitionsBefore, 171 TransitionsAfterwards, 372 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): 48, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 117 PlacesBefore, 113 PlacesAfterwards, 121 TransitionsBefore, 119 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 51, Positive conditional cache size: 1, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 [L744] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 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: 163.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 996 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 996 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3013 IncrementalHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 1 mSDtfsCounter, 3013 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9689occurred in iteration=17, InterpolantAutomatonStates: 135, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 133.9s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 5302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2022-12-13 03:19:54,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...