/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:09:21,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:09:21,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:09:21,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:09:21,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:09:21,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:09:21,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:09:21,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:09:21,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:09:21,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:09:21,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:09:21,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:09:21,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:09:21,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:09:21,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:09:21,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:09:21,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:09:21,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:09:21,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:09:21,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:09:21,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:09:21,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:09:21,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:09:21,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:09:21,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:09:21,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:09:21,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:09:21,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:09:21,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:09:21,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:09:21,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:09:21,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:09:21,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:09:21,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:09:21,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:09:21,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:09:21,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:09:21,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:09:21,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:09:21,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:09:21,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:09:21,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:09:21,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:09:21,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:09:21,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:09:21,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:09:21,650 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:09:21,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:09:21,651 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:09:21,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:09:21,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:09:21,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:09:21,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:09:21,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:09:21,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:09:21,653 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:09:21,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:09:21,653 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:09:21,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:09:21,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:09:21,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:09:21,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:09:21,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:09:21,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:21,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:09:21,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:09:21,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:09:21,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:09:21,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:09:21,654 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:09:21,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:09:22,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:09:22,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:09:22,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:09:22,088 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:09:22,088 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:09:22,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2022-12-06 04:09:23,119 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:09:23,350 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:09:23,351 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2022-12-06 04:09:23,376 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d2018d2/89768f4fcbe5482385530ddba00eaac6/FLAGc74b952b0 [2022-12-06 04:09:23,387 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d2018d2/89768f4fcbe5482385530ddba00eaac6 [2022-12-06 04:09:23,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:09:23,390 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:09:23,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:23,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:09:23,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:09:23,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b42c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23, skipping insertion in model container [2022-12-06 04:09:23,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:09:23,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:09:23,588 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/mix019.opt.i[944,957] [2022-12-06 04:09:23,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:23,798 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:09:23,809 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/mix019.opt.i[944,957] [2022-12-06 04:09:23,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:23,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:23,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:23,889 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:09:23,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23 WrapperNode [2022-12-06 04:09:23,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:23,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:23,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:09:23,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:09:23,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,947 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-06 04:09:23,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:23,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:09:23,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:09:23,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:09:23,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,990 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:23,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:09:24,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:09:24,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:09:24,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:09:24,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (1/1) ... [2022-12-06 04:09:24,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:24,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:09:24,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:09:24,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:09:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:09:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:09:24,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:09:24,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:09:24,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:09:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:09:24,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:09:24,082 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:09:24,233 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:09:24,234 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:09:24,573 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:09:24,665 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:09:24,665 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:09:24,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:24 BoogieIcfgContainer [2022-12-06 04:09:24,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:09:24,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:09:24,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:09:24,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:09:24,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:09:23" (1/3) ... [2022-12-06 04:09:24,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ea6f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:24, skipping insertion in model container [2022-12-06 04:09:24,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:23" (2/3) ... [2022-12-06 04:09:24,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ea6f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:24, skipping insertion in model container [2022-12-06 04:09:24,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:24" (3/3) ... [2022-12-06 04:09:24,706 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2022-12-06 04:09:24,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:09:24,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:09:24,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:09:24,755 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:09:24,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 04:09:24,810 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:09:24,810 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:24,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 04:09:24,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 04:09:24,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 04:09:24,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:24,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 04:09:24,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 04:09:24,851 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:09:24,851 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:24,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 04:09:24,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 04:09:24,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-06 04:09:28,428 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-06 04:09:28,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:09:28,443 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;@3ea200a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:09:28,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:09:28,446 INFO L130 PetriNetUnfolder]: 1/13 cut-off events. [2022-12-06 04:09:28,446 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:28,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:28,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:28,447 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 711291865, now seen corresponding path program 1 times [2022-12-06 04:09:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:28,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227319895] [2022-12-06 04:09:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:28,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:28,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227319895] [2022-12-06 04:09:28,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227319895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:28,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:28,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843432894] [2022-12-06 04:09:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:28,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:28,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:28,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:09:28,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:28,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:28,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:09:28,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:29,100 INFO L130 PetriNetUnfolder]: 777/1241 cut-off events. [2022-12-06 04:09:29,101 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 04:09:29,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 1241 events. 777/1241 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5898 event pairs, 129 based on Foata normal form. 0/1120 useless extension candidates. Maximal degree in co-relation 2435. Up to 937 conditions per place. [2022-12-06 04:09:29,112 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 24 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 04:09:29,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2022-12-06 04:09:29,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 04:09:29,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 04:09:29,123 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 41 transitions. [2022-12-06 04:09:29,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2022-12-06 04:09:29,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:29,128 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-06 04:09:29,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 04:09:29,132 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 04:09:29,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:29,133 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-06 04:09:29,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:29,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:29,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-06 04:09:29,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 04:09:29,141 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:09:29,141 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:29,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:09:29,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 04:09:29,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 04:09:29,233 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:29,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 04:09:29,236 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 04:09:29,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:29,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:29,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:29,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:09:29,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:29,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 651682052, now seen corresponding path program 1 times [2022-12-06 04:09:29,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:29,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341275633] [2022-12-06 04:09:29,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:29,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:29,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341275633] [2022-12-06 04:09:29,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341275633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:29,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:29,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949374335] [2022-12-06 04:09:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:29,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:29,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:09:29,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:29,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:29,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:09:29,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:29,711 INFO L130 PetriNetUnfolder]: 1119/1724 cut-off events. [2022-12-06 04:09:29,712 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 04:09:29,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1724 events. 1119/1724 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7804 event pairs, 363 based on Foata normal form. 52/1776 useless extension candidates. Maximal degree in co-relation 3580. Up to 1221 conditions per place. [2022-12-06 04:09:29,718 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 29 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-12-06 04:09:29,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 154 flow [2022-12-06 04:09:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:09:29,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:09:29,720 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:09:29,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 154 flow [2022-12-06 04:09:29,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:29,722 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2022-12-06 04:09:29,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-06 04:09:29,723 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 04:09:29,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:29,723 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 92 flow [2022-12-06 04:09:29,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:29,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:29,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 92 flow [2022-12-06 04:09:29,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 92 flow [2022-12-06 04:09:29,737 INFO L130 PetriNetUnfolder]: 48/148 cut-off events. [2022-12-06 04:09:29,737 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-06 04:09:29,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 148 events. 48/148 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 681 event pairs, 24 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 287. Up to 81 conditions per place. [2022-12-06 04:09:29,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 92 flow [2022-12-06 04:09:29,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:09:29,760 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:29,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 04:09:29,762 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2022-12-06 04:09:29,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:29,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:29,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:29,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:09:29,763 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1272691808, now seen corresponding path program 1 times [2022-12-06 04:09:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:29,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540591404] [2022-12-06 04:09:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:29,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540591404] [2022-12-06 04:09:29,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540591404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:29,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:29,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893867099] [2022-12-06 04:09:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:29,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:29,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:29,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:09:29,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:29,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:29,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:09:29,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:30,079 INFO L130 PetriNetUnfolder]: 1047/1616 cut-off events. [2022-12-06 04:09:30,080 INFO L131 PetriNetUnfolder]: For 674/674 co-relation queries the response was YES. [2022-12-06 04:09:30,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1616 events. 1047/1616 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6888 event pairs, 309 based on Foata normal form. 24/1640 useless extension candidates. Maximal degree in co-relation 4138. Up to 867 conditions per place. [2022-12-06 04:09:30,087 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 33 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2022-12-06 04:09:30,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 216 flow [2022-12-06 04:09:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 04:09:30,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 04:09:30,088 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 4 states and 38 transitions. [2022-12-06 04:09:30,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 216 flow [2022-12-06 04:09:30,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:30,093 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2022-12-06 04:09:30,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-06 04:09:30,094 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 04:09:30,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:30,094 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 128 flow [2022-12-06 04:09:30,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:30,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:30,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 128 flow [2022-12-06 04:09:30,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 128 flow [2022-12-06 04:09:30,107 INFO L130 PetriNetUnfolder]: 39/123 cut-off events. [2022-12-06 04:09:30,107 INFO L131 PetriNetUnfolder]: For 70/80 co-relation queries the response was YES. [2022-12-06 04:09:30,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 123 events. 39/123 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 520 event pairs, 14 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 292. Up to 68 conditions per place. [2022-12-06 04:09:30,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 128 flow [2022-12-06 04:09:30,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 04:09:30,116 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:30,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 04:09:30,117 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2022-12-06 04:09:30,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:30,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:30,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:30,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:09:30,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash -785439580, now seen corresponding path program 1 times [2022-12-06 04:09:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:30,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644145528] [2022-12-06 04:09:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:30,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:30,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644145528] [2022-12-06 04:09:30,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644145528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:30,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:30,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:30,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478782801] [2022-12-06 04:09:30,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:30,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:30,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:30,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:30,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:30,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:09:30,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 128 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:30,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:30,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:09:30,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:30,416 INFO L130 PetriNetUnfolder]: 1015/1568 cut-off events. [2022-12-06 04:09:30,416 INFO L131 PetriNetUnfolder]: For 1093/1093 co-relation queries the response was YES. [2022-12-06 04:09:30,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 1568 events. 1015/1568 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6927 event pairs, 211 based on Foata normal form. 8/1576 useless extension candidates. Maximal degree in co-relation 4300. Up to 1047 conditions per place. [2022-12-06 04:09:30,424 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 39 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2022-12-06 04:09:30,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 306 flow [2022-12-06 04:09:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 04:09:30,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:09:30,425 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 128 flow. Second operand 4 states and 48 transitions. [2022-12-06 04:09:30,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 306 flow [2022-12-06 04:09:30,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:30,428 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 197 flow [2022-12-06 04:09:30,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-06 04:09:30,429 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 04:09:30,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:30,429 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 197 flow [2022-12-06 04:09:30,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:30,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:30,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 197 flow [2022-12-06 04:09:30,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 197 flow [2022-12-06 04:09:30,439 INFO L130 PetriNetUnfolder]: 33/111 cut-off events. [2022-12-06 04:09:30,439 INFO L131 PetriNetUnfolder]: For 151/171 co-relation queries the response was YES. [2022-12-06 04:09:30,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 111 events. 33/111 cut-off events. For 151/171 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 459 event pairs, 13 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 327. Up to 60 conditions per place. [2022-12-06 04:09:30,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 197 flow [2022-12-06 04:09:30,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 04:09:30,441 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:30,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 04:09:30,442 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 197 flow [2022-12-06 04:09:30,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:30,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:30,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:30,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:09:30,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:30,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1421279226, now seen corresponding path program 1 times [2022-12-06 04:09:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:30,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365598564] [2022-12-06 04:09:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:30,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365598564] [2022-12-06 04:09:30,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365598564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:30,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:30,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708877901] [2022-12-06 04:09:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:30,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:30,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:09:30,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:30,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:30,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:09:30,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:30,723 INFO L130 PetriNetUnfolder]: 666/1136 cut-off events. [2022-12-06 04:09:30,723 INFO L131 PetriNetUnfolder]: For 1467/1530 co-relation queries the response was YES. [2022-12-06 04:09:30,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 1136 events. 666/1136 cut-off events. For 1467/1530 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5750 event pairs, 116 based on Foata normal form. 134/1247 useless extension candidates. Maximal degree in co-relation 3429. Up to 465 conditions per place. [2022-12-06 04:09:30,728 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 56 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-06 04:09:30,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 67 transitions, 505 flow [2022-12-06 04:09:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:09:30,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6375 [2022-12-06 04:09:30,729 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 197 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:09:30,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 67 transitions, 505 flow [2022-12-06 04:09:30,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 503 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:09:30,732 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 233 flow [2022-12-06 04:09:30,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-06 04:09:30,733 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-06 04:09:30,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:30,733 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 233 flow [2022-12-06 04:09:30,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:30,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:30,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 233 flow [2022-12-06 04:09:30,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 233 flow [2022-12-06 04:09:30,754 INFO L130 PetriNetUnfolder]: 105/301 cut-off events. [2022-12-06 04:09:30,754 INFO L131 PetriNetUnfolder]: For 238/270 co-relation queries the response was YES. [2022-12-06 04:09:30,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 301 events. 105/301 cut-off events. For 238/270 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1858 event pairs, 38 based on Foata normal form. 1/264 useless extension candidates. Maximal degree in co-relation 835. Up to 180 conditions per place. [2022-12-06 04:09:30,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 233 flow [2022-12-06 04:09:30,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 04:09:30,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:30,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 04:09:30,907 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 235 flow [2022-12-06 04:09:30,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:30,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:30,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:30,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:09:30,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash -927295863, now seen corresponding path program 1 times [2022-12-06 04:09:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:30,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498700092] [2022-12-06 04:09:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:30,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498700092] [2022-12-06 04:09:30,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498700092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:30,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:30,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206375489] [2022-12-06 04:09:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:30,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:30,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:30,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:09:30,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:30,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:30,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:09:30,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:31,121 INFO L130 PetriNetUnfolder]: 628/1108 cut-off events. [2022-12-06 04:09:31,121 INFO L131 PetriNetUnfolder]: For 1958/1958 co-relation queries the response was YES. [2022-12-06 04:09:31,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 1108 events. 628/1108 cut-off events. For 1958/1958 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5364 event pairs, 274 based on Foata normal form. 20/1119 useless extension candidates. Maximal degree in co-relation 4046. Up to 546 conditions per place. [2022-12-06 04:09:31,126 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 38 selfloop transitions, 6 changer transitions 5/51 dead transitions. [2022-12-06 04:09:31,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 395 flow [2022-12-06 04:09:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:09:31,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2022-12-06 04:09:31,127 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 235 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:09:31,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 395 flow [2022-12-06 04:09:31,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 380 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:31,131 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 223 flow [2022-12-06 04:09:31,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-06 04:09:31,132 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 04:09:31,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:31,132 INFO L89 Accepts]: Start accepts. Operand has 45 places, 33 transitions, 223 flow [2022-12-06 04:09:31,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:31,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:31,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 223 flow [2022-12-06 04:09:31,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 223 flow [2022-12-06 04:09:31,153 INFO L130 PetriNetUnfolder]: 94/270 cut-off events. [2022-12-06 04:09:31,153 INFO L131 PetriNetUnfolder]: For 304/313 co-relation queries the response was YES. [2022-12-06 04:09:31,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 270 events. 94/270 cut-off events. For 304/313 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1547 event pairs, 43 based on Foata normal form. 2/255 useless extension candidates. Maximal degree in co-relation 690. Up to 158 conditions per place. [2022-12-06 04:09:31,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 223 flow [2022-12-06 04:09:31,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-06 04:09:31,157 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:31,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 04:09:31,158 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 223 flow [2022-12-06 04:09:31,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:31,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:31,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:31,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:09:31,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash -345003491, now seen corresponding path program 1 times [2022-12-06 04:09:31,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:31,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828613335] [2022-12-06 04:09:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828613335] [2022-12-06 04:09:31,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828613335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:31,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:31,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121299635] [2022-12-06 04:09:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:31,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:31,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:09:31,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 04:09:31,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:31,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:09:31,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:31,422 INFO L130 PetriNetUnfolder]: 341/652 cut-off events. [2022-12-06 04:09:31,423 INFO L131 PetriNetUnfolder]: For 995/1020 co-relation queries the response was YES. [2022-12-06 04:09:31,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 652 events. 341/652 cut-off events. For 995/1020 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3184 event pairs, 52 based on Foata normal form. 91/732 useless extension candidates. Maximal degree in co-relation 2200. Up to 259 conditions per place. [2022-12-06 04:09:31,425 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 56 selfloop transitions, 8 changer transitions 4/73 dead transitions. [2022-12-06 04:09:31,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 586 flow [2022-12-06 04:09:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 04:09:31,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 04:09:31,426 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 223 flow. Second operand 5 states and 64 transitions. [2022-12-06 04:09:31,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 586 flow [2022-12-06 04:09:31,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 546 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:31,429 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 249 flow [2022-12-06 04:09:31,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-06 04:09:31,429 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-06 04:09:31,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:31,429 INFO L89 Accepts]: Start accepts. Operand has 49 places, 36 transitions, 249 flow [2022-12-06 04:09:31,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:31,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:31,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 249 flow [2022-12-06 04:09:31,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 249 flow [2022-12-06 04:09:31,444 INFO L130 PetriNetUnfolder]: 65/223 cut-off events. [2022-12-06 04:09:31,445 INFO L131 PetriNetUnfolder]: For 385/423 co-relation queries the response was YES. [2022-12-06 04:09:31,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 223 events. 65/223 cut-off events. For 385/423 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1251 event pairs, 10 based on Foata normal form. 8/216 useless extension candidates. Maximal degree in co-relation 762. Up to 127 conditions per place. [2022-12-06 04:09:31,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 249 flow [2022-12-06 04:09:31,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 04:09:31,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:31,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 04:09:31,561 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 253 flow [2022-12-06 04:09:31,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 04:09:31,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:31,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:31,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:09:31,561 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash 998339262, now seen corresponding path program 1 times [2022-12-06 04:09:31,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:31,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497010995] [2022-12-06 04:09:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:31,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:31,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:31,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497010995] [2022-12-06 04:09:31,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497010995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:31,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:31,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393563010] [2022-12-06 04:09:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:31,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:31,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:09:31,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:31,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:31,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:09:31,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:31,826 INFO L130 PetriNetUnfolder]: 196/394 cut-off events. [2022-12-06 04:09:31,827 INFO L131 PetriNetUnfolder]: For 809/835 co-relation queries the response was YES. [2022-12-06 04:09:31,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 394 events. 196/394 cut-off events. For 809/835 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1678 event pairs, 48 based on Foata normal form. 39/428 useless extension candidates. Maximal degree in co-relation 1533. Up to 139 conditions per place. [2022-12-06 04:09:31,828 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 38 selfloop transitions, 11 changer transitions 6/59 dead transitions. [2022-12-06 04:09:31,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 471 flow [2022-12-06 04:09:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-06 04:09:31,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 04:09:31,829 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 253 flow. Second operand 6 states and 57 transitions. [2022-12-06 04:09:31,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 471 flow [2022-12-06 04:09:31,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 429 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 04:09:31,832 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 221 flow [2022-12-06 04:09:31,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2022-12-06 04:09:31,833 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 04:09:31,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:31,833 INFO L89 Accepts]: Start accepts. Operand has 50 places, 32 transitions, 221 flow [2022-12-06 04:09:31,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:31,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:31,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 32 transitions, 221 flow [2022-12-06 04:09:31,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 32 transitions, 221 flow [2022-12-06 04:09:31,839 INFO L130 PetriNetUnfolder]: 16/61 cut-off events. [2022-12-06 04:09:31,839 INFO L131 PetriNetUnfolder]: For 107/117 co-relation queries the response was YES. [2022-12-06 04:09:31,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 61 events. 16/61 cut-off events. For 107/117 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 151 event pairs, 2 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 207. Up to 19 conditions per place. [2022-12-06 04:09:31,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 32 transitions, 221 flow [2022-12-06 04:09:31,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 04:09:31,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L746-->L749: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [460] $Ultimate##0-->L761: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= v_~x~0_41 2)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] [2022-12-06 04:09:32,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] L749-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [397] L846-3-->L849: Formula: (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:09:32,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] L824-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P2Thread1of1ForFork0_#res#1.base_9| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_9|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] and [397] L846-3-->L849: Formula: (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:09:32,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L777-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [397] L846-3-->L849: Formula: (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:09:32,649 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:09:32,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 817 [2022-12-06 04:09:32,650 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 227 flow [2022-12-06 04:09:32,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:32,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:32,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:32,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:09:32,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1459635721, now seen corresponding path program 1 times [2022-12-06 04:09:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:32,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333717941] [2022-12-06 04:09:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:32,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:32,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333717941] [2022-12-06 04:09:32,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333717941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:32,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:32,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:32,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360642885] [2022-12-06 04:09:32,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:32,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:32,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:32,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:32,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:32,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:09:32,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:32,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:32,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:09:32,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:32,874 INFO L130 PetriNetUnfolder]: 109/230 cut-off events. [2022-12-06 04:09:32,874 INFO L131 PetriNetUnfolder]: For 824/828 co-relation queries the response was YES. [2022-12-06 04:09:32,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 230 events. 109/230 cut-off events. For 824/828 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 859 event pairs, 14 based on Foata normal form. 7/237 useless extension candidates. Maximal degree in co-relation 959. Up to 144 conditions per place. [2022-12-06 04:09:32,875 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 23 selfloop transitions, 1 changer transitions 23/48 dead transitions. [2022-12-06 04:09:32,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 430 flow [2022-12-06 04:09:32,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 04:09:32,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 04:09:32,876 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 227 flow. Second operand 4 states and 43 transitions. [2022-12-06 04:09:32,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 430 flow [2022-12-06 04:09:32,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 323 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-06 04:09:32,878 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 122 flow [2022-12-06 04:09:32,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2022-12-06 04:09:32,879 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 04:09:32,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:32,879 INFO L89 Accepts]: Start accepts. Operand has 42 places, 23 transitions, 122 flow [2022-12-06 04:09:32,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:32,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:32,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 23 transitions, 122 flow [2022-12-06 04:09:32,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 122 flow [2022-12-06 04:09:32,884 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-06 04:09:32,884 INFO L131 PetriNetUnfolder]: For 48/49 co-relation queries the response was YES. [2022-12-06 04:09:32,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 38 events. 7/38 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 89 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 91. Up to 10 conditions per place. [2022-12-06 04:09:32,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 23 transitions, 122 flow [2022-12-06 04:09:32,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 04:09:33,497 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:09:33,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 619 [2022-12-06 04:09:33,498 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 103 flow [2022-12-06 04:09:33,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:33,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:33,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:33,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:09:33,498 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash -47864395, now seen corresponding path program 1 times [2022-12-06 04:09:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:33,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140495504] [2022-12-06 04:09:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:33,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:34,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140495504] [2022-12-06 04:09:34,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140495504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:34,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:34,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67986342] [2022-12-06 04:09:34,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:34,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:34,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:34,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:34,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:09:34,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 103 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:34,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:34,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:09:34,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:34,395 INFO L130 PetriNetUnfolder]: 20/54 cut-off events. [2022-12-06 04:09:34,395 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 04:09:34,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 54 events. 20/54 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 138 event pairs, 1 based on Foata normal form. 3/57 useless extension candidates. Maximal degree in co-relation 177. Up to 23 conditions per place. [2022-12-06 04:09:34,395 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 17 selfloop transitions, 6 changer transitions 8/31 dead transitions. [2022-12-06 04:09:34,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 220 flow [2022-12-06 04:09:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-12-06 04:09:34,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-06 04:09:34,396 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 103 flow. Second operand 6 states and 26 transitions. [2022-12-06 04:09:34,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 220 flow [2022-12-06 04:09:34,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 183 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-06 04:09:34,397 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 90 flow [2022-12-06 04:09:34,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2022-12-06 04:09:34,398 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2022-12-06 04:09:34,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:34,398 INFO L89 Accepts]: Start accepts. Operand has 33 places, 19 transitions, 90 flow [2022-12-06 04:09:34,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:34,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:34,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 90 flow [2022-12-06 04:09:34,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 90 flow [2022-12-06 04:09:34,402 INFO L130 PetriNetUnfolder]: 6/26 cut-off events. [2022-12-06 04:09:34,402 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:09:34,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 26 events. 6/26 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 58. Up to 8 conditions per place. [2022-12-06 04:09:34,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 19 transitions, 90 flow [2022-12-06 04:09:34,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 04:09:35,328 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:09:35,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 931 [2022-12-06 04:09:35,329 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 99 flow [2022-12-06 04:09:35,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:35,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:35,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:35,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:09:35,329 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:09:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1002882835, now seen corresponding path program 1 times [2022-12-06 04:09:35,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:35,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302043683] [2022-12-06 04:09:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:35,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:09:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:35,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:09:35,405 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:09:35,406 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:09:35,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:09:35,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:09:35,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:09:35,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:09:35,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:09:35,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:09:35,408 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:35,414 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:09:35,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:09:35,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:09:35 BasicIcfg [2022-12-06 04:09:35,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:09:35,472 INFO L158 Benchmark]: Toolchain (without parser) took 12082.23ms. Allocated memory was 164.6MB in the beginning and 390.1MB in the end (delta: 225.4MB). Free memory was 139.1MB in the beginning and 261.3MB in the end (delta: -122.2MB). Peak memory consumption was 102.7MB. Max. memory is 8.0GB. [2022-12-06 04:09:35,472 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 164.6MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:09:35,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.94ms. Allocated memory is still 164.6MB. Free memory was 138.6MB in the beginning and 111.9MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:09:35,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.23ms. Allocated memory is still 164.6MB. Free memory was 111.9MB in the beginning and 109.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:35,473 INFO L158 Benchmark]: Boogie Preprocessor took 45.56ms. Allocated memory is still 164.6MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:35,473 INFO L158 Benchmark]: RCFGBuilder took 659.77ms. Allocated memory is still 164.6MB. Free memory was 107.2MB in the beginning and 72.0MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 04:09:35,473 INFO L158 Benchmark]: TraceAbstraction took 10803.10ms. Allocated memory was 164.6MB in the beginning and 390.1MB in the end (delta: 225.4MB). Free memory was 71.5MB in the beginning and 261.3MB in the end (delta: -189.8MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. [2022-12-06 04:09:35,474 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 164.6MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.94ms. Allocated memory is still 164.6MB. Free memory was 138.6MB in the beginning and 111.9MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.23ms. Allocated memory is still 164.6MB. Free memory was 111.9MB in the beginning and 109.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.56ms. Allocated memory is still 164.6MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 659.77ms. Allocated memory is still 164.6MB. Free memory was 107.2MB in the beginning and 72.0MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10803.10ms. Allocated memory was 164.6MB in the beginning and 390.1MB in the end (delta: 225.4MB). Free memory was 71.5MB in the beginning and 261.3MB in the end (delta: -189.8MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1758 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1348, independent: 1298, independent conditional: 1298, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1348, independent: 1298, independent conditional: 0, independent unconditional: 1298, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1348, independent: 1298, independent conditional: 0, independent unconditional: 1298, 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: 1348, independent: 1298, independent conditional: 0, independent unconditional: 1298, 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: 1110, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1110, independent: 1059, independent conditional: 0, independent unconditional: 1059, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1348, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1110, unknown conditional: 0, unknown unconditional: 1110] , Statistics on independence cache: Total cache size (in pairs): 1720, Positive cache size: 1682, Positive conditional cache size: 0, Positive unconditional cache size: 1682, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 89, independent: 69, independent conditional: 8, independent unconditional: 61, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89, independent: 69, independent conditional: 8, independent unconditional: 61, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89, independent: 69, independent conditional: 8, independent unconditional: 61, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 80, independent: 64, independent conditional: 7, independent unconditional: 57, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 79, dependent conditional: 11, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 80, unknown conditional: 9, unknown unconditional: 71] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 64, Positive conditional cache size: 7, Positive unconditional cache size: 57, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, 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, 31 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 69, independent conditional: 12, independent unconditional: 57, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 73, Positive conditional cache size: 7, Positive unconditional cache size: 66, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 114, independent: 98, independent conditional: 11, independent unconditional: 87, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 114, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 78, Positive conditional cache size: 7, Positive unconditional cache size: 71, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 111, independent conditional: 111, 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: 130, independent: 111, independent conditional: 19, independent unconditional: 92, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 111, independent conditional: 0, independent unconditional: 111, 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: 130, independent: 111, independent conditional: 0, independent unconditional: 111, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 78, Positive conditional cache size: 7, Positive unconditional cache size: 71, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 186, independent conditional: 65, independent unconditional: 121, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 186, independent conditional: 19, independent unconditional: 167, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 186, independent conditional: 19, independent unconditional: 167, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 216, independent: 179, independent conditional: 19, independent unconditional: 160, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 90, Positive conditional cache size: 7, Positive unconditional cache size: 83, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87, independent: 77, independent conditional: 37, independent unconditional: 40, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 77, independent conditional: 8, independent unconditional: 69, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, independent: 77, independent conditional: 8, independent unconditional: 69, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, independent: 73, independent conditional: 8, independent unconditional: 65, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 94, Positive conditional cache size: 7, Positive unconditional cache size: 87, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 105, independent conditional: 45, independent unconditional: 60, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 105, independent conditional: 12, independent unconditional: 93, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 105, independent conditional: 12, independent unconditional: 93, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137, independent: 105, independent conditional: 12, independent unconditional: 93, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 101, Positive conditional cache size: 7, Positive unconditional cache size: 94, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 50 PlacesBefore, 47 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 101, independent conditional: 101, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 125, independent: 101, independent conditional: 87, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 101, independent conditional: 46, independent unconditional: 55, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 101, independent conditional: 46, independent unconditional: 55, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 125, independent: 97, independent conditional: 44, independent unconditional: 53, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 132, Positive conditional cache size: 10, Positive unconditional cache size: 122, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 41 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 19 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 38, independent conditional: 11, independent unconditional: 27, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 38, independent conditional: 11, independent unconditional: 27, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 38, independent conditional: 11, independent unconditional: 27, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 38, independent conditional: 11, independent unconditional: 27, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 162, Positive conditional cache size: 12, Positive unconditional cache size: 150, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, 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.9s, 31 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 191, Positive conditional cache size: 13, Positive unconditional cache size: 178, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=-1, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=0, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=1, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 1 z = 1 [L748] 1 x = 1 [L760] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L848] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L850] RET 1 assume_abort_if_not(main$tmp_guard0) [L852] 1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 842]: 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: 846]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 277 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 535 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 10 mSDtfsCounter, 535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=7, InterpolantAutomatonStates: 42, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:09:35,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...