/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:29:14,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:29:14,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:29:14,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:29:14,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:29:14,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:29:14,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:29:14,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:29:14,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:29:14,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:29:14,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:29:14,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:29:14,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:29:14,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:29:14,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:29:14,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:29:14,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:29:14,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:29:14,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:29:14,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:29:14,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:29:14,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:29:14,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:29:14,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:29:14,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:29:14,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:29:14,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:29:14,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:29:14,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:29:14,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:29:14,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:29:14,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:29:14,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:29:14,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:29:14,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:29:14,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:29:14,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:29:14,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:29:14,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:29:14,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:29:14,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:29:14,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:29:14,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:29:14,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:29:14,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:29:14,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:29:14,561 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:29:14,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:29:14,562 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:29:14,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:29:14,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:29:14,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:29:14,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:29:14,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:29:14,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:29:14,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:29:14,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:29:14,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:29:14,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:29:14,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:29:14,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:29:14,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:29:14,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:29:14,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:29:14,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:29:14,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:29:14,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:29:14,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:29:14,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:29:14,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:29:14,566 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 06:29:14,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:29:14,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:29:14,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:29:14,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:29:14,899 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:29:14,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-06 06:29:16,063 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:29:16,332 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:29:16,333 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-06 06:29:16,346 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c846fd3ca/a073e0507f2142d39ef7dd0b8c31a5bf/FLAG5bbc2e611 [2022-12-06 06:29:16,358 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c846fd3ca/a073e0507f2142d39ef7dd0b8c31a5bf [2022-12-06 06:29:16,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:29:16,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:29:16,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:29:16,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:29:16,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:29:16,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:16,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2797f49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16, skipping insertion in model container [2022-12-06 06:29:16,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:16,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:29:16,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:29:16,535 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/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-12-06 06:29:16,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:29:16,803 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:29:16,814 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/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-12-06 06:29:16,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:16,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:16,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:29:16,925 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:29:16,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16 WrapperNode [2022-12-06 06:29:16,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:29:16,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:29:16,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:29:16,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:29:16,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:16,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:16,976 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-06 06:29:16,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:29:16,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:29:16,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:29:16,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:29:16,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:16,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:16,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:17,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:17,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:17,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:17,011 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:17,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:17,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:29:17,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:29:17,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:29:17,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:29:17,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (1/1) ... [2022-12-06 06:29:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:29:17,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:29:17,072 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 06:29:17,095 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 06:29:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:29:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:29:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:29:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:29:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:29:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:29:17,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:29:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:29:17,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:29:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:29:17,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:29:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:29:17,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:29:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:29:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:29:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:29:17,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:29:17,111 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 06:29:17,230 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:29:17,232 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:29:17,657 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:29:17,839 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:29:17,846 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:29:17,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:29:17 BoogieIcfgContainer [2022-12-06 06:29:17,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:29:17,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:29:17,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:29:17,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:29:17,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:29:16" (1/3) ... [2022-12-06 06:29:17,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f8081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:29:17, skipping insertion in model container [2022-12-06 06:29:17,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:16" (2/3) ... [2022-12-06 06:29:17,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f8081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:29:17, skipping insertion in model container [2022-12-06 06:29:17,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:29:17" (3/3) ... [2022-12-06 06:29:17,857 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-06 06:29:17,874 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:29:17,874 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:29:17,874 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:29:17,932 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:29:17,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 06:29:18,032 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 06:29:18,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:18,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 06:29:18,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 06:29:18,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 06:29:18,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:18,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 06:29:18,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 06:29:18,154 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 06:29:18,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 06:29:18,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 06:29:18,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-06 06:29:22,988 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 06:29:23,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:29:23,008 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;@63ec29f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:29:23,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:29:23,010 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:29:23,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:23,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:23,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:29:23,011 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash 536918, now seen corresponding path program 1 times [2022-12-06 06:29:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:23,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449682352] [2022-12-06 06:29:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:23,363 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 06:29:23,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:23,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449682352] [2022-12-06 06:29:23,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449682352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:23,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:23,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:29:23,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397739122] [2022-12-06 06:29:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:23,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:29:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:29:23,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:29:23,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 06:29:23,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 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 06:29:23,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:23,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 06:29:23,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:24,690 INFO L130 PetriNetUnfolder]: 7026/9692 cut-off events. [2022-12-06 06:29:24,690 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 06:29:24,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19387 conditions, 9692 events. 7026/9692 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 50079 event pairs, 2670 based on Foata normal form. 0/8964 useless extension candidates. Maximal degree in co-relation 19375. Up to 7606 conditions per place. [2022-12-06 06:29:24,749 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 43 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-06 06:29:24,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 247 flow [2022-12-06 06:29:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:29:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:29:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 06:29:24,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 06:29:24,761 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 69 transitions. [2022-12-06 06:29:24,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 247 flow [2022-12-06 06:29:24,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:29:24,766 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 06:29:24,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 06:29:24,770 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 06:29:24,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:24,771 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 06:29:24,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:24,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:24,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 06:29:24,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:29:24,780 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:29:24,780 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:24,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:29:24,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:29:24,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 06:29:24,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:24,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 06:29:24,920 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 06:29:24,920 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 06:29:24,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:24,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:24,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:29:24,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 327007879, now seen corresponding path program 1 times [2022-12-06 06:29:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:24,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129642022] [2022-12-06 06:29:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:25,172 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 06:29:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:25,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129642022] [2022-12-06 06:29:25,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129642022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:25,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:25,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:29:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200797609] [2022-12-06 06:29:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:25,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:29:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:25,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:29:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:29:25,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:29:25,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 06:29:25,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:25,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:29:25,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:26,919 INFO L130 PetriNetUnfolder]: 12028/16433 cut-off events. [2022-12-06 06:29:26,920 INFO L131 PetriNetUnfolder]: For 557/557 co-relation queries the response was YES. [2022-12-06 06:29:26,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33902 conditions, 16433 events. 12028/16433 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 85121 event pairs, 4350 based on Foata normal form. 383/16816 useless extension candidates. Maximal degree in co-relation 33892. Up to 11192 conditions per place. [2022-12-06 06:29:27,014 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 43 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2022-12-06 06:29:27,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2022-12-06 06:29:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:29:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:29:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:29:27,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 06:29:27,016 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:29:27,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2022-12-06 06:29:27,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:27,019 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 108 flow [2022-12-06 06:29:27,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-06 06:29:27,020 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2022-12-06 06:29:27,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:27,020 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 108 flow [2022-12-06 06:29:27,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:27,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:27,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 108 flow [2022-12-06 06:29:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 108 flow [2022-12-06 06:29:27,056 INFO L130 PetriNetUnfolder]: 86/272 cut-off events. [2022-12-06 06:29:27,056 INFO L131 PetriNetUnfolder]: For 28/39 co-relation queries the response was YES. [2022-12-06 06:29:27,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 272 events. 86/272 cut-off events. For 28/39 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1526 event pairs, 44 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 491. Up to 131 conditions per place. [2022-12-06 06:29:27,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 108 flow [2022-12-06 06:29:27,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 06:29:27,099 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:27,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 06:29:27,102 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 108 flow [2022-12-06 06:29:27,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 06:29:27,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:27,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:27,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:29:27,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1547308902, now seen corresponding path program 1 times [2022-12-06 06:29:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114520455] [2022-12-06 06:29:27,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:27,374 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 06:29:27,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:27,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114520455] [2022-12-06 06:29:27,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114520455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:27,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:27,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640244034] [2022-12-06 06:29:27,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:27,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:27,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:27,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:27,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:29:27,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 06:29:27,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:27,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:29:27,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:28,651 INFO L130 PetriNetUnfolder]: 7718/11288 cut-off events. [2022-12-06 06:29:28,651 INFO L131 PetriNetUnfolder]: For 2322/2379 co-relation queries the response was YES. [2022-12-06 06:29:28,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25538 conditions, 11288 events. 7718/11288 cut-off events. For 2322/2379 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 68954 event pairs, 1393 based on Foata normal form. 760/11662 useless extension candidates. Maximal degree in co-relation 25526. Up to 5028 conditions per place. [2022-12-06 06:29:28,702 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 57 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2022-12-06 06:29:28,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 338 flow [2022-12-06 06:29:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 06:29:28,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-06 06:29:28,704 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 108 flow. Second operand 4 states and 71 transitions. [2022-12-06 06:29:28,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 338 flow [2022-12-06 06:29:28,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:28,712 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 142 flow [2022-12-06 06:29:28,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 06:29:28,713 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2022-12-06 06:29:28,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:28,713 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 142 flow [2022-12-06 06:29:28,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:28,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:28,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 142 flow [2022-12-06 06:29:28,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 142 flow [2022-12-06 06:29:28,787 INFO L130 PetriNetUnfolder]: 455/988 cut-off events. [2022-12-06 06:29:28,787 INFO L131 PetriNetUnfolder]: For 111/138 co-relation queries the response was YES. [2022-12-06 06:29:28,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 988 events. 455/988 cut-off events. For 111/138 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 7240 event pairs, 204 based on Foata normal form. 0/836 useless extension candidates. Maximal degree in co-relation 2079. Up to 635 conditions per place. [2022-12-06 06:29:28,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 142 flow [2022-12-06 06:29:28,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 596 [2022-12-06 06:29:29,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:29,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-06 06:29:29,024 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 144 flow [2022-12-06 06:29:29,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 06:29:29,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:29,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:29,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:29:29,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1945257935, now seen corresponding path program 1 times [2022-12-06 06:29:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:29,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841427765] [2022-12-06 06:29:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:29,244 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 06:29:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:29,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841427765] [2022-12-06 06:29:29,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841427765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:29,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:29,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:29:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612595219] [2022-12-06 06:29:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:29,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:29,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:29,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:29,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:29:29,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 06:29:29,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:29,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:29:29,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:30,127 INFO L130 PetriNetUnfolder]: 4196/6411 cut-off events. [2022-12-06 06:29:30,128 INFO L131 PetriNetUnfolder]: For 2578/2581 co-relation queries the response was YES. [2022-12-06 06:29:30,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17591 conditions, 6411 events. 4196/6411 cut-off events. For 2578/2581 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 37808 event pairs, 638 based on Foata normal form. 516/6731 useless extension candidates. Maximal degree in co-relation 17577. Up to 2427 conditions per place. [2022-12-06 06:29:30,171 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 72 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2022-12-06 06:29:30,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 88 transitions, 459 flow [2022-12-06 06:29:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:29:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:29:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 06:29:30,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 06:29:30,173 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 144 flow. Second operand 5 states and 91 transitions. [2022-12-06 06:29:30,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 88 transitions, 459 flow [2022-12-06 06:29:30,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 88 transitions, 448 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:30,178 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 195 flow [2022-12-06 06:29:30,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-06 06:29:30,179 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2022-12-06 06:29:30,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:30,179 INFO L89 Accepts]: Start accepts. Operand has 47 places, 41 transitions, 195 flow [2022-12-06 06:29:30,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:30,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:30,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 41 transitions, 195 flow [2022-12-06 06:29:30,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 195 flow [2022-12-06 06:29:30,248 INFO L130 PetriNetUnfolder]: 275/688 cut-off events. [2022-12-06 06:29:30,248 INFO L131 PetriNetUnfolder]: For 641/775 co-relation queries the response was YES. [2022-12-06 06:29:30,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 688 events. 275/688 cut-off events. For 641/775 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4849 event pairs, 55 based on Foata normal form. 20/647 useless extension candidates. Maximal degree in co-relation 2022. Up to 424 conditions per place. [2022-12-06 06:29:30,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 195 flow [2022-12-06 06:29:30,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 702 [2022-12-06 06:29:30,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:30,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 268 [2022-12-06 06:29:30,447 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 199 flow [2022-12-06 06:29:30,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 06:29:30,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:30,448 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 06:29:30,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:29:30,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1349811995, now seen corresponding path program 1 times [2022-12-06 06:29:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:30,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743350874] [2022-12-06 06:29:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:30,650 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 06:29:30,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:30,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743350874] [2022-12-06 06:29:30,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743350874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:30,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:30,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:29:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559684152] [2022-12-06 06:29:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:30,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:29:30,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:30,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:29:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:29:30,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:29:30,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:30,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:30,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:29:30,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:31,179 INFO L130 PetriNetUnfolder]: 2613/4057 cut-off events. [2022-12-06 06:29:31,179 INFO L131 PetriNetUnfolder]: For 3883/3886 co-relation queries the response was YES. [2022-12-06 06:29:31,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12502 conditions, 4057 events. 2613/4057 cut-off events. For 3883/3886 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22943 event pairs, 591 based on Foata normal form. 184/4094 useless extension candidates. Maximal degree in co-relation 12486. Up to 1434 conditions per place. [2022-12-06 06:29:31,199 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 85 selfloop transitions, 14 changer transitions 0/105 dead transitions. [2022-12-06 06:29:31,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 105 transitions, 598 flow [2022-12-06 06:29:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:29:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:29:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 06:29:31,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2022-12-06 06:29:31,201 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 199 flow. Second operand 6 states and 109 transitions. [2022-12-06 06:29:31,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 105 transitions, 598 flow [2022-12-06 06:29:31,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 105 transitions, 568 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 06:29:31,261 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 245 flow [2022-12-06 06:29:31,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-06 06:29:31,262 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-06 06:29:31,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:31,263 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 245 flow [2022-12-06 06:29:31,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:31,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:31,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 245 flow [2022-12-06 06:29:31,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 245 flow [2022-12-06 06:29:31,295 INFO L130 PetriNetUnfolder]: 157/422 cut-off events. [2022-12-06 06:29:31,295 INFO L131 PetriNetUnfolder]: For 812/886 co-relation queries the response was YES. [2022-12-06 06:29:31,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 422 events. 157/422 cut-off events. For 812/886 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2536 event pairs, 15 based on Foata normal form. 23/418 useless extension candidates. Maximal degree in co-relation 1407. Up to 210 conditions per place. [2022-12-06 06:29:31,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 245 flow [2022-12-06 06:29:31,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 702 [2022-12-06 06:29:31,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:31,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 06:29:31,461 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 251 flow [2022-12-06 06:29:31,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:31,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:31,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:31,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:29:31,462 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1143579080, now seen corresponding path program 1 times [2022-12-06 06:29:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:31,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451562927] [2022-12-06 06:29:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:31,724 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 06:29:31,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:31,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451562927] [2022-12-06 06:29:31,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451562927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:31,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:31,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843669177] [2022-12-06 06:29:31,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:31,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:31,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:31,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:31,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:29:31,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 251 flow. Second operand has 4 states, 3 states have (on average 7.666666666666667) 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 06:29:31,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:31,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:29:31,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:32,323 INFO L130 PetriNetUnfolder]: 4120/6116 cut-off events. [2022-12-06 06:29:32,324 INFO L131 PetriNetUnfolder]: For 7834/7834 co-relation queries the response was YES. [2022-12-06 06:29:32,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19437 conditions, 6116 events. 4120/6116 cut-off events. For 7834/7834 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 31848 event pairs, 166 based on Foata normal form. 14/6130 useless extension candidates. Maximal degree in co-relation 19420. Up to 2681 conditions per place. [2022-12-06 06:29:32,344 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 105 selfloop transitions, 14 changer transitions 2/121 dead transitions. [2022-12-06 06:29:32,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 121 transitions, 928 flow [2022-12-06 06:29:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:29:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:29:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-06 06:29:32,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429 [2022-12-06 06:29:32,347 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 251 flow. Second operand 5 states and 83 transitions. [2022-12-06 06:29:32,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 121 transitions, 928 flow [2022-12-06 06:29:32,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 121 transitions, 780 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-06 06:29:32,392 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 293 flow [2022-12-06 06:29:32,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2022-12-06 06:29:32,394 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2022-12-06 06:29:32,394 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:32,394 INFO L89 Accepts]: Start accepts. Operand has 52 places, 53 transitions, 293 flow [2022-12-06 06:29:32,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:32,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:32,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 53 transitions, 293 flow [2022-12-06 06:29:32,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 293 flow [2022-12-06 06:29:32,436 INFO L130 PetriNetUnfolder]: 185/498 cut-off events. [2022-12-06 06:29:32,437 INFO L131 PetriNetUnfolder]: For 412/551 co-relation queries the response was YES. [2022-12-06 06:29:32,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 498 events. 185/498 cut-off events. For 412/551 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3097 event pairs, 10 based on Foata normal form. 34/502 useless extension candidates. Maximal degree in co-relation 1425. Up to 169 conditions per place. [2022-12-06 06:29:32,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 293 flow [2022-12-06 06:29:32,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 886 [2022-12-06 06:29:32,452 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:32,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 06:29:32,452 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 293 flow [2022-12-06 06:29:32,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) 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 06:29:32,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:32,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:32,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:29:32,453 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash -118585836, now seen corresponding path program 2 times [2022-12-06 06:29:32,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:32,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896164384] [2022-12-06 06:29:32,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:32,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:32,729 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 06:29:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:32,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896164384] [2022-12-06 06:29:32,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896164384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:32,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:32,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:29:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736680148] [2022-12-06 06:29:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:32,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:29:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:29:32,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:29:32,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:29:32,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 293 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:32,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:32,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:29:32,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:33,190 INFO L130 PetriNetUnfolder]: 2939/4534 cut-off events. [2022-12-06 06:29:33,190 INFO L131 PetriNetUnfolder]: For 4771/4914 co-relation queries the response was YES. [2022-12-06 06:29:33,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14019 conditions, 4534 events. 2939/4534 cut-off events. For 4771/4914 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 26300 event pairs, 682 based on Foata normal form. 59/4426 useless extension candidates. Maximal degree in co-relation 14000. Up to 1836 conditions per place. [2022-12-06 06:29:33,213 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 78 selfloop transitions, 18 changer transitions 2/109 dead transitions. [2022-12-06 06:29:33,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 109 transitions, 727 flow [2022-12-06 06:29:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:29:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:29:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-12-06 06:29:33,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:29:33,219 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 293 flow. Second operand 7 states and 99 transitions. [2022-12-06 06:29:33,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 109 transitions, 727 flow [2022-12-06 06:29:33,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 109 transitions, 727 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:29:33,289 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 351 flow [2022-12-06 06:29:33,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2022-12-06 06:29:33,290 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2022-12-06 06:29:33,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:33,291 INFO L89 Accepts]: Start accepts. Operand has 60 places, 54 transitions, 351 flow [2022-12-06 06:29:33,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:33,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:33,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 54 transitions, 351 flow [2022-12-06 06:29:33,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 54 transitions, 351 flow [2022-12-06 06:29:33,327 INFO L130 PetriNetUnfolder]: 173/431 cut-off events. [2022-12-06 06:29:33,328 INFO L131 PetriNetUnfolder]: For 744/854 co-relation queries the response was YES. [2022-12-06 06:29:33,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 431 events. 173/431 cut-off events. For 744/854 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2511 event pairs, 6 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 1501. Up to 130 conditions per place. [2022-12-06 06:29:33,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 54 transitions, 351 flow [2022-12-06 06:29:33,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 816 [2022-12-06 06:29:33,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork0_#res.offset_15| 0) (= |v_P3Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_15|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [521] L868-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_593 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd0~0_236 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_232 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_594 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_514 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|) (= v_~a$r_buff1_thd0~0_235 (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd0~0_231 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_513 256) 0)) .cse1)) 0 v_~a$r_buff1_thd0~0_236)) (= (ite .cse2 0 v_~a$w_buff0_used~0_594) v_~a$w_buff0_used~0_593) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_514) v_~a$w_buff1_used~0_513) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_62 0) (= v_~__unbuffered_p2_EAX~0_60 0) (= v_~x~0_77 2) (= v_~__unbuffered_p3_EAX~0_76 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_66) (= v_~a~0_440 (ite .cse2 v_~a$w_buff0~0_330 (ite .cse3 v_~a$w_buff1~0_282 v_~a~0_441))) (= (ite .cse4 0 v_~a$r_buff0_thd0~0_232) v_~a$r_buff0_thd0~0_231) (= v_~main$tmp_guard0~0_94 (ite (= (ite (= v_~__unbuffered_cnt~0_251 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= (mod v_~main$tmp_guard0~0_94 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0))))) InVars {~a$w_buff0_used~0=v_~a$w_buff0_used~0_594, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_232, ~a~0=v_~a~0_441, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_282, ~a$w_buff0~0=v_~a$w_buff0~0_330, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_236, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_60, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_514, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_65|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_593, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_231, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_94, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_59|, ~a~0=v_~a~0_440, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_282, ~a$w_buff0~0=v_~a$w_buff0~0_330, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_235, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_60, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_513, ~x~0=v_~x~0_77, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:29:34,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L811-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] and [521] L868-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_593 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd0~0_236 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_232 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_594 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_514 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|) (= v_~a$r_buff1_thd0~0_235 (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd0~0_231 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_513 256) 0)) .cse1)) 0 v_~a$r_buff1_thd0~0_236)) (= (ite .cse2 0 v_~a$w_buff0_used~0_594) v_~a$w_buff0_used~0_593) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_514) v_~a$w_buff1_used~0_513) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_62 0) (= v_~__unbuffered_p2_EAX~0_60 0) (= v_~x~0_77 2) (= v_~__unbuffered_p3_EAX~0_76 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_66) (= v_~a~0_440 (ite .cse2 v_~a$w_buff0~0_330 (ite .cse3 v_~a$w_buff1~0_282 v_~a~0_441))) (= (ite .cse4 0 v_~a$r_buff0_thd0~0_232) v_~a$r_buff0_thd0~0_231) (= v_~main$tmp_guard0~0_94 (ite (= (ite (= v_~__unbuffered_cnt~0_251 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= (mod v_~main$tmp_guard0~0_94 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0))))) InVars {~a$w_buff0_used~0=v_~a$w_buff0_used~0_594, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_232, ~a~0=v_~a~0_441, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_282, ~a$w_buff0~0=v_~a$w_buff0~0_330, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_236, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_60, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_514, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_65|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_593, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_231, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_94, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_59|, ~a~0=v_~a~0_440, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_282, ~a$w_buff0~0=v_~a$w_buff0~0_330, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_235, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_60, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_513, ~x~0=v_~x~0_77, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:29:34,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L791-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_17| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P1Thread1of1ForFork1_#res.offset_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [521] L868-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_593 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd0~0_236 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_232 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_594 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_514 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|) (= v_~a$r_buff1_thd0~0_235 (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd0~0_231 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_513 256) 0)) .cse1)) 0 v_~a$r_buff1_thd0~0_236)) (= (ite .cse2 0 v_~a$w_buff0_used~0_594) v_~a$w_buff0_used~0_593) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_514) v_~a$w_buff1_used~0_513) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_62 0) (= v_~__unbuffered_p2_EAX~0_60 0) (= v_~x~0_77 2) (= v_~__unbuffered_p3_EAX~0_76 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_66) (= v_~a~0_440 (ite .cse2 v_~a$w_buff0~0_330 (ite .cse3 v_~a$w_buff1~0_282 v_~a~0_441))) (= (ite .cse4 0 v_~a$r_buff0_thd0~0_232) v_~a$r_buff0_thd0~0_231) (= v_~main$tmp_guard0~0_94 (ite (= (ite (= v_~__unbuffered_cnt~0_251 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= (mod v_~main$tmp_guard0~0_94 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0))))) InVars {~a$w_buff0_used~0=v_~a$w_buff0_used~0_594, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_232, ~a~0=v_~a~0_441, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_282, ~a$w_buff0~0=v_~a$w_buff0~0_330, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_236, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_60, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_514, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_65|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_593, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_231, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_94, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_59|, ~a~0=v_~a~0_440, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_282, ~a$w_buff0~0=v_~a$w_buff0~0_330, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_235, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_60, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_513, ~x~0=v_~x~0_77, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:29:34,608 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L771-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P0Thread1of1ForFork3_#res#1.base_15| 0) (= |v_P0Thread1of1ForFork3_#res#1.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P0Thread1of1ForFork3_#res#1.offset=|v_P0Thread1of1ForFork3_#res#1.offset_15|, P0Thread1of1ForFork3_#res#1.base=|v_P0Thread1of1ForFork3_#res#1.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res#1.offset, P0Thread1of1ForFork3_#res#1.base, ~__unbuffered_cnt~0] and [521] L868-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_593 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd0~0_236 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_232 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_594 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_514 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|) (= v_~a$r_buff1_thd0~0_235 (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd0~0_231 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_513 256) 0)) .cse1)) 0 v_~a$r_buff1_thd0~0_236)) (= (ite .cse2 0 v_~a$w_buff0_used~0_594) v_~a$w_buff0_used~0_593) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_514) v_~a$w_buff1_used~0_513) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_62 0) (= v_~__unbuffered_p2_EAX~0_60 0) (= v_~x~0_77 2) (= v_~__unbuffered_p3_EAX~0_76 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_66) (= v_~a~0_440 (ite .cse2 v_~a$w_buff0~0_330 (ite .cse3 v_~a$w_buff1~0_282 v_~a~0_441))) (= (ite .cse4 0 v_~a$r_buff0_thd0~0_232) v_~a$r_buff0_thd0~0_231) (= v_~main$tmp_guard0~0_94 (ite (= (ite (= v_~__unbuffered_cnt~0_251 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= (mod v_~main$tmp_guard0~0_94 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0))))) InVars {~a$w_buff0_used~0=v_~a$w_buff0_used~0_594, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_232, ~a~0=v_~a~0_441, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_282, ~a$w_buff0~0=v_~a$w_buff0~0_330, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_236, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_60, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_514, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_65|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_593, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_231, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_94, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_59|, ~a~0=v_~a~0_440, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_282, ~a$w_buff0~0=v_~a$w_buff0~0_330, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_235, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_60, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_513, ~x~0=v_~x~0_77, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:29:34,842 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:29:34,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1553 [2022-12-06 06:29:34,843 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 371 flow [2022-12-06 06:29:34,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:34,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:34,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:34,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:29:34,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 368527814, now seen corresponding path program 1 times [2022-12-06 06:29:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:34,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538065513] [2022-12-06 06:29:34,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:35,151 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 06:29:35,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:35,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538065513] [2022-12-06 06:29:35,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538065513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:35,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:35,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:35,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780876918] [2022-12-06 06:29:35,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:35,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:35,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:35,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:35,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:29:35,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 371 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:35,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:35,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:29:35,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:35,732 INFO L130 PetriNetUnfolder]: 4268/6475 cut-off events. [2022-12-06 06:29:35,733 INFO L131 PetriNetUnfolder]: For 11757/11897 co-relation queries the response was YES. [2022-12-06 06:29:35,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22657 conditions, 6475 events. 4268/6475 cut-off events. For 11757/11897 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 37390 event pairs, 1298 based on Foata normal form. 25/6401 useless extension candidates. Maximal degree in co-relation 22634. Up to 2582 conditions per place. [2022-12-06 06:29:35,755 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 58 selfloop transitions, 1 changer transitions 26/93 dead transitions. [2022-12-06 06:29:35,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 796 flow [2022-12-06 06:29:35,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 06:29:35,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2022-12-06 06:29:35,757 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 371 flow. Second operand 4 states and 59 transitions. [2022-12-06 06:29:35,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 796 flow [2022-12-06 06:29:35,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 617 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-06 06:29:35,833 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 269 flow [2022-12-06 06:29:35,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2022-12-06 06:29:35,833 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2022-12-06 06:29:35,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:35,834 INFO L89 Accepts]: Start accepts. Operand has 52 places, 49 transitions, 269 flow [2022-12-06 06:29:35,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:35,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:35,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 269 flow [2022-12-06 06:29:35,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 269 flow [2022-12-06 06:29:35,856 INFO L130 PetriNetUnfolder]: 136/359 cut-off events. [2022-12-06 06:29:35,856 INFO L131 PetriNetUnfolder]: For 205/265 co-relation queries the response was YES. [2022-12-06 06:29:35,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 359 events. 136/359 cut-off events. For 205/265 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2176 event pairs, 2 based on Foata normal form. 4/338 useless extension candidates. Maximal degree in co-relation 826. Up to 100 conditions per place. [2022-12-06 06:29:35,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 269 flow [2022-12-06 06:29:35,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-06 06:29:36,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:36,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 648 [2022-12-06 06:29:36,482 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 273 flow [2022-12-06 06:29:36,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:36,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:36,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:36,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:29:36,482 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash -705590061, now seen corresponding path program 1 times [2022-12-06 06:29:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:36,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158492579] [2022-12-06 06:29:36,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:36,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:37,574 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 06:29:37,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:37,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158492579] [2022-12-06 06:29:37,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158492579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:37,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:37,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:29:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246571753] [2022-12-06 06:29:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:37,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:29:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:37,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:29:37,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:29:37,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 06:29:37,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 273 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 06:29:37,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:37,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 06:29:37,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:38,359 INFO L130 PetriNetUnfolder]: 2808/4460 cut-off events. [2022-12-06 06:29:38,359 INFO L131 PetriNetUnfolder]: For 5313/5448 co-relation queries the response was YES. [2022-12-06 06:29:38,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12975 conditions, 4460 events. 2808/4460 cut-off events. For 5313/5448 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 27130 event pairs, 297 based on Foata normal form. 12/4410 useless extension candidates. Maximal degree in co-relation 12956. Up to 2001 conditions per place. [2022-12-06 06:29:38,376 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 69 selfloop transitions, 7 changer transitions 30/117 dead transitions. [2022-12-06 06:29:38,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 117 transitions, 790 flow [2022-12-06 06:29:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:29:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:29:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-06 06:29:38,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2022-12-06 06:29:38,378 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 273 flow. Second operand 6 states and 91 transitions. [2022-12-06 06:29:38,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 117 transitions, 790 flow [2022-12-06 06:29:38,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 117 transitions, 773 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:38,386 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 287 flow [2022-12-06 06:29:38,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-06 06:29:38,386 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2022-12-06 06:29:38,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:38,387 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 287 flow [2022-12-06 06:29:38,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:38,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:38,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 287 flow [2022-12-06 06:29:38,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 48 transitions, 287 flow [2022-12-06 06:29:38,427 INFO L130 PetriNetUnfolder]: 142/373 cut-off events. [2022-12-06 06:29:38,427 INFO L131 PetriNetUnfolder]: For 287/312 co-relation queries the response was YES. [2022-12-06 06:29:38,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 373 events. 142/373 cut-off events. For 287/312 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2309 event pairs, 2 based on Foata normal form. 3/354 useless extension candidates. Maximal degree in co-relation 913. Up to 108 conditions per place. [2022-12-06 06:29:38,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 48 transitions, 287 flow [2022-12-06 06:29:38,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 622 [2022-12-06 06:29:39,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:39,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 776 [2022-12-06 06:29:39,163 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 292 flow [2022-12-06 06:29:39,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 06:29:39,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:39,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:39,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:29:39,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash -364375167, now seen corresponding path program 1 times [2022-12-06 06:29:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:39,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539917014] [2022-12-06 06:29:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:39,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:29:39,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:29:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:29:39,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:29:39,337 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:29:39,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:29:39,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:29:39,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:29:39,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:29:39,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:29:39,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:29:39,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:29:39,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:29:39,341 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:39,346 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:29:39,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:29:39,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:29:39 BasicIcfg [2022-12-06 06:29:39,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:29:39,449 INFO L158 Benchmark]: Toolchain (without parser) took 23087.29ms. Allocated memory was 181.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 155.1MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 884.6MB. Max. memory is 8.0GB. [2022-12-06 06:29:39,449 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 157.8MB in the beginning and 157.8MB in the end (delta: 80.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:29:39,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.47ms. Allocated memory is still 181.4MB. Free memory was 155.1MB in the beginning and 127.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:29:39,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.41ms. Allocated memory is still 181.4MB. Free memory was 127.3MB in the beginning and 124.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:29:39,450 INFO L158 Benchmark]: Boogie Preprocessor took 50.74ms. Allocated memory is still 181.4MB. Free memory was 124.7MB in the beginning and 122.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:29:39,450 INFO L158 Benchmark]: RCFGBuilder took 820.05ms. Allocated memory is still 181.4MB. Free memory was 122.6MB in the beginning and 85.4MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-06 06:29:39,451 INFO L158 Benchmark]: TraceAbstraction took 21597.24ms. Allocated memory was 181.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 84.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 814.4MB. Max. memory is 8.0GB. [2022-12-06 06:29:39,452 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 157.8MB in the beginning and 157.8MB in the end (delta: 80.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 563.47ms. Allocated memory is still 181.4MB. Free memory was 155.1MB in the beginning and 127.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.41ms. Allocated memory is still 181.4MB. Free memory was 127.3MB in the beginning and 124.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.74ms. Allocated memory is still 181.4MB. Free memory was 124.7MB in the beginning and 122.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 820.05ms. Allocated memory is still 181.4MB. Free memory was 122.6MB in the beginning and 85.4MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 21597.24ms. Allocated memory was 181.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 84.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 814.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 136 PlacesBefore, 48 PlacesAfterwards, 125 TransitionsBefore, 36 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 51 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2253, independent: 2187, independent conditional: 2187, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2253, independent: 2187, independent conditional: 0, independent unconditional: 2187, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2253, independent: 2187, independent conditional: 0, independent unconditional: 2187, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2253, independent: 2187, independent conditional: 0, independent unconditional: 2187, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1837, independent: 1785, independent conditional: 0, independent unconditional: 1785, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1837, independent: 1760, independent conditional: 0, independent unconditional: 1760, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 369, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 337, dependent conditional: 0, dependent unconditional: 337, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2253, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1837, unknown conditional: 0, unknown unconditional: 1837] , Statistics on independence cache: Total cache size (in pairs): 2841, Positive cache size: 2789, Positive conditional cache size: 0, Positive unconditional cache size: 2789, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, 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, 39 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 330, independent: 273, independent conditional: 273, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 330, independent: 273, independent conditional: 42, independent unconditional: 231, dependent: 57, dependent conditional: 22, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 330, independent: 273, independent conditional: 42, independent unconditional: 231, dependent: 57, dependent conditional: 22, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 330, independent: 273, independent conditional: 42, independent unconditional: 231, dependent: 57, dependent conditional: 22, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 163, independent: 138, independent conditional: 21, independent unconditional: 117, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 163, independent: 131, independent conditional: 0, independent unconditional: 131, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 92, dependent conditional: 56, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, independent: 135, independent conditional: 21, independent unconditional: 114, dependent: 32, dependent conditional: 12, dependent unconditional: 20, unknown: 163, unknown conditional: 31, unknown unconditional: 132] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 139, Positive conditional cache size: 22, Positive unconditional cache size: 117, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, 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, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 141, independent conditional: 141, 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: 160, independent: 141, independent conditional: 24, independent unconditional: 117, 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: 160, independent: 141, independent conditional: 0, independent unconditional: 141, 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: 160, independent: 141, independent conditional: 0, independent unconditional: 141, 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: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 153, Positive conditional cache size: 22, Positive unconditional cache size: 131, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 185, independent conditional: 185, 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: 223, independent: 185, independent conditional: 20, independent unconditional: 165, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 185, independent conditional: 12, independent unconditional: 173, 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: 223, independent: 185, independent conditional: 12, independent unconditional: 173, 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: 15, independent: 14, independent conditional: 1, independent unconditional: 13, 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: 15, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 223, independent: 171, independent conditional: 11, independent unconditional: 160, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 15, unknown conditional: 1, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 167, Positive conditional cache size: 23, Positive unconditional cache size: 144, Negative cache size: 32, Negative conditional cache size: 10, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 214, independent: 168, independent conditional: 32, independent unconditional: 136, dependent: 46, dependent conditional: 4, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, independent: 168, independent conditional: 12, independent unconditional: 156, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 218, independent: 168, independent conditional: 12, independent unconditional: 156, dependent: 50, dependent conditional: 0, dependent unconditional: 50, 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: 218, independent: 168, independent conditional: 12, independent unconditional: 156, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 167, Positive conditional cache size: 23, Positive unconditional cache size: 144, Negative cache size: 33, Negative conditional cache size: 10, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 50 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 236, independent: 180, independent conditional: 32, independent unconditional: 148, dependent: 56, dependent conditional: 4, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 240, independent: 180, independent conditional: 12, independent unconditional: 168, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 240, independent: 180, independent conditional: 12, independent unconditional: 168, dependent: 60, dependent conditional: 0, dependent unconditional: 60, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, independent: 180, independent conditional: 12, independent unconditional: 168, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 167, Positive conditional cache size: 23, Positive unconditional cache size: 144, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 886 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 176, independent conditional: 176, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 176, independent conditional: 89, independent unconditional: 87, dependent: 34, dependent conditional: 6, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 176, independent conditional: 23, independent unconditional: 153, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 176, independent conditional: 23, independent unconditional: 153, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 170, independent conditional: 23, independent unconditional: 147, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 173, Positive conditional cache size: 23, Positive unconditional cache size: 150, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 60 PlacesBefore, 57 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 336, independent: 268, independent conditional: 268, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 336, independent: 268, independent conditional: 92, independent unconditional: 176, dependent: 68, dependent conditional: 8, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 336, independent: 268, independent conditional: 16, independent unconditional: 252, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 336, independent: 268, independent conditional: 16, independent unconditional: 252, dependent: 68, dependent conditional: 0, dependent unconditional: 68, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 336, independent: 268, independent conditional: 16, independent unconditional: 252, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 174, Positive conditional cache size: 23, Positive unconditional cache size: 151, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 84, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 51 PlacesBefore, 50 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 284, independent: 222, independent conditional: 222, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 284, independent: 222, independent conditional: 72, independent unconditional: 150, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 284, independent: 222, independent conditional: 30, independent unconditional: 192, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 284, independent: 222, independent conditional: 30, independent unconditional: 192, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 284, independent: 218, independent conditional: 27, independent unconditional: 191, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 184, Positive conditional cache size: 26, Positive unconditional cache size: 158, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 53 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 270, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 270, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 270, independent: 216, independent conditional: 192, independent unconditional: 24, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 270, independent: 216, independent conditional: 192, independent unconditional: 24, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 270, independent: 206, independent conditional: 182, independent unconditional: 24, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 242, Positive conditional cache size: 36, Positive unconditional cache size: 206, Negative cache size: 41, Negative conditional cache size: 16, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-3, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=-2, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=-1, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L870] 3 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L872] RET 3 assume_abort_if_not(main$tmp_guard0) [L874] 3 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 3 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 3 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L881] 3 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L883] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - 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: 864]: 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: 862]: 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: 868]: 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: 866]: 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 9 procedures, 165 locations, 7 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: 21.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 556 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 880 IncrementalHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 10 mSDtfsCounter, 880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=7, InterpolantAutomatonStates: 43, 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.7s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 06:29:39,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...