/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:20:04,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:20:04,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:20:04,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:20:04,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:20:04,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:20:04,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:20:04,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:20:04,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:20:04,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:20:04,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:20:04,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:20:04,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:20:04,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:20:04,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:20:04,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:20:04,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:20:04,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:20:04,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:20:04,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:20:04,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:20:04,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:20:04,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:20:04,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:20:04,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:20:04,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:20:04,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:20:04,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:20:04,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:20:04,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:20:04,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:20:04,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:20:04,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:20:04,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:20:04,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:20:04,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:20:04,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:20:04,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:20:04,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:20:04,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:20:04,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:20:04,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:20:04,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:20:04,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:20:04,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:20:04,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:20:04,505 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:20:04,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:20:04,505 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:20:04,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:20:04,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:20:04,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:20:04,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:20:04,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:20:04,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:20:04,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:20:04,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:20:04,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:20:04,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:20:04,507 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:20:04,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:20:04,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:20:04,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:20:04,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:20:04,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:20:04,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:20:04,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:20:04,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:20:04,796 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:20:04,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-12-13 09:20:05,805 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:20:06,007 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:20:06,007 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-12-13 09:20:06,017 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8262288ba/cc0438476f334e82b181fcc0c783811b/FLAG6ae167c2e [2022-12-13 09:20:06,034 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8262288ba/cc0438476f334e82b181fcc0c783811b [2022-12-13 09:20:06,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:20:06,036 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:20:06,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:20:06,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:20:06,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:20:06,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11866c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06, skipping insertion in model container [2022-12-13 09:20:06,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:20:06,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:20:06,255 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/mix016_power.opt_rmo.opt.i[1001,1014] [2022-12-13 09:20:06,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:20:06,452 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:20:06,462 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/mix016_power.opt_rmo.opt.i[1001,1014] [2022-12-13 09:20:06,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:06,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:06,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:20:06,536 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:20:06,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06 WrapperNode [2022-12-13 09:20:06,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:20:06,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:20:06,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:20:06,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:20:06,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,590 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-13 09:20:06,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:20:06,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:20:06,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:20:06,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:20:06,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,608 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:20:06,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:20:06,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:20:06,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:20:06,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (1/1) ... [2022-12-13 09:20:06,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:20:06,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:20:06,676 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 09:20:06,691 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 09:20:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:20:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:20:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:20:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:20:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:20:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:20:06,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:20:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:20:06,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:20:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:20:06,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:20:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:20:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:20:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:20:06,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:20:06,705 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 09:20:06,826 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:20:06,828 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:20:07,079 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:20:07,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:20:07,158 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:20:07,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:07 BoogieIcfgContainer [2022-12-13 09:20:07,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:20:07,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:20:07,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:20:07,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:20:07,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:20:06" (1/3) ... [2022-12-13 09:20:07,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea84715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:07, skipping insertion in model container [2022-12-13 09:20:07,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:06" (2/3) ... [2022-12-13 09:20:07,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea84715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:07, skipping insertion in model container [2022-12-13 09:20:07,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:07" (3/3) ... [2022-12-13 09:20:07,165 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i [2022-12-13 09:20:07,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:20:07,178 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:20:07,178 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:20:07,244 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:20:07,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 09:20:07,327 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 09:20:07,327 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:07,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 09:20:07,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 09:20:07,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-13 09:20:07,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:07,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 09:20:07,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-13 09:20:07,375 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 09:20:07,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:07,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 09:20:07,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 09:20:07,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 1876 [2022-12-13 09:20:11,311 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 09:20:11,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:20:11,326 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;@dbd3d4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:20:11,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:20:11,328 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 09:20:11,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:11,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:11,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:20:11,329 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 09:20:11,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash 467875747, now seen corresponding path program 1 times [2022-12-13 09:20:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:11,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282411512] [2022-12-13 09:20:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:11,633 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 09:20:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:11,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282411512] [2022-12-13 09:20:11,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282411512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:11,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:11,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:20:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651550569] [2022-12-13 09:20:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:11,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:11,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:11,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:11,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:11,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 61 [2022-12-13 09:20:11,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 09:20:11,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:11,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 61 [2022-12-13 09:20:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:12,588 INFO L130 PetriNetUnfolder]: 7624/12269 cut-off events. [2022-12-13 09:20:12,589 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 09:20:12,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23246 conditions, 12269 events. 7624/12269 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 90675 event pairs, 1008 based on Foata normal form. 0/7522 useless extension candidates. Maximal degree in co-relation 23235. Up to 9237 conditions per place. [2022-12-13 09:20:12,626 INFO L137 encePairwiseOnDemand]: 56/61 looper letters, 32 selfloop transitions, 2 changer transitions 50/96 dead transitions. [2022-12-13 09:20:12,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 372 flow [2022-12-13 09:20:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-12-13 09:20:12,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6830601092896175 [2022-12-13 09:20:12,636 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 3 states and 125 transitions. [2022-12-13 09:20:12,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 372 flow [2022-12-13 09:20:12,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 368 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:20:12,641 INFO L231 Difference]: Finished difference. Result has 67 places, 33 transitions, 76 flow [2022-12-13 09:20:12,643 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=67, PETRI_TRANSITIONS=33} [2022-12-13 09:20:12,647 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2022-12-13 09:20:12,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:12,648 INFO L89 Accepts]: Start accepts. Operand has 67 places, 33 transitions, 76 flow [2022-12-13 09:20:12,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:12,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:12,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 33 transitions, 76 flow [2022-12-13 09:20:12,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 09:20:12,661 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 09:20:12,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:12,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:20:12,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 09:20:12,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 09:20:12,771 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:12,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 09:20:12,772 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 09:20:12,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 09:20:12,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:12,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:12,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:20:12,773 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 09:20:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2076140133, now seen corresponding path program 1 times [2022-12-13 09:20:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:12,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408671326] [2022-12-13 09:20:12,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:12,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:13,014 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 09:20:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:13,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408671326] [2022-12-13 09:20:13,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408671326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:13,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:13,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:20:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040579399] [2022-12-13 09:20:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:13,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:20:13,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 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 09:20:13,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:13,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:20:13,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:13,316 INFO L130 PetriNetUnfolder]: 2488/3806 cut-off events. [2022-12-13 09:20:13,317 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-13 09:20:13,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7664 conditions, 3806 events. 2488/3806 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 19161 event pairs, 1087 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 7654. Up to 3506 conditions per place. [2022-12-13 09:20:13,331 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 32 selfloop transitions, 4 changer transitions 2/46 dead transitions. [2022-12-13 09:20:13,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 184 flow [2022-12-13 09:20:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 09:20:13,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 09:20:13,334 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 63 transitions. [2022-12-13 09:20:13,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 184 flow [2022-12-13 09:20:13,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:13,336 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 96 flow [2022-12-13 09:20:13,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 09:20:13,337 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -27 predicate places. [2022-12-13 09:20:13,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:13,337 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 96 flow [2022-12-13 09:20:13,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:13,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:13,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 96 flow [2022-12-13 09:20:13,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 96 flow [2022-12-13 09:20:13,348 INFO L130 PetriNetUnfolder]: 14/93 cut-off events. [2022-12-13 09:20:13,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:13,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 93 events. 14/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 366 event pairs, 6 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 126. Up to 29 conditions per place. [2022-12-13 09:20:13,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 96 flow [2022-12-13 09:20:13,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 09:20:13,411 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:13,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 09:20:13,412 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 96 flow [2022-12-13 09:20:13,412 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 09:20:13,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:13,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:13,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:20:13,414 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 09:20:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash -847654052, now seen corresponding path program 1 times [2022-12-13 09:20:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:13,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003143242] [2022-12-13 09:20:13,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:13,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:13,554 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 09:20:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:13,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003143242] [2022-12-13 09:20:13,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003143242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:13,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:13,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:20:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183294439] [2022-12-13 09:20:13,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:13,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:13,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:13,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 09:20:13,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 09:20:13,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:13,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 09:20:13,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:13,778 INFO L130 PetriNetUnfolder]: 1481/2412 cut-off events. [2022-12-13 09:20:13,778 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-13 09:20:13,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 2412 events. 1481/2412 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12564 event pairs, 471 based on Foata normal form. 52/2062 useless extension candidates. Maximal degree in co-relation 5078. Up to 1537 conditions per place. [2022-12-13 09:20:13,788 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 31 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 09:20:13,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 186 flow [2022-12-13 09:20:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 09:20:13,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 09:20:13,790 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 96 flow. Second operand 3 states and 63 transitions. [2022-12-13 09:20:13,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 186 flow [2022-12-13 09:20:13,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:20:13,791 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 103 flow [2022-12-13 09:20:13,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-13 09:20:13,792 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2022-12-13 09:20:13,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:13,792 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 103 flow [2022-12-13 09:20:13,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:13,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:13,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 103 flow [2022-12-13 09:20:13,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 103 flow [2022-12-13 09:20:13,798 INFO L130 PetriNetUnfolder]: 9/66 cut-off events. [2022-12-13 09:20:13,798 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-13 09:20:13,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 66 events. 9/66 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 240 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 100. Up to 21 conditions per place. [2022-12-13 09:20:13,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 103 flow [2022-12-13 09:20:13,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 09:20:13,809 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:13,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 09:20:13,813 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 103 flow [2022-12-13 09:20:13,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 09:20:13,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:13,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:20:13,813 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 09:20:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1956113731, now seen corresponding path program 1 times [2022-12-13 09:20:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:13,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685030844] [2022-12-13 09:20:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:13,957 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 09:20:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:13,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685030844] [2022-12-13 09:20:13,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685030844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:13,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:13,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884103150] [2022-12-13 09:20:13,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:13,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:13,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:13,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:13,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:13,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:20:13,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:13,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:13,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:20:13,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:14,223 INFO L130 PetriNetUnfolder]: 2314/3638 cut-off events. [2022-12-13 09:20:14,223 INFO L131 PetriNetUnfolder]: For 394/409 co-relation queries the response was YES. [2022-12-13 09:20:14,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 3638 events. 2314/3638 cut-off events. For 394/409 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 20952 event pairs, 186 based on Foata normal form. 272/2727 useless extension candidates. Maximal degree in co-relation 7965. Up to 1972 conditions per place. [2022-12-13 09:20:14,235 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 49 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2022-12-13 09:20:14,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 301 flow [2022-12-13 09:20:14,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:20:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:20:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 09:20:14,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7265625 [2022-12-13 09:20:14,237 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 103 flow. Second operand 4 states and 93 transitions. [2022-12-13 09:20:14,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 301 flow [2022-12-13 09:20:14,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:14,238 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 183 flow [2022-12-13 09:20:14,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2022-12-13 09:20:14,239 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2022-12-13 09:20:14,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:14,239 INFO L89 Accepts]: Start accepts. Operand has 47 places, 45 transitions, 183 flow [2022-12-13 09:20:14,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:14,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:14,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 45 transitions, 183 flow [2022-12-13 09:20:14,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 45 transitions, 183 flow [2022-12-13 09:20:14,277 INFO L130 PetriNetUnfolder]: 437/876 cut-off events. [2022-12-13 09:20:14,278 INFO L131 PetriNetUnfolder]: For 146/173 co-relation queries the response was YES. [2022-12-13 09:20:14,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 876 events. 437/876 cut-off events. For 146/173 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 5853 event pairs, 169 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1939. Up to 712 conditions per place. [2022-12-13 09:20:14,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 45 transitions, 183 flow [2022-12-13 09:20:14,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 09:20:14,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:14,455 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-13 09:20:14,455 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 185 flow [2022-12-13 09:20:14,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:14,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:14,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:14,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:20:14,456 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 09:20:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1148978079, now seen corresponding path program 1 times [2022-12-13 09:20:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:14,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681614038] [2022-12-13 09:20:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:14,601 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 09:20:14,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:14,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681614038] [2022-12-13 09:20:14,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681614038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:14,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:14,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:20:14,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958641601] [2022-12-13 09:20:14,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:14,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:20:14,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:14,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:20:14,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:20:14,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:20:14,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:14,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:14,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:20:14,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:14,845 INFO L130 PetriNetUnfolder]: 1315/2308 cut-off events. [2022-12-13 09:20:14,845 INFO L131 PetriNetUnfolder]: For 712/712 co-relation queries the response was YES. [2022-12-13 09:20:14,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 2308 events. 1315/2308 cut-off events. For 712/712 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13646 event pairs, 63 based on Foata normal form. 231/1835 useless extension candidates. Maximal degree in co-relation 6892. Up to 1114 conditions per place. [2022-12-13 09:20:14,855 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 57 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2022-12-13 09:20:14,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 87 transitions, 470 flow [2022-12-13 09:20:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:20:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:20:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-13 09:20:14,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2022-12-13 09:20:14,859 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 185 flow. Second operand 5 states and 118 transitions. [2022-12-13 09:20:14,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 87 transitions, 470 flow [2022-12-13 09:20:14,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 454 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:14,865 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 296 flow [2022-12-13 09:20:14,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2022-12-13 09:20:14,866 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -19 predicate places. [2022-12-13 09:20:14,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:14,867 INFO L89 Accepts]: Start accepts. Operand has 51 places, 54 transitions, 296 flow [2022-12-13 09:20:14,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:14,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:14,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 54 transitions, 296 flow [2022-12-13 09:20:14,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 54 transitions, 296 flow [2022-12-13 09:20:14,903 INFO L130 PetriNetUnfolder]: 302/716 cut-off events. [2022-12-13 09:20:14,904 INFO L131 PetriNetUnfolder]: For 348/402 co-relation queries the response was YES. [2022-12-13 09:20:14,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 716 events. 302/716 cut-off events. For 348/402 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 5078 event pairs, 37 based on Foata normal form. 4/373 useless extension candidates. Maximal degree in co-relation 2312. Up to 544 conditions per place. [2022-12-13 09:20:14,908 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 54 transitions, 296 flow [2022-12-13 09:20:14,908 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 09:20:15,075 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:15,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-13 09:20:15,076 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 300 flow [2022-12-13 09:20:15,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:15,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:15,077 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 09:20:15,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:20:15,077 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 09:20:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1207551117, now seen corresponding path program 1 times [2022-12-13 09:20:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:15,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773629455] [2022-12-13 09:20:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:15,236 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 09:20:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:15,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773629455] [2022-12-13 09:20:15,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773629455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:15,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:15,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112974392] [2022-12-13 09:20:15,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:15,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:15,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:20:15,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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 09:20:15,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:15,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:20:15,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:15,514 INFO L130 PetriNetUnfolder]: 1391/2588 cut-off events. [2022-12-13 09:20:15,515 INFO L131 PetriNetUnfolder]: For 2973/3325 co-relation queries the response was YES. [2022-12-13 09:20:15,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9505 conditions, 2588 events. 1391/2588 cut-off events. For 2973/3325 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16426 event pairs, 173 based on Foata normal form. 231/2397 useless extension candidates. Maximal degree in co-relation 9488. Up to 1462 conditions per place. [2022-12-13 09:20:15,526 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 83 selfloop transitions, 11 changer transitions 4/112 dead transitions. [2022-12-13 09:20:15,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 112 transitions, 797 flow [2022-12-13 09:20:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:20:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:20:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-13 09:20:15,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2022-12-13 09:20:15,528 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 300 flow. Second operand 5 states and 109 transitions. [2022-12-13 09:20:15,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 112 transitions, 797 flow [2022-12-13 09:20:15,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 112 transitions, 685 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-13 09:20:15,541 INFO L231 Difference]: Finished difference. Result has 53 places, 59 transitions, 304 flow [2022-12-13 09:20:15,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=53, PETRI_TRANSITIONS=59} [2022-12-13 09:20:15,542 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2022-12-13 09:20:15,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:15,542 INFO L89 Accepts]: Start accepts. Operand has 53 places, 59 transitions, 304 flow [2022-12-13 09:20:15,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:15,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:15,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 59 transitions, 304 flow [2022-12-13 09:20:15,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 59 transitions, 304 flow [2022-12-13 09:20:15,597 INFO L130 PetriNetUnfolder]: 381/907 cut-off events. [2022-12-13 09:20:15,597 INFO L131 PetriNetUnfolder]: For 365/457 co-relation queries the response was YES. [2022-12-13 09:20:15,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 907 events. 381/907 cut-off events. For 365/457 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 6504 event pairs, 55 based on Foata normal form. 5/521 useless extension candidates. Maximal degree in co-relation 2559. Up to 649 conditions per place. [2022-12-13 09:20:15,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 59 transitions, 304 flow [2022-12-13 09:20:15,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 840 [2022-12-13 09:20:15,676 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:15,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 09:20:15,677 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 304 flow [2022-12-13 09:20:15,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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 09:20:15,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:15,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:15,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:20:15,678 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 09:20:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1997026936, now seen corresponding path program 1 times [2022-12-13 09:20:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:15,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577005713] [2022-12-13 09:20:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:15,786 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 09:20:15,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:15,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577005713] [2022-12-13 09:20:15,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577005713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:15,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:15,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:15,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961139082] [2022-12-13 09:20:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:15,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:15,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:15,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 09:20:15,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:15,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:15,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 09:20:15,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:16,086 INFO L130 PetriNetUnfolder]: 1711/3225 cut-off events. [2022-12-13 09:20:16,086 INFO L131 PetriNetUnfolder]: For 3104/3325 co-relation queries the response was YES. [2022-12-13 09:20:16,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10822 conditions, 3225 events. 1711/3225 cut-off events. For 3104/3325 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 22222 event pairs, 264 based on Foata normal form. 199/2843 useless extension candidates. Maximal degree in co-relation 10804. Up to 1595 conditions per place. [2022-12-13 09:20:16,104 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 59 selfloop transitions, 3 changer transitions 21/102 dead transitions. [2022-12-13 09:20:16,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 102 transitions, 672 flow [2022-12-13 09:20:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:20:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:20:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 09:20:16,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2022-12-13 09:20:16,106 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 304 flow. Second operand 4 states and 92 transitions. [2022-12-13 09:20:16,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 102 transitions, 672 flow [2022-12-13 09:20:16,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 102 transitions, 670 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 09:20:16,110 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 288 flow [2022-12-13 09:20:16,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2022-12-13 09:20:16,111 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2022-12-13 09:20:16,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:16,111 INFO L89 Accepts]: Start accepts. Operand has 57 places, 56 transitions, 288 flow [2022-12-13 09:20:16,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:16,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:16,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 56 transitions, 288 flow [2022-12-13 09:20:16,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 288 flow [2022-12-13 09:20:16,164 INFO L130 PetriNetUnfolder]: 385/972 cut-off events. [2022-12-13 09:20:16,164 INFO L131 PetriNetUnfolder]: For 602/645 co-relation queries the response was YES. [2022-12-13 09:20:16,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 972 events. 385/972 cut-off events. For 602/645 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 7398 event pairs, 64 based on Foata normal form. 7/550 useless extension candidates. Maximal degree in co-relation 2796. Up to 703 conditions per place. [2022-12-13 09:20:16,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 56 transitions, 288 flow [2022-12-13 09:20:16,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 764 [2022-12-13 09:20:16,196 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:16,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 09:20:16,197 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 288 flow [2022-12-13 09:20:16,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:16,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:16,197 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 09:20:16,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:20:16,197 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 09:20:16,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1648228094, now seen corresponding path program 1 times [2022-12-13 09:20:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:16,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683841492] [2022-12-13 09:20:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:16,333 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 09:20:16,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:16,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683841492] [2022-12-13 09:20:16,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683841492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:16,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:16,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:20:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276847615] [2022-12-13 09:20:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:16,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:20:16,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:20:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:20:16,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:20:16,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 09:20:16,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:16,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:20:16,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:16,642 INFO L130 PetriNetUnfolder]: 2120/4053 cut-off events. [2022-12-13 09:20:16,642 INFO L131 PetriNetUnfolder]: For 5132/5431 co-relation queries the response was YES. [2022-12-13 09:20:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14011 conditions, 4053 events. 2120/4053 cut-off events. For 5132/5431 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 29375 event pairs, 519 based on Foata normal form. 255/3580 useless extension candidates. Maximal degree in co-relation 13991. Up to 2068 conditions per place. [2022-12-13 09:20:16,656 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 66 selfloop transitions, 9 changer transitions 20/109 dead transitions. [2022-12-13 09:20:16,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 747 flow [2022-12-13 09:20:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:20:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:20:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-13 09:20:16,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-13 09:20:16,658 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 288 flow. Second operand 6 states and 112 transitions. [2022-12-13 09:20:16,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 747 flow [2022-12-13 09:20:16,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 731 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 09:20:16,663 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 321 flow [2022-12-13 09:20:16,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-13 09:20:16,663 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2022-12-13 09:20:16,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:16,664 INFO L89 Accepts]: Start accepts. Operand has 61 places, 59 transitions, 321 flow [2022-12-13 09:20:16,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:16,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:16,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 59 transitions, 321 flow [2022-12-13 09:20:16,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 321 flow [2022-12-13 09:20:16,743 INFO L130 PetriNetUnfolder]: 702/1637 cut-off events. [2022-12-13 09:20:16,743 INFO L131 PetriNetUnfolder]: For 723/898 co-relation queries the response was YES. [2022-12-13 09:20:16,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4699 conditions, 1637 events. 702/1637 cut-off events. For 723/898 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 13652 event pairs, 118 based on Foata normal form. 9/876 useless extension candidates. Maximal degree in co-relation 4680. Up to 1270 conditions per place. [2022-12-13 09:20:16,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 59 transitions, 321 flow [2022-12-13 09:20:16,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-13 09:20:16,791 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [360] $Ultimate##0-->L806: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y~0_7 1)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y~0] and [327] L786-->L789: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 09:20:16,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:16,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-13 09:20:16,847 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 319 flow [2022-12-13 09:20:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 09:20:16,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:16,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:20:16,847 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 09:20:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1679116534, now seen corresponding path program 1 times [2022-12-13 09:20:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064574944] [2022-12-13 09:20:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:16,982 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 09:20:16,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:16,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064574944] [2022-12-13 09:20:16,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064574944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:16,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:16,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:20:16,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164194758] [2022-12-13 09:20:16,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:16,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:20:16,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:16,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:20:16,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:20:16,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 09:20:16,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:16,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:16,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 09:20:16,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:17,238 INFO L130 PetriNetUnfolder]: 1508/3033 cut-off events. [2022-12-13 09:20:17,238 INFO L131 PetriNetUnfolder]: For 2237/2248 co-relation queries the response was YES. [2022-12-13 09:20:17,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10109 conditions, 3033 events. 1508/3033 cut-off events. For 2237/2248 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 22060 event pairs, 73 based on Foata normal form. 405/2337 useless extension candidates. Maximal degree in co-relation 10087. Up to 1378 conditions per place. [2022-12-13 09:20:17,246 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 24 selfloop transitions, 29 changer transitions 18/77 dead transitions. [2022-12-13 09:20:17,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 514 flow [2022-12-13 09:20:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:20:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:20:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-13 09:20:17,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.553921568627451 [2022-12-13 09:20:17,247 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 319 flow. Second operand 6 states and 113 transitions. [2022-12-13 09:20:17,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 514 flow [2022-12-13 09:20:17,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 501 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:17,251 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 326 flow [2022-12-13 09:20:17,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2022-12-13 09:20:17,252 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2022-12-13 09:20:17,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:17,252 INFO L89 Accepts]: Start accepts. Operand has 65 places, 48 transitions, 326 flow [2022-12-13 09:20:17,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:17,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:17,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 48 transitions, 326 flow [2022-12-13 09:20:17,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 326 flow [2022-12-13 09:20:17,268 INFO L130 PetriNetUnfolder]: 91/268 cut-off events. [2022-12-13 09:20:17,269 INFO L131 PetriNetUnfolder]: For 271/283 co-relation queries the response was YES. [2022-12-13 09:20:17,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 268 events. 91/268 cut-off events. For 271/283 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1509 event pairs, 1 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 1077. Up to 181 conditions per place. [2022-12-13 09:20:17,270 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 48 transitions, 326 flow [2022-12-13 09:20:17,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-13 09:20:17,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L819-->L822: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:17,550 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] L819-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P2Thread1of1ForFork1_#res.base_9| 0) (= |v_P2Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:17,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [434] L819-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:17,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L796-->L799: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:17,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L796-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:17,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] L796-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.base_9| 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1)) (= |v_P1Thread1of1ForFork0_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_9|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:17,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L765-->L770: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:17,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [348] L765-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P0Thread1of1ForFork2_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:17,656 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L765-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P0Thread1of1ForFork2_#res.offset_13| 0) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [395] L841-3-->L844: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_49) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-13 09:20:19,669 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 09:20:19,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2418 [2022-12-13 09:20:19,670 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 368 flow [2022-12-13 09:20:19,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:19,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:19,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:19,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:20:19,671 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 09:20:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash -968642524, now seen corresponding path program 1 times [2022-12-13 09:20:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:19,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663736320] [2022-12-13 09:20:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:19,993 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 09:20:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:19,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663736320] [2022-12-13 09:20:19,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663736320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:19,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:19,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:20:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126190534] [2022-12-13 09:20:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:19,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:20:19,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:19,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:20:19,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:20:19,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 09:20:19,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 09:20:19,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:19,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 09:20:19,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:20,187 INFO L130 PetriNetUnfolder]: 323/617 cut-off events. [2022-12-13 09:20:20,187 INFO L131 PetriNetUnfolder]: For 2172/2208 co-relation queries the response was YES. [2022-12-13 09:20:20,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3116 conditions, 617 events. 323/617 cut-off events. For 2172/2208 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3314 event pairs, 0 based on Foata normal form. 45/469 useless extension candidates. Maximal degree in co-relation 3092. Up to 364 conditions per place. [2022-12-13 09:20:20,190 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 45 selfloop transitions, 5 changer transitions 25/83 dead transitions. [2022-12-13 09:20:20,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 807 flow [2022-12-13 09:20:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:20:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:20:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-13 09:20:20,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-13 09:20:20,191 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 368 flow. Second operand 7 states and 105 transitions. [2022-12-13 09:20:20,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 807 flow [2022-12-13 09:20:20,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 495 flow, removed 42 selfloop flow, removed 12 redundant places. [2022-12-13 09:20:20,198 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 220 flow [2022-12-13 09:20:20,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-13 09:20:20,198 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2022-12-13 09:20:20,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:20,198 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 220 flow [2022-12-13 09:20:20,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:20,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:20,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 220 flow [2022-12-13 09:20:20,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 220 flow [2022-12-13 09:20:20,217 INFO L130 PetriNetUnfolder]: 110/233 cut-off events. [2022-12-13 09:20:20,217 INFO L131 PetriNetUnfolder]: For 155/156 co-relation queries the response was YES. [2022-12-13 09:20:20,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 233 events. 110/233 cut-off events. For 155/156 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1125 event pairs, 1 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 612. Up to 108 conditions per place. [2022-12-13 09:20:20,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 220 flow [2022-12-13 09:20:20,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-13 09:20:20,219 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:20,219 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 09:20:20,219 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 220 flow [2022-12-13 09:20:20,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 09:20:20,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:20,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:20,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:20:20,220 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 09:20:20,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1871807856, now seen corresponding path program 1 times [2022-12-13 09:20:20,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:20,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899707802] [2022-12-13 09:20:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:20,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:20:20,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:20:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:20:20,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:20:20,287 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:20:20,287 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:20:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:20:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:20:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:20:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:20:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:20:20,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:20:20,290 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:20,295 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:20:20,295 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:20:20,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:20:20 BasicIcfg [2022-12-13 09:20:20,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:20:20,362 INFO L158 Benchmark]: Toolchain (without parser) took 14325.83ms. Allocated memory was 207.6MB in the beginning and 675.3MB in the end (delta: 467.7MB). Free memory was 183.3MB in the beginning and 463.4MB in the end (delta: -280.2MB). Peak memory consumption was 188.0MB. Max. memory is 8.0GB. [2022-12-13 09:20:20,362 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 183.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:20:20,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.13ms. Allocated memory is still 207.6MB. Free memory was 182.7MB in the beginning and 157.0MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:20:20,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.69ms. Allocated memory is still 207.6MB. Free memory was 156.5MB in the beginning and 154.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:20:20,363 INFO L158 Benchmark]: Boogie Preprocessor took 24.93ms. Allocated memory is still 207.6MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:20:20,363 INFO L158 Benchmark]: RCFGBuilder took 542.18ms. Allocated memory is still 207.6MB. Free memory was 152.3MB in the beginning and 120.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 09:20:20,363 INFO L158 Benchmark]: TraceAbstraction took 13200.74ms. Allocated memory was 207.6MB in the beginning and 675.3MB in the end (delta: 467.7MB). Free memory was 119.8MB in the beginning and 463.4MB in the end (delta: -343.6MB). Peak memory consumption was 125.1MB. Max. memory is 8.0GB. [2022-12-13 09:20:20,364 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 207.6MB. Free memory is still 183.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 499.13ms. Allocated memory is still 207.6MB. Free memory was 182.7MB in the beginning and 157.0MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.69ms. Allocated memory is still 207.6MB. Free memory was 156.5MB in the beginning and 154.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.93ms. Allocated memory is still 207.6MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 542.18ms. Allocated memory is still 207.6MB. Free memory was 152.3MB in the beginning and 120.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13200.74ms. Allocated memory was 207.6MB in the beginning and 675.3MB in the end (delta: 467.7MB). Free memory was 119.8MB in the beginning and 463.4MB in the end (delta: -343.6MB). Peak memory consumption was 125.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 115 PlacesBefore, 70 PlacesAfterwards, 107 TransitionsBefore, 61 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3206, independent: 3081, independent conditional: 3081, independent unconditional: 0, dependent: 125, dependent conditional: 125, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1999, independent: 1952, independent conditional: 0, independent unconditional: 1952, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1999, independent: 1952, independent conditional: 0, independent unconditional: 1952, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1999, independent: 1942, independent conditional: 0, independent unconditional: 1942, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3206, independent: 1129, independent conditional: 1129, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 1999, unknown conditional: 1999, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2015, Positive cache size: 1968, Positive conditional cache size: 1968, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 230, independent: 205, independent conditional: 12, independent unconditional: 193, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 230, independent: 205, independent conditional: 12, independent unconditional: 193, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 230, independent: 184, independent conditional: 0, independent unconditional: 184, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 84, dependent conditional: 14, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 276, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 230, unknown conditional: 230, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 205, Positive conditional cache size: 205, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 200, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 32, independent conditional: 3, independent unconditional: 29, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 32, independent conditional: 3, independent unconditional: 29, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 54, dependent conditional: 28, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 200, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 237, Positive conditional cache size: 237, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 2, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 2, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, independent: 199, independent conditional: 199, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 254, Positive conditional cache size: 254, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 47 PlacesBefore, 47 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 510, independent: 466, independent conditional: 466, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 48, independent conditional: 20, independent unconditional: 28, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, independent: 48, independent conditional: 20, independent unconditional: 28, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, independent: 48, independent conditional: 0, independent unconditional: 48, 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: 1, dependent unconditional: 0, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 510, independent: 418, independent conditional: 418, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 49, unknown conditional: 49, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 302, Positive conditional cache size: 302, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 51 PlacesBefore, 51 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 509, independent: 453, independent conditional: 453, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 34, independent conditional: 0, independent unconditional: 34, 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: 1, dependent unconditional: 0, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 509, independent: 419, independent conditional: 419, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 336, Positive conditional cache size: 336, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 597, independent: 532, independent conditional: 532, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 54, independent conditional: 42, independent unconditional: 12, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 54, independent conditional: 42, independent unconditional: 12, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 597, independent: 478, independent conditional: 478, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 59, unknown conditional: 59, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 390, Positive conditional cache size: 390, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 251, independent: 225, independent conditional: 225, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 11, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 11, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 251, independent: 213, independent conditional: 213, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 402, Positive conditional cache size: 402, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 60 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 582, independent: 526, independent conditional: 526, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 582, independent: 515, independent conditional: 515, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 413, Positive conditional cache size: 413, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 60 PlacesBefore, 53 PlacesAfterwards, 48 TransitionsBefore, 41 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 573, independent: 515, independent conditional: 515, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 90, independent conditional: 70, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 94, independent: 90, independent conditional: 70, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 94, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 573, independent: 425, independent conditional: 425, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 94, unknown conditional: 94, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 553, Positive cache size: 503, Positive conditional cache size: 503, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 553, Positive cache size: 503, Positive conditional cache size: 503, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff1_thd0; [L730] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd2; [L732] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t412; [L837] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t412, ((void *)0), P0, ((void *)0))=-2, t412={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] 0 pthread_t t413; [L839] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t413, ((void *)0), P1, ((void *)0))=-1, t412={5:0}, t413={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t414; [L841] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t414, ((void *)0), P2, ((void *)0))=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L805] 3 y = 1 [L808] 3 __unbuffered_p2_EAX = y [L811] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L748] 1 z = 1 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L815] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L816] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L817] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L818] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 1 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 1 !(!cond) [L845] RET 1 assume_abort_if_not(main$tmp_guard0) [L847] 1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L848] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L850] 1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] 1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L854] 1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L856] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 1 !expression [L19] 1 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 841]: 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: 837]: 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: 839]: 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: 13.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 13 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=9, InterpolantAutomatonStates: 46, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 09:20:20,393 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...