/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.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:08:45,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:08:45,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:08:45,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:08:45,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:08:45,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:08:45,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:08:45,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:08:45,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:08:45,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:08:45,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:08:45,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:08:45,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:08:45,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:08:45,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:08:45,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:08:45,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:08:45,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:08:45,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:08:45,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:08:45,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:08:45,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:08:45,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:08:45,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:08:45,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:08:45,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:08:45,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:08:45,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:08:45,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:08:45,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:08:45,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:08:45,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:08:45,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:08:45,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:08:45,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:08:45,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:08:45,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:08:45,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:08:45,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:08:45,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:08:45,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:08:45,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:08:45,537 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:08:45,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:08:45,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:08:45,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:08:45,539 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:08:45,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:08:45,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:08:45,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:08:45,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:08:45,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:08:45,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:08:45,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:08:45,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:08:45,541 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:08:45,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:08:45,541 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:08:45,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:08:45,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:08:45,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:08:45,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:08:45,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:08:45,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:08:45,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:08:45,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:08:45,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:08:45,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:08:45,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:08:45,542 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:08:45,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:08:45,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:08:45,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:08:45,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:08:45,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:08:45,821 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:08:45,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016.oepc.i [2022-12-06 04:08:46,848 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:08:47,071 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:08:47,072 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016.oepc.i [2022-12-06 04:08:47,101 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fbdf055/53c5e7037fd44ac38db28474a5e59e51/FLAGaeb7d23d6 [2022-12-06 04:08:47,113 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fbdf055/53c5e7037fd44ac38db28474a5e59e51 [2022-12-06 04:08:47,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:08:47,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:08:47,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:08:47,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:08:47,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:08:47,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd0a37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47, skipping insertion in model container [2022-12-06 04:08:47,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:08:47,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:08:47,314 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.oepc.i[945,958] [2022-12-06 04:08:47,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:08:47,498 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:08:47,511 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.oepc.i[945,958] [2022-12-06 04:08:47,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:47,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:47,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:08:47,583 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:08:47,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47 WrapperNode [2022-12-06 04:08:47,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:08:47,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:08:47,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:08:47,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:08:47,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,630 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-06 04:08:47,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:08:47,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:08:47,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:08:47,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:08:47,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,649 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:08:47,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:08:47,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:08:47,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:08:47,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (1/1) ... [2022-12-06 04:08:47,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:08:47,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:08:47,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:08:47,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:08:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:08:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:08:47,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:08:47,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:08:47,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:08:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:08:47,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:08:47,761 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:08:47,883 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:08:47,884 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:08:48,100 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:08:48,182 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:08:48,183 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:08:48,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:08:48 BoogieIcfgContainer [2022-12-06 04:08:48,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:08:48,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:08:48,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:08:48,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:08:48,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:08:47" (1/3) ... [2022-12-06 04:08:48,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f3f1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:08:48, skipping insertion in model container [2022-12-06 04:08:48,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:47" (2/3) ... [2022-12-06 04:08:48,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f3f1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:08:48, skipping insertion in model container [2022-12-06 04:08:48,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:08:48" (3/3) ... [2022-12-06 04:08:48,195 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2022-12-06 04:08:48,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:08:48,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:08:48,224 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:08:48,284 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:08:48,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 04:08:48,373 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-06 04:08:48,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:48,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:08:48,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 04:08:48,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-06 04:08:48,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:48,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-06 04:08:48,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-06 04:08:48,428 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-06 04:08:48,429 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:48,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:08:48,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-06 04:08:48,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 2008 [2022-12-06 04:08:52,025 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-06 04:08:52,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:08:52,046 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;@22d23d87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:08:52,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:08:52,073 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 04:08:52,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:52,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:52,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:08:52,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:52,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash 478437, now seen corresponding path program 1 times [2022-12-06 04:08:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:52,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764892377] [2022-12-06 04:08:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:52,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:52,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764892377] [2022-12-06 04:08:52,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764892377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:52,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:52,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:08:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963382410] [2022-12-06 04:08:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:52,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:08:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:08:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:08:52,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:08:52,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:52,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:52,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:08:52,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:52,563 INFO L130 PetriNetUnfolder]: 1106/1786 cut-off events. [2022-12-06 04:08:52,563 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:08:52,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3480 conditions, 1786 events. 1106/1786 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9824 event pairs, 176 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 3469. Up to 1336 conditions per place. [2022-12-06 04:08:52,572 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 31 selfloop transitions, 2 changer transitions 8/44 dead transitions. [2022-12-06 04:08:52,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2022-12-06 04:08:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:08:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:08:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 04:08:52,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-06 04:08:52,581 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 55 transitions. [2022-12-06 04:08:52,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2022-12-06 04:08:52,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:08:52,584 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-06 04:08:52,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 04:08:52,587 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 04:08:52,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:52,588 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 54 flow [2022-12-06 04:08:52,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:52,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:52,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 54 flow [2022-12-06 04:08:52,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-06 04:08:52,594 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 04:08:52,594 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:52,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 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-06 04:08:52,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-06 04:08:52,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 04:08:52,678 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:52,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 04:08:52,680 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 04:08:52,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:52,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:52,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:52,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:08:52,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1739404390, now seen corresponding path program 1 times [2022-12-06 04:08:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:52,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249841099] [2022-12-06 04:08:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:52,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:52,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249841099] [2022-12-06 04:08:52,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249841099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:52,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:52,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:08:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043455721] [2022-12-06 04:08:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:52,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:08:52,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:52,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:08:52,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:08:52,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:08:52,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:52,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:52,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:08:52,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:53,003 INFO L130 PetriNetUnfolder]: 1375/2028 cut-off events. [2022-12-06 04:08:53,004 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-06 04:08:53,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 2028 events. 1375/2028 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8346 event pairs, 597 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 4240. Up to 1953 conditions per place. [2022-12-06 04:08:53,014 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 04:08:53,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 152 flow [2022-12-06 04:08:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:08:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:08:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:08:53,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-06 04:08:53,015 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:08:53,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 152 flow [2022-12-06 04:08:53,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:53,017 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 76 flow [2022-12-06 04:08:53,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-06 04:08:53,017 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places. [2022-12-06 04:08:53,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:53,018 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 76 flow [2022-12-06 04:08:53,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:53,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:53,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 76 flow [2022-12-06 04:08:53,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 76 flow [2022-12-06 04:08:53,026 INFO L130 PetriNetUnfolder]: 14/67 cut-off events. [2022-12-06 04:08:53,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:53,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 67 events. 14/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 217 event pairs, 6 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 100. Up to 29 conditions per place. [2022-12-06 04:08:53,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 76 flow [2022-12-06 04:08:53,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-06 04:08:53,056 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:53,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 04:08:53,058 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 76 flow [2022-12-06 04:08:53,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:53,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:53,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:53,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:08:53,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 509432335, now seen corresponding path program 1 times [2022-12-06 04:08:53,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:53,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292503304] [2022-12-06 04:08:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:53,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292503304] [2022-12-06 04:08:53,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292503304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:53,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:53,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:08:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038043739] [2022-12-06 04:08:53,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:53,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:53,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:08:53,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 76 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:53,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:53,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:08:53,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:53,439 INFO L130 PetriNetUnfolder]: 1269/1880 cut-off events. [2022-12-06 04:08:53,440 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-06 04:08:53,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1880 events. 1269/1880 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7459 event pairs, 405 based on Foata normal form. 42/1922 useless extension candidates. Maximal degree in co-relation 4279. Up to 1316 conditions per place. [2022-12-06 04:08:53,449 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 04:08:53,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 170 flow [2022-12-06 04:08:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:08:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:08:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:08:53,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:08:53,451 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 76 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:08:53,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 170 flow [2022-12-06 04:08:53,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:08:53,453 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 83 flow [2022-12-06 04:08:53,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-06 04:08:53,454 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2022-12-06 04:08:53,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:53,454 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 83 flow [2022-12-06 04:08:53,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:53,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:53,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 83 flow [2022-12-06 04:08:53,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 83 flow [2022-12-06 04:08:53,459 INFO L130 PetriNetUnfolder]: 9/48 cut-off events. [2022-12-06 04:08:53,459 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-06 04:08:53,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 48 events. 9/48 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 2 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 82. Up to 21 conditions per place. [2022-12-06 04:08:53,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 83 flow [2022-12-06 04:08:53,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 04:08:53,468 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:53,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:08:53,469 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 83 flow [2022-12-06 04:08:53,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:53,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:53,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:53,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:08:53,470 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash 809543358, now seen corresponding path program 1 times [2022-12-06 04:08:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:53,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297085838] [2022-12-06 04:08:53,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:53,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:53,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297085838] [2022-12-06 04:08:53,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297085838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:53,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:53,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:08:53,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750233798] [2022-12-06 04:08:53,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:53,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:53,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:53,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:53,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:08:53,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:53,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:53,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:08:53,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:53,841 INFO L130 PetriNetUnfolder]: 626/1075 cut-off events. [2022-12-06 04:08:53,841 INFO L131 PetriNetUnfolder]: For 68/73 co-relation queries the response was YES. [2022-12-06 04:08:53,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1075 events. 626/1075 cut-off events. For 68/73 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5374 event pairs, 187 based on Foata normal form. 108/1149 useless extension candidates. Maximal degree in co-relation 2326. Up to 415 conditions per place. [2022-12-06 04:08:53,846 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 39 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2022-12-06 04:08:53,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 225 flow [2022-12-06 04:08:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:08:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:08:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:08:53,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-12-06 04:08:53,847 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 83 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:08:53,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 225 flow [2022-12-06 04:08:53,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:53,848 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 115 flow [2022-12-06 04:08:53,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-06 04:08:53,849 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2022-12-06 04:08:53,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:53,849 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 115 flow [2022-12-06 04:08:53,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:53,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:53,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 115 flow [2022-12-06 04:08:53,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 115 flow [2022-12-06 04:08:53,859 INFO L130 PetriNetUnfolder]: 42/131 cut-off events. [2022-12-06 04:08:53,859 INFO L131 PetriNetUnfolder]: For 33/42 co-relation queries the response was YES. [2022-12-06 04:08:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 131 events. 42/131 cut-off events. For 33/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 590 event pairs, 14 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 294. Up to 70 conditions per place. [2022-12-06 04:08:53,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 115 flow [2022-12-06 04:08:53,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 04:08:53,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:08:53,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 04:08:53,980 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 117 flow [2022-12-06 04:08:53,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:53,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:53,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:53,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:08:53,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:53,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1300309526, now seen corresponding path program 1 times [2022-12-06 04:08:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:53,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741712199] [2022-12-06 04:08:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:54,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741712199] [2022-12-06 04:08:54,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741712199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:54,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:54,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:08:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466537217] [2022-12-06 04:08:54,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:54,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:08:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:08:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:08:54,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 04:08:54,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:54,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:54,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 04:08:54,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:54,235 INFO L130 PetriNetUnfolder]: 298/567 cut-off events. [2022-12-06 04:08:54,235 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-06 04:08:54,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 567 events. 298/567 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2554 event pairs, 83 based on Foata normal form. 58/613 useless extension candidates. Maximal degree in co-relation 1545. Up to 238 conditions per place. [2022-12-06 04:08:54,238 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 48 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-06 04:08:54,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 62 transitions, 312 flow [2022-12-06 04:08:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:08:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:08:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 04:08:54,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6347826086956522 [2022-12-06 04:08:54,242 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 117 flow. Second operand 5 states and 73 transitions. [2022-12-06 04:08:54,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 62 transitions, 312 flow [2022-12-06 04:08:54,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 62 transitions, 302 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:54,246 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 156 flow [2022-12-06 04:08:54,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-06 04:08:54,248 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-06 04:08:54,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:54,248 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 156 flow [2022-12-06 04:08:54,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:54,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:54,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 156 flow [2022-12-06 04:08:54,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 156 flow [2022-12-06 04:08:54,257 INFO L130 PetriNetUnfolder]: 24/94 cut-off events. [2022-12-06 04:08:54,258 INFO L131 PetriNetUnfolder]: For 93/97 co-relation queries the response was YES. [2022-12-06 04:08:54,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 94 events. 24/94 cut-off events. For 93/97 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 350 event pairs, 3 based on Foata normal form. 4/93 useless extension candidates. Maximal degree in co-relation 260. Up to 44 conditions per place. [2022-12-06 04:08:54,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 156 flow [2022-12-06 04:08:54,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 04:08:54,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:08:54,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-06 04:08:54,511 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 160 flow [2022-12-06 04:08:54,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:54,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:54,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:54,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:08:54,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:54,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1999398339, now seen corresponding path program 1 times [2022-12-06 04:08:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:54,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062827621] [2022-12-06 04:08:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:54,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:54,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:54,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062827621] [2022-12-06 04:08:54,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062827621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:54,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:54,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:08:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13341527] [2022-12-06 04:08:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:54,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:08:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:08:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:08:54,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 04:08:54,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:54,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:54,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 04:08:54,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:55,069 INFO L130 PetriNetUnfolder]: 377/762 cut-off events. [2022-12-06 04:08:55,069 INFO L131 PetriNetUnfolder]: For 857/858 co-relation queries the response was YES. [2022-12-06 04:08:55,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 762 events. 377/762 cut-off events. For 857/858 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3907 event pairs, 99 based on Foata normal form. 8/762 useless extension candidates. Maximal degree in co-relation 2380. Up to 363 conditions per place. [2022-12-06 04:08:55,073 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 62 selfloop transitions, 11 changer transitions 13/92 dead transitions. [2022-12-06 04:08:55,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 92 transitions, 645 flow [2022-12-06 04:08:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:08:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:08:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-06 04:08:55,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2022-12-06 04:08:55,074 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 160 flow. Second operand 6 states and 83 transitions. [2022-12-06 04:08:55,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 92 transitions, 645 flow [2022-12-06 04:08:55,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 92 transitions, 553 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-06 04:08:55,078 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 209 flow [2022-12-06 04:08:55,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-06 04:08:55,078 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-06 04:08:55,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:55,078 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 209 flow [2022-12-06 04:08:55,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:55,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:55,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 209 flow [2022-12-06 04:08:55,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 209 flow [2022-12-06 04:08:55,099 INFO L130 PetriNetUnfolder]: 77/247 cut-off events. [2022-12-06 04:08:55,099 INFO L131 PetriNetUnfolder]: For 269/297 co-relation queries the response was YES. [2022-12-06 04:08:55,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 247 events. 77/247 cut-off events. For 269/297 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1308 event pairs, 11 based on Foata normal form. 12/249 useless extension candidates. Maximal degree in co-relation 704. Up to 80 conditions per place. [2022-12-06 04:08:55,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 209 flow [2022-12-06 04:08:55,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 04:08:55,448 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:08:55,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-06 04:08:55,449 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 208 flow [2022-12-06 04:08:55,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:55,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:55,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:55,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:08:55,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:55,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -532593704, now seen corresponding path program 1 times [2022-12-06 04:08:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:55,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878720496] [2022-12-06 04:08:55,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:55,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:55,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:55,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878720496] [2022-12-06 04:08:55,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878720496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:55,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:55,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:08:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716132169] [2022-12-06 04:08:55,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:55,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:08:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:55,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:08:55,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:08:55,595 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:08:55,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:55,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:55,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:08:55,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:55,717 INFO L130 PetriNetUnfolder]: 325/648 cut-off events. [2022-12-06 04:08:55,717 INFO L131 PetriNetUnfolder]: For 921/921 co-relation queries the response was YES. [2022-12-06 04:08:55,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 648 events. 325/648 cut-off events. For 921/921 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3202 event pairs, 83 based on Foata normal form. 32/672 useless extension candidates. Maximal degree in co-relation 2119. Up to 228 conditions per place. [2022-12-06 04:08:55,721 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 52 selfloop transitions, 11 changer transitions 3/71 dead transitions. [2022-12-06 04:08:55,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 465 flow [2022-12-06 04:08:55,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:08:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:08:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 04:08:55,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2022-12-06 04:08:55,723 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 208 flow. Second operand 6 states and 70 transitions. [2022-12-06 04:08:55,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 465 flow [2022-12-06 04:08:55,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 450 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:55,727 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 227 flow [2022-12-06 04:08:55,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2022-12-06 04:08:55,727 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-06 04:08:55,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:55,727 INFO L89 Accepts]: Start accepts. Operand has 50 places, 39 transitions, 227 flow [2022-12-06 04:08:55,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:55,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:55,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 227 flow [2022-12-06 04:08:55,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 227 flow [2022-12-06 04:08:55,744 INFO L130 PetriNetUnfolder]: 62/196 cut-off events. [2022-12-06 04:08:55,744 INFO L131 PetriNetUnfolder]: For 290/302 co-relation queries the response was YES. [2022-12-06 04:08:55,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 196 events. 62/196 cut-off events. For 290/302 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 948 event pairs, 7 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 608. Up to 55 conditions per place. [2022-12-06 04:08:55,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 227 flow [2022-12-06 04:08:55,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-06 04:08:55,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] L823-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_13| 0) (= |v_P2Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] and [381] L845-3-->L848: Formula: (= v_~main$tmp_guard0~0_14 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_37) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_7|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:08:55,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L787-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [381] L845-3-->L848: Formula: (= v_~main$tmp_guard0~0_14 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_37) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_7|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:08:55,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L767-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= |v_P0Thread1of1ForFork0_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_9|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] and [381] L845-3-->L848: Formula: (= v_~main$tmp_guard0~0_14 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_37) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_7|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:08:56,086 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:08:56,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 360 [2022-12-06 04:08:56,087 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 233 flow [2022-12-06 04:08:56,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:56,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:56,087 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:56,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:08:56,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:56,088 INFO L85 PathProgramCache]: Analyzing trace with hash -39602010, now seen corresponding path program 1 times [2022-12-06 04:08:56,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:56,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069075933] [2022-12-06 04:08:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:56,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:56,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069075933] [2022-12-06 04:08:56,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069075933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:56,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:56,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:08:56,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449511866] [2022-12-06 04:08:56,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:56,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:56,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:56,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:56,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:56,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 04:08:56,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:56,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:56,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 04:08:56,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:56,428 INFO L130 PetriNetUnfolder]: 521/988 cut-off events. [2022-12-06 04:08:56,428 INFO L131 PetriNetUnfolder]: For 1701/1702 co-relation queries the response was YES. [2022-12-06 04:08:56,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 988 events. 521/988 cut-off events. For 1701/1702 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5070 event pairs, 142 based on Foata normal form. 3/988 useless extension candidates. Maximal degree in co-relation 3575. Up to 433 conditions per place. [2022-12-06 04:08:56,432 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 43 selfloop transitions, 1 changer transitions 29/74 dead transitions. [2022-12-06 04:08:56,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 613 flow [2022-12-06 04:08:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:08:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:08:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 04:08:56,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2022-12-06 04:08:56,433 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 233 flow. Second operand 4 states and 53 transitions. [2022-12-06 04:08:56,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 613 flow [2022-12-06 04:08:56,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 74 transitions, 484 flow, removed 29 selfloop flow, removed 8 redundant places. [2022-12-06 04:08:56,439 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 171 flow [2022-12-06 04:08:56,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-06 04:08:56,439 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-06 04:08:56,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:56,439 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 171 flow [2022-12-06 04:08:56,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:56,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:56,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 171 flow [2022-12-06 04:08:56,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 171 flow [2022-12-06 04:08:56,451 INFO L130 PetriNetUnfolder]: 46/143 cut-off events. [2022-12-06 04:08:56,451 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 04:08:56,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 143 events. 46/143 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 598 event pairs, 6 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 320. Up to 39 conditions per place. [2022-12-06 04:08:56,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 171 flow [2022-12-06 04:08:56,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 04:08:56,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:08:56,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 04:08:56,468 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 169 flow [2022-12-06 04:08:56,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:56,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:56,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:56,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:08:56,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:56,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash -850474907, now seen corresponding path program 1 times [2022-12-06 04:08:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:56,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131257061] [2022-12-06 04:08:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:56,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:56,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131257061] [2022-12-06 04:08:56,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131257061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:56,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:56,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:08:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012790077] [2022-12-06 04:08:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:56,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:08:56,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:56,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:08:56,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:08:56,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:08:56,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 169 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:56,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:56,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:08:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:57,187 INFO L130 PetriNetUnfolder]: 268/538 cut-off events. [2022-12-06 04:08:57,187 INFO L131 PetriNetUnfolder]: For 582/595 co-relation queries the response was YES. [2022-12-06 04:08:57,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 538 events. 268/538 cut-off events. For 582/595 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2508 event pairs, 59 based on Foata normal form. 9/545 useless extension candidates. Maximal degree in co-relation 1693. Up to 320 conditions per place. [2022-12-06 04:08:57,190 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 53 selfloop transitions, 9 changer transitions 18/83 dead transitions. [2022-12-06 04:08:57,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 83 transitions, 550 flow [2022-12-06 04:08:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:08:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:08:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-06 04:08:57,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 04:08:57,191 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 169 flow. Second operand 6 states and 76 transitions. [2022-12-06 04:08:57,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 83 transitions, 550 flow [2022-12-06 04:08:57,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 510 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 04:08:57,194 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 232 flow [2022-12-06 04:08:57,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-12-06 04:08:57,194 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 04:08:57,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:57,195 INFO L89 Accepts]: Start accepts. Operand has 48 places, 41 transitions, 232 flow [2022-12-06 04:08:57,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:57,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:57,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 232 flow [2022-12-06 04:08:57,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 232 flow [2022-12-06 04:08:57,207 INFO L130 PetriNetUnfolder]: 47/154 cut-off events. [2022-12-06 04:08:57,207 INFO L131 PetriNetUnfolder]: For 81/93 co-relation queries the response was YES. [2022-12-06 04:08:57,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 154 events. 47/154 cut-off events. For 81/93 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 691 event pairs, 4 based on Foata normal form. 5/152 useless extension candidates. Maximal degree in co-relation 394. Up to 40 conditions per place. [2022-12-06 04:08:57,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 232 flow [2022-12-06 04:08:57,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 04:08:57,211 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:57,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 04:08:57,211 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 232 flow [2022-12-06 04:08:57,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:57,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:57,212 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:57,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:08:57,212 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:57,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash -189267795, now seen corresponding path program 2 times [2022-12-06 04:08:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:57,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238667568] [2022-12-06 04:08:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:57,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:57,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238667568] [2022-12-06 04:08:57,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238667568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:57,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:57,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:08:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387952156] [2022-12-06 04:08:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:57,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:57,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:57,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:08:57,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:57,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:57,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:08:57,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:57,517 INFO L130 PetriNetUnfolder]: 385/750 cut-off events. [2022-12-06 04:08:57,517 INFO L131 PetriNetUnfolder]: For 977/981 co-relation queries the response was YES. [2022-12-06 04:08:57,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2635 conditions, 750 events. 385/750 cut-off events. For 977/981 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3730 event pairs, 119 based on Foata normal form. 3/751 useless extension candidates. Maximal degree in co-relation 2619. Up to 353 conditions per place. [2022-12-06 04:08:57,520 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 26 selfloop transitions, 1 changer transitions 49/77 dead transitions. [2022-12-06 04:08:57,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 586 flow [2022-12-06 04:08:57,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:08:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:08:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:08:57,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-06 04:08:57,521 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 232 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:08:57,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 586 flow [2022-12-06 04:08:57,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 574 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:57,524 INFO L231 Difference]: Finished difference. Result has 50 places, 26 transitions, 134 flow [2022-12-06 04:08:57,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=26} [2022-12-06 04:08:57,525 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-06 04:08:57,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:57,525 INFO L89 Accepts]: Start accepts. Operand has 50 places, 26 transitions, 134 flow [2022-12-06 04:08:57,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:57,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:57,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 26 transitions, 134 flow [2022-12-06 04:08:57,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 26 transitions, 134 flow [2022-12-06 04:08:57,531 INFO L130 PetriNetUnfolder]: 9/45 cut-off events. [2022-12-06 04:08:57,531 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 04:08:57,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 45 events. 9/45 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 110. Up to 10 conditions per place. [2022-12-06 04:08:57,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 26 transitions, 134 flow [2022-12-06 04:08:57,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 04:08:58,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [462] $Ultimate##0-->L760: Formula: (and (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_449 256) 0)) (not (= (mod v_~z$w_buff0_used~0_505 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53|) (= |v_P0Thread1of1ForFork0_~arg#1.base_45| |v_P0Thread1of1ForFork0_#in~arg#1.base_45|) (= v_~z$w_buff0~0_302 v_~z$w_buff1~0_255) (= v_~z$r_buff0_thd3~0_217 v_~z$r_buff1_thd3~0_222) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53| 0)) (= v_~z$r_buff0_thd1~0_180 1) (= v_~z$r_buff0_thd1~0_181 v_~z$r_buff1_thd1~0_131) (= v_~z$w_buff0~0_301 1) (= v_~z$w_buff0_used~0_506 v_~z$w_buff1_used~0_449) (= v_~z$r_buff0_thd2~0_143 v_~z$r_buff1_thd2~0_151) (= v_~z$w_buff0_used~0_505 1) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_45| |v_P0Thread1of1ForFork0_~arg#1.offset_45|) (= v_~z$r_buff0_thd0~0_178 v_~z$r_buff1_thd0~0_187) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53|) (= v_~x~0_31 v_~__unbuffered_p0_EAX~0_67)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_45|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_506, ~z$w_buff0~0=v_~z$w_buff0~0_302, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_45|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_217, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_181, ~x~0=v_~x~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_143} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_45|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_505, ~z$w_buff0~0=v_~z$w_buff0~0_301, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_222, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_151, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_449, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_45|, ~z$w_buff1~0=v_~z$w_buff1~0_255, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_45|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_67, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_187, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_131, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_217, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_180, ~x~0=v_~x~0_31, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_143} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0_~arg#1.base, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~z$r_buff1_thd0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [474] $Ultimate##0-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd2~0_163 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_552 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_155 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_553 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~z$w_buff1_used~0_489 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_553) v_~z$w_buff0_used~0_552) (= v_~z$r_buff1_thd2~0_162 (ite (or (and (not (= (mod v_~z$r_buff0_thd2~0_154 256) 0)) .cse1) (and .cse2 (not (= (mod v_~z$w_buff1_used~0_488 256) 0)))) 0 v_~z$r_buff1_thd2~0_163)) (= v_~z~0_410 (ite .cse0 v_~z$w_buff0~0_337 (ite .cse3 v_~z$w_buff1~0_284 v_~z~0_411))) (= v_~x~0_42 1) (= (ite .cse4 0 v_~z$r_buff0_thd2~0_155) v_~z$r_buff0_thd2~0_154) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_489) v_~z$w_buff1_used~0_488) (= v_P1Thread1of1ForFork1_~arg.base_22 |v_P1Thread1of1ForFork1_#in~arg.base_22|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_22| v_P1Thread1of1ForFork1_~arg.offset_22) (= v_~y~0_54 v_~__unbuffered_p1_EAX~0_79)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_553, ~z$w_buff0~0=v_~z$w_buff0~0_337, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_163, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_22|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_489, ~z$w_buff1~0=v_~z$w_buff1~0_284, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_22|, ~z~0=v_~z~0_411, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_155} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_552, ~z$w_buff0~0=v_~z$w_buff0~0_337, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_22, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_162, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_488, ~z$w_buff1~0=v_~z$w_buff1~0_284, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_22|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_22|, ~z~0=v_~z~0_410, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_154, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~z$w_buff0_used~0, P1Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0, ~x~0] [2022-12-06 04:08:59,060 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:08:59,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1536 [2022-12-06 04:08:59,061 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 23 transitions, 152 flow [2022-12-06 04:08:59,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:59,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:59,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:59,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:08:59,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1393715923, now seen corresponding path program 1 times [2022-12-06 04:08:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:59,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34398903] [2022-12-06 04:08:59,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:59,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34398903] [2022-12-06 04:08:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34398903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:59,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:59,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:08:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069442881] [2022-12-06 04:08:59,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:59,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:08:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:08:59,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:08:59,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:08:59,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 23 transitions, 152 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:59,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:59,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:08:59,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:59,530 INFO L130 PetriNetUnfolder]: 77/167 cut-off events. [2022-12-06 04:08:59,530 INFO L131 PetriNetUnfolder]: For 433/433 co-relation queries the response was YES. [2022-12-06 04:08:59,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 167 events. 77/167 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 593 event pairs, 2 based on Foata normal form. 3/170 useless extension candidates. Maximal degree in co-relation 609. Up to 69 conditions per place. [2022-12-06 04:08:59,531 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 35 selfloop transitions, 8 changer transitions 10/53 dead transitions. [2022-12-06 04:08:59,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 401 flow [2022-12-06 04:08:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:08:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:08:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-06 04:08:59,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 04:08:59,532 INFO L175 Difference]: Start difference. First operand has 43 places, 23 transitions, 152 flow. Second operand 6 states and 45 transitions. [2022-12-06 04:08:59,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 401 flow [2022-12-06 04:08:59,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 351 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-06 04:08:59,534 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 174 flow [2022-12-06 04:08:59,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 04:08:59,534 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 04:08:59,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:59,534 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 174 flow [2022-12-06 04:08:59,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:59,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:59,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 174 flow [2022-12-06 04:08:59,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 174 flow [2022-12-06 04:08:59,541 INFO L130 PetriNetUnfolder]: 17/58 cut-off events. [2022-12-06 04:08:59,541 INFO L131 PetriNetUnfolder]: For 72/80 co-relation queries the response was YES. [2022-12-06 04:08:59,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 58 events. 17/58 cut-off events. For 72/80 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 169 event pairs, 1 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 160. Up to 18 conditions per place. [2022-12-06 04:08:59,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 174 flow [2022-12-06 04:08:59,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 04:09:00,150 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:09:00,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 616 [2022-12-06 04:09:00,150 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 179 flow [2022-12-06 04:09:00,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:00,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:00,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:00,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:09:00,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash 911760073, now seen corresponding path program 1 times [2022-12-06 04:09:00,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:00,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056816895] [2022-12-06 04:09:00,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:00,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:09:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:00,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:09:00,227 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:09:00,228 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:09:00,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:09:00,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:09:00,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:09:00,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:09:00,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:09:00,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:09:00,230 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:00,243 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:09:00,243 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:09:00,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:09:00 BasicIcfg [2022-12-06 04:09:00,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:09:00,310 INFO L158 Benchmark]: Toolchain (without parser) took 13193.93ms. Allocated memory was 211.8MB in the beginning and 643.8MB in the end (delta: 432.0MB). Free memory was 186.2MB in the beginning and 611.4MB in the end (delta: -425.3MB). Peak memory consumption was 311.4MB. Max. memory is 8.0GB. [2022-12-06 04:09:00,310 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory was 188.5MB in the beginning and 188.4MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:09:00,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.06ms. Allocated memory is still 211.8MB. Free memory was 185.7MB in the beginning and 159.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:09:00,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.00ms. Allocated memory is still 211.8MB. Free memory was 159.4MB in the beginning and 156.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:00,311 INFO L158 Benchmark]: Boogie Preprocessor took 33.69ms. Allocated memory is still 211.8MB. Free memory was 156.8MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:00,311 INFO L158 Benchmark]: RCFGBuilder took 523.80ms. Allocated memory is still 211.8MB. Free memory was 154.7MB in the beginning and 120.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 04:09:00,311 INFO L158 Benchmark]: TraceAbstraction took 12119.04ms. Allocated memory was 211.8MB in the beginning and 643.8MB in the end (delta: 432.0MB). Free memory was 120.1MB in the beginning and 611.4MB in the end (delta: -491.3MB). Peak memory consumption was 245.3MB. Max. memory is 8.0GB. [2022-12-06 04:09:00,312 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.09ms. Allocated memory is still 211.8MB. Free memory was 188.5MB in the beginning and 188.4MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 467.06ms. Allocated memory is still 211.8MB. Free memory was 185.7MB in the beginning and 159.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.00ms. Allocated memory is still 211.8MB. Free memory was 159.4MB in the beginning and 156.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.69ms. Allocated memory is still 211.8MB. Free memory was 156.8MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 523.80ms. Allocated memory is still 211.8MB. Free memory was 154.7MB in the beginning and 120.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12119.04ms. Allocated memory was 211.8MB in the beginning and 643.8MB in the end (delta: 432.0MB). Free memory was 120.1MB in the beginning and 611.4MB in the end (delta: -491.3MB). Peak memory consumption was 245.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 116 PlacesBefore, 38 PlacesAfterwards, 108 TransitionsBefore, 29 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1501, independent: 1440, independent conditional: 1440, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1501, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1501, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1501, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1159, independent: 1119, independent conditional: 0, independent unconditional: 1119, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1159, independent: 1111, independent conditional: 0, independent unconditional: 1111, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1501, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1159, unknown conditional: 0, unknown unconditional: 1159] , Statistics on independence cache: Total cache size (in pairs): 1786, Positive cache size: 1746, Positive conditional cache size: 0, Positive unconditional cache size: 1746, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 75, independent conditional: 16, independent unconditional: 59, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 75, independent conditional: 16, independent unconditional: 59, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 75, independent conditional: 16, independent unconditional: 59, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, independent: 71, independent conditional: 15, independent unconditional: 56, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 79, dependent conditional: 16, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 91, unknown conditional: 19, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 71, Positive conditional cache size: 15, Positive unconditional cache size: 56, Negative cache size: 20, Negative conditional cache size: 4, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 72, independent conditional: 6, independent unconditional: 66, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 87, Positive conditional cache size: 15, Positive unconditional cache size: 72, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 98, independent: 78, independent conditional: 6, independent unconditional: 72, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 94, Positive conditional cache size: 15, Positive unconditional cache size: 79, Negative cache size: 28, Negative conditional cache size: 4, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 121, independent conditional: 23, independent unconditional: 98, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 102, Positive conditional cache size: 15, Positive unconditional cache size: 87, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 106, independent conditional: 60, independent unconditional: 46, dependent: 44, dependent conditional: 30, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 126, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 111, Positive conditional cache size: 15, Positive unconditional cache size: 96, Negative cache size: 38, Negative conditional cache size: 4, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 46 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 95, independent conditional: 54, independent unconditional: 41, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 95, independent conditional: 27, independent unconditional: 68, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 95, independent conditional: 27, independent unconditional: 68, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 86, independent conditional: 23, independent unconditional: 63, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 10, unknown conditional: 4, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 134, Positive conditional cache size: 19, Positive unconditional cache size: 115, Negative cache size: 39, Negative conditional cache size: 4, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 49 PlacesBefore, 47 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 32, independent conditional: 20, independent unconditional: 12, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 40, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 161, Positive conditional cache size: 19, Positive unconditional cache size: 142, Negative cache size: 40, Negative conditional cache size: 4, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 169, Positive conditional cache size: 20, Positive unconditional cache size: 149, Negative cache size: 40, Negative conditional cache size: 4, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 169, Positive conditional cache size: 20, Positive unconditional cache size: 149, Negative cache size: 41, Negative conditional cache size: 5, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 46 PlacesBefore, 43 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 64, independent conditional: 50, independent unconditional: 14, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 64, independent conditional: 50, independent unconditional: 14, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 64, independent conditional: 50, independent unconditional: 14, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 46, independent conditional: 35, independent unconditional: 11, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 21, unknown conditional: 15, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 225, Positive conditional cache size: 40, Positive unconditional cache size: 185, Negative cache size: 44, Negative conditional cache size: 5, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 41 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 229, Positive conditional cache size: 41, Positive unconditional cache size: 188, Negative cache size: 44, Negative conditional cache size: 5, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((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, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t409, ((void *)0), P0, ((void *)0))=-1, t409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((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(&t410, ((void *)0), P1, ((void *)0))=0, t409={5:0}, t410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((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(&t411, ((void *)0), P2, ((void *)0))=1, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 [L759] 1 __unbuffered_p0_EAX = x [L776] 1 x = 1 [L779] 1 __unbuffered_p1_EAX = y [L782] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L796] 3 y = 1 [L799] 3 __unbuffered_p2_EAX = y [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L807] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L808] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L809] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L810] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L812] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 [L818] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __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=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L847] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L849] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L849] RET 1 assume_abort_if_not(main$tmp_guard0) [L851] 1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L852] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0: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=2, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: 843]: 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: 845]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 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: 11.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1017 IncrementalHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 7 mSDtfsCounter, 1017 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=7, InterpolantAutomatonStates: 50, 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, 2.3s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-06 04:09:00,335 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...