/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:22:11,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:22:11,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:22:11,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:22:11,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:22:11,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:22:11,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:22:11,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:22:11,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:22:11,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:22:11,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:22:11,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:22:11,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:22:11,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:22:11,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:22:11,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:22:11,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:22:11,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:22:11,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:22:11,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:22:11,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:22:11,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:22:11,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:22:11,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:22:12,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:22:12,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:22:12,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:22:12,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:22:12,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:22:12,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:22:12,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:22:12,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:22:12,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:22:12,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:22:12,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:22:12,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:22:12,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:22:12,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:22:12,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:22:12,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:22:12,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:22:12,017 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-SemanticLbe.epf [2022-12-05 20:22:12,042 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:22:12,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:22:12,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:22:12,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:22:12,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:22:12,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:22:12,045 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:22:12,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:22:12,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:22:12,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:22:12,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:22:12,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:22:12,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:22:12,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:22:12,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:22:12,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:22:12,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:22:12,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:22:12,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:22:12,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:22:12,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:22:12,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:22:12,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:22:12,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:12,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:22:12,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:22:12,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:22:12,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:22:12,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:22:12,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:22:12,053 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-05 20:22:12,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:22:12,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:22:12,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:22:12,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:22:12,292 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:22:12,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:22:13,239 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:22:13,445 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:22:13,446 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:22:13,462 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49fcb7cd7/e0c80574bcad49f58174f917ab4fa84c/FLAG6395651d2 [2022-12-05 20:22:13,473 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49fcb7cd7/e0c80574bcad49f58174f917ab4fa84c [2022-12-05 20:22:13,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:22:13,476 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:22:13,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:22:13,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:22:13,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:22:13,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e5fa7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13, skipping insertion in model container [2022-12-05 20:22:13,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:22:13,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:22:13,632 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/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:22:13,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:22:13,795 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:22:13,805 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/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:22:13,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:13,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:13,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:22:13,872 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:22:13,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13 WrapperNode [2022-12-05 20:22:13,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:22:13,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:22:13,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:22:13,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:22:13,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,909 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-05 20:22:13,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:22:13,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:22:13,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:22:13,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:22:13,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,928 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:22:13,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:22:13,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:22:13,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:22:13,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (1/1) ... [2022-12-05 20:22:13,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:22:13,962 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-05 20:22:13,967 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-05 20:22:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:22:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:22:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:22:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:22:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:22:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:22:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:22:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:22:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:22:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:22:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:22:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 20:22:13,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 20:22:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:22:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:22:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:22:13,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:22:13,988 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:22:14,133 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:22:14,134 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:22:14,364 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:22:14,466 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:22:14,466 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:22:14,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:22:14 BoogieIcfgContainer [2022-12-05 20:22:14,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:22:14,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:22:14,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:22:14,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:22:14,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:22:13" (1/3) ... [2022-12-05 20:22:14,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d45ab87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:22:14, skipping insertion in model container [2022-12-05 20:22:14,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:13" (2/3) ... [2022-12-05 20:22:14,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d45ab87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:22:14, skipping insertion in model container [2022-12-05 20:22:14,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:22:14" (3/3) ... [2022-12-05 20:22:14,473 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:22:14,488 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:22:14,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:22:14,489 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:22:14,545 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:22:14,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:22:14,628 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:22:14,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:14,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-05 20:22:14,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:22:14,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-05 20:22:14,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:22:14,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:22:14,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-05 20:22:14,676 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:22:14,676 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:14,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-05 20:22:14,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:22:14,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-05 20:22:18,884 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-05 20:22:18,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:22:18,899 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=PETRI_NET, 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;@781d0157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:22:18,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:22:18,900 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 20:22:18,901 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:18,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:18,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:22:18,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash 538882, now seen corresponding path program 1 times [2022-12-05 20:22:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:18,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089045982] [2022-12-05 20:22:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:19,246 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-05 20:22:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089045982] [2022-12-05 20:22:19,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089045982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:19,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:19,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694743085] [2022-12-05 20:22:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:19,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:19,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:19,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:19,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 20:22:19,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-05 20:22:19,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:19,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 20:22:19,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:20,107 INFO L130 PetriNetUnfolder]: 6050/8340 cut-off events. [2022-12-05 20:22:20,108 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-05 20:22:20,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16739 conditions, 8340 events. 6050/8340 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 41734 event pairs, 3098 based on Foata normal form. 0/7600 useless extension candidates. Maximal degree in co-relation 16727. Up to 6574 conditions per place. [2022-12-05 20:22:20,183 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-05 20:22:20,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-05 20:22:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-05 20:22:20,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-05 20:22:20,193 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-05 20:22:20,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-05 20:22:20,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:22:20,197 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-05 20:22:20,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-05 20:22:20,201 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-05 20:22:20,201 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 68 flow [2022-12-05 20:22:20,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-05 20:22:20,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:20,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:20,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:22:20,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1532157591, now seen corresponding path program 1 times [2022-12-05 20:22:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:20,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683217215] [2022-12-05 20:22:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:20,421 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-05 20:22:20,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:20,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683217215] [2022-12-05 20:22:20,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683217215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:20,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:20,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634176470] [2022-12-05 20:22:20,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:20,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:20,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:20,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:20,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-05 20:22:20,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:20,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:20,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-05 20:22:20,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:21,899 INFO L130 PetriNetUnfolder]: 16443/22329 cut-off events. [2022-12-05 20:22:21,899 INFO L131 PetriNetUnfolder]: For 1116/1116 co-relation queries the response was YES. [2022-12-05 20:22:21,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46175 conditions, 22329 events. 16443/22329 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 116729 event pairs, 6427 based on Foata normal form. 704/23033 useless extension candidates. Maximal degree in co-relation 46165. Up to 11662 conditions per place. [2022-12-05 20:22:21,986 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 42 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2022-12-05 20:22:21,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2022-12-05 20:22:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-05 20:22:21,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-05 20:22:21,988 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 68 flow. Second operand 3 states and 52 transitions. [2022-12-05 20:22:21,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2022-12-05 20:22:21,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:21,990 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 134 flow [2022-12-05 20:22:21,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-05 20:22:21,991 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-05 20:22:21,991 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 134 flow [2022-12-05 20:22:21,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:21,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:21,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:21,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:22:21,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:21,992 INFO L85 PathProgramCache]: Analyzing trace with hash 252245413, now seen corresponding path program 1 times [2022-12-05 20:22:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:21,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351129184] [2022-12-05 20:22:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:21,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:22,232 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-05 20:22:22,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:22,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351129184] [2022-12-05 20:22:22,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351129184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:22,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:22,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:22:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4507135] [2022-12-05 20:22:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:22,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-05 20:22:22,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 134 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:22,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:22,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-05 20:22:22,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:23,752 INFO L130 PetriNetUnfolder]: 15313/20798 cut-off events. [2022-12-05 20:22:23,752 INFO L131 PetriNetUnfolder]: For 10508/10508 co-relation queries the response was YES. [2022-12-05 20:22:23,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53933 conditions, 20798 events. 15313/20798 cut-off events. For 10508/10508 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 105633 event pairs, 3500 based on Foata normal form. 170/20968 useless extension candidates. Maximal degree in co-relation 53921. Up to 8467 conditions per place. [2022-12-05 20:22:23,831 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-05 20:22:23,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 356 flow [2022-12-05 20:22:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-05 20:22:23,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 20:22:23,833 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 134 flow. Second operand 4 states and 60 transitions. [2022-12-05 20:22:23,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 356 flow [2022-12-05 20:22:23,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:23,855 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 184 flow [2022-12-05 20:22:23,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-05 20:22:23,856 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-05 20:22:23,856 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 184 flow [2022-12-05 20:22:23,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:23,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:23,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:23,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:22:23,856 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:23,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:23,857 INFO L85 PathProgramCache]: Analyzing trace with hash -771249249, now seen corresponding path program 1 times [2022-12-05 20:22:23,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:23,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327086235] [2022-12-05 20:22:23,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:24,016 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-05 20:22:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:24,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327086235] [2022-12-05 20:22:24,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327086235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:24,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:24,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:22:24,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880689160] [2022-12-05 20:22:24,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:24,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:24,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:24,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:24,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-05 20:22:24,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 184 flow. Second operand has 4 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-05 20:22:24,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:24,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-05 20:22:24,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:25,645 INFO L130 PetriNetUnfolder]: 15055/20452 cut-off events. [2022-12-05 20:22:25,646 INFO L131 PetriNetUnfolder]: For 14652/14652 co-relation queries the response was YES. [2022-12-05 20:22:25,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56354 conditions, 20452 events. 15055/20452 cut-off events. For 14652/14652 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 106066 event pairs, 1461 based on Foata normal form. 40/20492 useless extension candidates. Maximal degree in co-relation 56339. Up to 9914 conditions per place. [2022-12-05 20:22:25,721 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 63 selfloop transitions, 20 changer transitions 0/83 dead transitions. [2022-12-05 20:22:25,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 512 flow [2022-12-05 20:22:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 20:22:25,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-05 20:22:25,722 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 184 flow. Second operand 4 states and 68 transitions. [2022-12-05 20:22:25,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 512 flow [2022-12-05 20:22:25,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:22:25,756 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 364 flow [2022-12-05 20:22:25,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2022-12-05 20:22:25,757 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-05 20:22:25,757 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 364 flow [2022-12-05 20:22:25,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-05 20:22:25,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:25,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:25,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:22:25,757 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:25,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1888226368, now seen corresponding path program 1 times [2022-12-05 20:22:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:25,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168361483] [2022-12-05 20:22:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:25,846 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-05 20:22:25,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168361483] [2022-12-05 20:22:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168361483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:25,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:25,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:22:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895550698] [2022-12-05 20:22:25,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:25,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:25,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:25,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:25,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:25,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-05 20:22:25,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 364 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-05 20:22:25,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:25,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-05 20:22:25,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:27,277 INFO L130 PetriNetUnfolder]: 14856/20185 cut-off events. [2022-12-05 20:22:27,277 INFO L131 PetriNetUnfolder]: For 36068/36068 co-relation queries the response was YES. [2022-12-05 20:22:27,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64493 conditions, 20185 events. 14856/20185 cut-off events. For 36068/36068 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 104285 event pairs, 2533 based on Foata normal form. 32/20217 useless extension candidates. Maximal degree in co-relation 64474. Up to 9866 conditions per place. [2022-12-05 20:22:27,372 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 68 selfloop transitions, 34 changer transitions 0/102 dead transitions. [2022-12-05 20:22:27,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 102 transitions, 804 flow [2022-12-05 20:22:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 20:22:27,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 20:22:27,374 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 364 flow. Second operand 4 states and 72 transitions. [2022-12-05 20:22:27,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 102 transitions, 804 flow [2022-12-05 20:22:27,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 102 transitions, 804 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:22:27,428 INFO L231 Difference]: Finished difference. Result has 56 places, 70 transitions, 667 flow [2022-12-05 20:22:27,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=667, PETRI_PLACES=56, PETRI_TRANSITIONS=70} [2022-12-05 20:22:27,430 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2022-12-05 20:22:27,430 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 70 transitions, 667 flow [2022-12-05 20:22:27,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-05 20:22:27,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:27,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:27,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:22:27,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1551135486, now seen corresponding path program 1 times [2022-12-05 20:22:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:27,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518041270] [2022-12-05 20:22:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:27,544 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-05 20:22:27,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518041270] [2022-12-05 20:22:27,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518041270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:27,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:27,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:27,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779729485] [2022-12-05 20:22:27,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:27,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:27,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:27,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-05 20:22:27,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 70 transitions, 667 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-05 20:22:27,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:27,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-05 20:22:27,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:29,787 INFO L130 PetriNetUnfolder]: 20582/28191 cut-off events. [2022-12-05 20:22:29,788 INFO L131 PetriNetUnfolder]: For 93864/93864 co-relation queries the response was YES. [2022-12-05 20:22:29,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97033 conditions, 28191 events. 20582/28191 cut-off events. For 93864/93864 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 155542 event pairs, 4610 based on Foata normal form. 300/28491 useless extension candidates. Maximal degree in co-relation 97009. Up to 11643 conditions per place. [2022-12-05 20:22:29,911 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 68 selfloop transitions, 41 changer transitions 2/111 dead transitions. [2022-12-05 20:22:29,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 111 transitions, 1081 flow [2022-12-05 20:22:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-05 20:22:29,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-05 20:22:29,913 INFO L175 Difference]: Start difference. First operand has 56 places, 70 transitions, 667 flow. Second operand 4 states and 73 transitions. [2022-12-05 20:22:29,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 111 transitions, 1081 flow [2022-12-05 20:22:30,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 1081 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:22:30,021 INFO L231 Difference]: Finished difference. Result has 62 places, 75 transitions, 920 flow [2022-12-05 20:22:30,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=62, PETRI_TRANSITIONS=75} [2022-12-05 20:22:30,024 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2022-12-05 20:22:30,024 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 75 transitions, 920 flow [2022-12-05 20:22:30,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-05 20:22:30,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:30,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:30,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:22:30,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:30,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:30,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1550781838, now seen corresponding path program 1 times [2022-12-05 20:22:30,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:30,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216970016] [2022-12-05 20:22:30,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:30,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:30,153 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-05 20:22:30,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:30,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216970016] [2022-12-05 20:22:30,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216970016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:30,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:30,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537071821] [2022-12-05 20:22:30,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:30,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:30,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:30,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:30,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 20:22:30,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 920 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:30,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:30,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 20:22:30,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:32,039 INFO L130 PetriNetUnfolder]: 13142/19575 cut-off events. [2022-12-05 20:22:32,040 INFO L131 PetriNetUnfolder]: For 98691/102043 co-relation queries the response was YES. [2022-12-05 20:22:32,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67014 conditions, 19575 events. 13142/19575 cut-off events. For 98691/102043 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 131528 event pairs, 1900 based on Foata normal form. 2020/21160 useless extension candidates. Maximal degree in co-relation 66985. Up to 8314 conditions per place. [2022-12-05 20:22:32,171 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 114 selfloop transitions, 6 changer transitions 0/148 dead transitions. [2022-12-05 20:22:32,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 148 transitions, 1932 flow [2022-12-05 20:22:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-05 20:22:32,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-05 20:22:32,172 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 920 flow. Second operand 4 states and 75 transitions. [2022-12-05 20:22:32,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 148 transitions, 1932 flow [2022-12-05 20:22:32,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 148 transitions, 1926 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-05 20:22:32,210 INFO L231 Difference]: Finished difference. Result has 67 places, 80 transitions, 964 flow [2022-12-05 20:22:32,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=964, PETRI_PLACES=67, PETRI_TRANSITIONS=80} [2022-12-05 20:22:32,211 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-05 20:22:32,211 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 80 transitions, 964 flow [2022-12-05 20:22:32,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:32,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:32,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:32,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:22:32,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1586705727, now seen corresponding path program 1 times [2022-12-05 20:22:32,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:32,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40511776] [2022-12-05 20:22:32,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:32,338 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-05 20:22:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:32,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40511776] [2022-12-05 20:22:32,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40511776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:32,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:32,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564376697] [2022-12-05 20:22:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:32,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:32,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 20:22:32,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 80 transitions, 964 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:32,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:32,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 20:22:32,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:33,487 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L822-->L838: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_129 256) 0) .cse5)) (.cse6 (and .cse3 .cse5))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_128 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_139 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse9 (or .cse11 .cse8 .cse6)) (.cse10 (and .cse7 (not .cse11)))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0))) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse5 .cse2) .cse4 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse7 (not .cse4)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a~0_79 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_129 (ite (or .cse8 .cse4 .cse6) v_~a$w_buff1_used~0_129 0)) v_~a$w_buff1_used~0_128) (= (ite .cse9 v_~a~0_79 (ite .cse10 v_~a$w_buff0~0_67 v_~a$w_buff1~0_58)) v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_78 (ite .cse0 v_~a$mem_tmp~0_14 v_~__unbuffered_p3_EBX~0_10)) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse9 v_~a$w_buff0_used~0_140 (ite .cse10 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_129, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_78, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_128, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][111], [170#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 156#true, 128#L782true, 46#P2EXITtrue, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 121#L838true, 72#L762true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(<= ~__unbuffered_p3_EAX~0 0), Black: 165#(= ~y~0 0), Black: 166#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#(= ~x~0 0), Black: 173#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 200#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 179#(= ~y~0 1), Black: 177#true, 85#L872true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 184#true, 163#true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0)), Black: 187#(= ~main$tmp_guard0~0 0)]) [2022-12-05 20:22:33,487 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-05 20:22:33,487 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:22:33,487 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:22:33,488 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:22:33,641 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L782-->L789: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_117 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= v_~a~0_64 (ite .cse0 v_~a$w_buff0~0_56 (ite .cse1 v_~a$w_buff1~0_47 v_~a~0_65))) (= v_~a$r_buff0_thd2~0_25 (ite .cse2 0 v_~a$r_buff0_thd2~0_26)) (= (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_116 256) 0)) .cse4)) 0 v_~a$r_buff1_thd2~0_24) v_~a$r_buff1_thd2~0_23) (= (ite .cse0 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_117) v_~a$w_buff1_used~0_116)))) InVars {~a~0=v_~a~0_65, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_117} OutVars{~a~0=v_~a~0_64, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_116} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][38], [P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 56#L769true, 166#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 96#L789true, Black: 151#true, 46#P2EXITtrue, Black: 156#true, Black: 158#(<= ~__unbuffered_p3_EAX~0 0), Black: 165#(= ~y~0 0), Black: 163#true, 173#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 170#true, Black: 172#(= ~x~0 0), 40#L822true, 200#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 179#(= ~y~0 1), Black: 177#true, 85#L872true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 184#true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0)), Black: 187#(= ~main$tmp_guard0~0 0)]) [2022-12-05 20:22:33,641 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:22:33,642 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:22:33,642 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:22:33,642 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:22:33,642 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L822-->L838: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_129 256) 0) .cse5)) (.cse6 (and .cse3 .cse5))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_128 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_139 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse9 (or .cse11 .cse8 .cse6)) (.cse10 (and .cse7 (not .cse11)))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0))) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse5 .cse2) .cse4 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse7 (not .cse4)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a~0_79 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_129 (ite (or .cse8 .cse4 .cse6) v_~a$w_buff1_used~0_129 0)) v_~a$w_buff1_used~0_128) (= (ite .cse9 v_~a~0_79 (ite .cse10 v_~a$w_buff0~0_67 v_~a$w_buff1~0_58)) v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_78 (ite .cse0 v_~a$mem_tmp~0_14 v_~__unbuffered_p3_EBX~0_10)) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse9 v_~a$w_buff0_used~0_140 (ite .cse10 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_129, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_78, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_128, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][111], [170#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 56#L769true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 156#true, 128#L782true, 46#P2EXITtrue, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 121#L838true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(<= ~__unbuffered_p3_EAX~0 0), Black: 165#(= ~y~0 0), Black: 166#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#(= ~x~0 0), Black: 173#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 200#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 179#(= ~y~0 1), Black: 177#true, 85#L872true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 184#true, 163#true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0)), Black: 187#(= ~main$tmp_guard0~0 0)]) [2022-12-05 20:22:33,642 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:22:33,642 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:22:33,642 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:22:33,642 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:22:33,999 INFO L130 PetriNetUnfolder]: 10703/16390 cut-off events. [2022-12-05 20:22:34,000 INFO L131 PetriNetUnfolder]: For 85164/87378 co-relation queries the response was YES. [2022-12-05 20:22:34,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64984 conditions, 16390 events. 10703/16390 cut-off events. For 85164/87378 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 112447 event pairs, 1750 based on Foata normal form. 1421/17388 useless extension candidates. Maximal degree in co-relation 64951. Up to 6191 conditions per place. [2022-12-05 20:22:34,096 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 134 selfloop transitions, 10 changer transitions 0/172 dead transitions. [2022-12-05 20:22:34,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 172 transitions, 2185 flow [2022-12-05 20:22:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:22:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:22:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-05 20:22:34,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2022-12-05 20:22:34,097 INFO L175 Difference]: Start difference. First operand has 67 places, 80 transitions, 964 flow. Second operand 5 states and 97 transitions. [2022-12-05 20:22:34,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 172 transitions, 2185 flow [2022-12-05 20:22:34,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 172 transitions, 2182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:22:34,126 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 1029 flow [2022-12-05 20:22:34,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1029, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2022-12-05 20:22:34,127 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2022-12-05 20:22:34,127 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 1029 flow [2022-12-05 20:22:34,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:34,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:34,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:34,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:22:34,128 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:34,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash -448972509, now seen corresponding path program 1 times [2022-12-05 20:22:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:34,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81592840] [2022-12-05 20:22:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:34,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:34,268 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-05 20:22:34,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:34,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81592840] [2022-12-05 20:22:34,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81592840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:34,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:34,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:22:34,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437893703] [2022-12-05 20:22:34,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:34,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:34,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:34,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:34,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-05 20:22:34,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-05 20:22:34,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:34,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-05 20:22:34,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:36,641 INFO L130 PetriNetUnfolder]: 17377/26482 cut-off events. [2022-12-05 20:22:36,642 INFO L131 PetriNetUnfolder]: For 155048/156742 co-relation queries the response was YES. [2022-12-05 20:22:36,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117380 conditions, 26482 events. 17377/26482 cut-off events. For 155048/156742 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 189470 event pairs, 7552 based on Foata normal form. 716/26495 useless extension candidates. Maximal degree in co-relation 117344. Up to 13600 conditions per place. [2022-12-05 20:22:36,836 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 81 selfloop transitions, 12 changer transitions 13/121 dead transitions. [2022-12-05 20:22:36,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 121 transitions, 1514 flow [2022-12-05 20:22:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-05 20:22:36,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2022-12-05 20:22:36,852 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 1029 flow. Second operand 3 states and 55 transitions. [2022-12-05 20:22:36,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 121 transitions, 1514 flow [2022-12-05 20:22:36,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 121 transitions, 1486 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:36,964 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 954 flow [2022-12-05 20:22:36,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2022-12-05 20:22:36,964 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2022-12-05 20:22:36,965 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 954 flow [2022-12-05 20:22:36,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-05 20:22:36,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:36,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:36,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:22:36,965 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash -345104021, now seen corresponding path program 1 times [2022-12-05 20:22:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:36,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450862864] [2022-12-05 20:22:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:37,308 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-05 20:22:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:37,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450862864] [2022-12-05 20:22:37,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450862864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:37,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:37,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:22:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567227236] [2022-12-05 20:22:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:37,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:22:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:22:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:22:37,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 20:22:37,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 954 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:37,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:37,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 20:22:37,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:40,035 INFO L130 PetriNetUnfolder]: 14512/22174 cut-off events. [2022-12-05 20:22:40,036 INFO L131 PetriNetUnfolder]: For 118128/120454 co-relation queries the response was YES. [2022-12-05 20:22:40,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92045 conditions, 22174 events. 14512/22174 cut-off events. For 118128/120454 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 160057 event pairs, 2370 based on Foata normal form. 1022/22465 useless extension candidates. Maximal degree in co-relation 92009. Up to 8830 conditions per place. [2022-12-05 20:22:40,127 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 132 selfloop transitions, 14 changer transitions 11/179 dead transitions. [2022-12-05 20:22:40,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 179 transitions, 2285 flow [2022-12-05 20:22:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:22:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:22:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-05 20:22:40,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-05 20:22:40,135 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 954 flow. Second operand 6 states and 117 transitions. [2022-12-05 20:22:40,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 179 transitions, 2285 flow [2022-12-05 20:22:40,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 179 transitions, 2250 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-05 20:22:40,178 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 987 flow [2022-12-05 20:22:40,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=987, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2022-12-05 20:22:40,179 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2022-12-05 20:22:40,179 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 987 flow [2022-12-05 20:22:40,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:40,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:40,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:40,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:22:40,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1162942379, now seen corresponding path program 1 times [2022-12-05 20:22:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:40,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337844069] [2022-12-05 20:22:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:40,342 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-05 20:22:40,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:40,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337844069] [2022-12-05 20:22:40,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337844069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:40,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:40,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:22:40,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231213321] [2022-12-05 20:22:40,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:40,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:22:40,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:40,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:22:40,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:22:40,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 20:22:40,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 987 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-05 20:22:40,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:40,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 20:22:40,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:42,564 INFO L130 PetriNetUnfolder]: 14264/21783 cut-off events. [2022-12-05 20:22:42,564 INFO L131 PetriNetUnfolder]: For 129843/131954 co-relation queries the response was YES. [2022-12-05 20:22:42,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97222 conditions, 21783 events. 14264/21783 cut-off events. For 129843/131954 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 157180 event pairs, 2342 based on Foata normal form. 534/21588 useless extension candidates. Maximal degree in co-relation 97183. Up to 8759 conditions per place. [2022-12-05 20:22:42,663 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 77 selfloop transitions, 18 changer transitions 51/157 dead transitions. [2022-12-05 20:22:42,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 157 transitions, 2012 flow [2022-12-05 20:22:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:22:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:22:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-05 20:22:42,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2022-12-05 20:22:42,676 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 987 flow. Second operand 7 states and 109 transitions. [2022-12-05 20:22:42,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 157 transitions, 2012 flow [2022-12-05 20:22:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 157 transitions, 1968 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-05 20:22:43,868 INFO L231 Difference]: Finished difference. Result has 83 places, 59 transitions, 627 flow [2022-12-05 20:22:43,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=627, PETRI_PLACES=83, PETRI_TRANSITIONS=59} [2022-12-05 20:22:43,868 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2022-12-05 20:22:43,868 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 59 transitions, 627 flow [2022-12-05 20:22:43,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-05 20:22:43,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:43,869 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:43,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:22:43,869 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash 7979118, now seen corresponding path program 1 times [2022-12-05 20:22:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:43,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571579183] [2022-12-05 20:22:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:44,028 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-05 20:22:44,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:44,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571579183] [2022-12-05 20:22:44,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571579183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:44,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:44,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816275909] [2022-12-05 20:22:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:44,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:44,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:44,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:44,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-05 20:22:44,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 59 transitions, 627 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:44,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:44,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-05 20:22:44,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:44,621 INFO L130 PetriNetUnfolder]: 4229/6448 cut-off events. [2022-12-05 20:22:44,621 INFO L131 PetriNetUnfolder]: For 40675/40734 co-relation queries the response was YES. [2022-12-05 20:22:44,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29606 conditions, 6448 events. 4229/6448 cut-off events. For 40675/40734 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 36025 event pairs, 1254 based on Foata normal form. 46/6473 useless extension candidates. Maximal degree in co-relation 29566. Up to 3026 conditions per place. [2022-12-05 20:22:44,647 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 50 selfloop transitions, 2 changer transitions 58/112 dead transitions. [2022-12-05 20:22:44,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 112 transitions, 1289 flow [2022-12-05 20:22:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-05 20:22:44,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-05 20:22:44,648 INFO L175 Difference]: Start difference. First operand has 83 places, 59 transitions, 627 flow. Second operand 4 states and 62 transitions. [2022-12-05 20:22:44,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 112 transitions, 1289 flow [2022-12-05 20:22:44,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 981 flow, removed 47 selfloop flow, removed 18 redundant places. [2022-12-05 20:22:44,735 INFO L231 Difference]: Finished difference. Result has 70 places, 40 transitions, 262 flow [2022-12-05 20:22:44,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=70, PETRI_TRANSITIONS=40} [2022-12-05 20:22:44,736 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-05 20:22:44,736 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 40 transitions, 262 flow [2022-12-05 20:22:44,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:44,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:44,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:44,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:22:44,736 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash -127334166, now seen corresponding path program 2 times [2022-12-05 20:22:44,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:44,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360749251] [2022-12-05 20:22:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:45,437 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-05 20:22:45,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:45,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360749251] [2022-12-05 20:22:45,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360749251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:45,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:45,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:22:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298661724] [2022-12-05 20:22:45,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:45,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:22:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:45,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:22:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:22:45,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 20:22:45,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 40 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:45,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:45,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 20:22:45,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:45,641 INFO L130 PetriNetUnfolder]: 543/925 cut-off events. [2022-12-05 20:22:45,641 INFO L131 PetriNetUnfolder]: For 2336/2338 co-relation queries the response was YES. [2022-12-05 20:22:45,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 925 events. 543/925 cut-off events. For 2336/2338 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3702 event pairs, 137 based on Foata normal form. 1/921 useless extension candidates. Maximal degree in co-relation 3534. Up to 513 conditions per place. [2022-12-05 20:22:45,644 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 50 selfloop transitions, 4 changer transitions 31/89 dead transitions. [2022-12-05 20:22:45,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 716 flow [2022-12-05 20:22:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:22:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:22:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-05 20:22:45,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-05 20:22:45,645 INFO L175 Difference]: Start difference. First operand has 70 places, 40 transitions, 262 flow. Second operand 7 states and 84 transitions. [2022-12-05 20:22:45,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 716 flow [2022-12-05 20:22:45,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 457 flow, removed 27 selfloop flow, removed 24 redundant places. [2022-12-05 20:22:45,651 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 140 flow [2022-12-05 20:22:45,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-05 20:22:45,652 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2022-12-05 20:22:45,652 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 140 flow [2022-12-05 20:22:45,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:45,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:45,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:45,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:22:45,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash 986210466, now seen corresponding path program 3 times [2022-12-05 20:22:45,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:45,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836197419] [2022-12-05 20:22:45,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:45,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:22:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:45,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:22:45,757 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:22:45,757 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 20:22:45,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 20:22:45,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 20:22:45,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 20:22:45,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 20:22:45,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 20:22:45,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 20:22:45,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:22:45,759 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:45,763 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:22:45,763 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:22:45,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:22:45 BasicIcfg [2022-12-05 20:22:45,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:22:45,818 INFO L158 Benchmark]: Toolchain (without parser) took 32342.36ms. Allocated memory was 215.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 189.7MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-05 20:22:45,818 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 215.0MB. Free memory was 191.9MB in the beginning and 191.8MB in the end (delta: 80.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:22:45,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.65ms. Allocated memory is still 215.0MB. Free memory was 189.7MB in the beginning and 161.4MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 20:22:45,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.49ms. Allocated memory is still 215.0MB. Free memory was 161.4MB in the beginning and 158.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:45,820 INFO L158 Benchmark]: Boogie Preprocessor took 26.71ms. Allocated memory is still 215.0MB. Free memory was 158.8MB in the beginning and 156.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:45,820 INFO L158 Benchmark]: RCFGBuilder took 531.58ms. Allocated memory is still 215.0MB. Free memory was 156.7MB in the beginning and 119.4MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-05 20:22:45,820 INFO L158 Benchmark]: TraceAbstraction took 31348.02ms. Allocated memory was 215.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 118.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-05 20:22:45,821 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 215.0MB. Free memory was 191.9MB in the beginning and 191.8MB in the end (delta: 80.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 398.65ms. Allocated memory is still 215.0MB. Free memory was 189.7MB in the beginning and 161.4MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.49ms. Allocated memory is still 215.0MB. Free memory was 161.4MB in the beginning and 158.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.71ms. Allocated memory is still 215.0MB. Free memory was 158.8MB in the beginning and 156.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 531.58ms. Allocated memory is still 215.0MB. Free memory was 156.7MB in the beginning and 119.4MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 31348.02ms. Allocated memory was 215.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 118.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 136 PlacesBefore, 48 PlacesAfterwards, 125 TransitionsBefore, 36 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2127, independent: 2058, independent conditional: 2058, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2127, independent: 2058, independent conditional: 0, independent unconditional: 2058, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2127, independent: 2058, independent conditional: 0, independent unconditional: 2058, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2127, independent: 2058, independent conditional: 0, independent unconditional: 2058, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1762, independent: 1717, independent conditional: 0, independent unconditional: 1717, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1762, independent: 1703, independent conditional: 0, independent unconditional: 1703, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 220, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2127, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1762, unknown conditional: 0, unknown unconditional: 1762] , Statistics on independence cache: Total cache size (in pairs): 2598, Positive cache size: 2553, Positive conditional cache size: 0, Positive unconditional cache size: 2553, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=-2, t801={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=-1, t801={5:0}, t802={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=0, t801={5:0}, t802={6:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=1, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] - 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: 869]: 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: 865]: 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: 863]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 31.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 719 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 719 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1118 IncrementalHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 32 mSDtfsCounter, 1118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=8, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-05 20:22:45,839 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...