/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:38:17,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:38:17,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:38:17,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:38:17,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:38:17,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:38:17,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:38:17,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:38:17,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:38:17,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:38:17,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:38:17,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:38:17,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:38:17,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:38:17,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:38:17,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:38:17,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:38:17,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:38:17,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:38:17,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:38:17,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:38:17,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:38:17,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:38:17,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:38:17,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:38:17,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:38:17,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:38:17,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:38:17,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:38:17,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:38:17,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:38:17,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:38:17,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:38:17,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:38:17,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:38:17,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:38:17,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:38:17,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:38:17,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:38:17,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:38:17,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:38:17,907 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-NoLbe.epf [2022-12-05 18:38:17,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:38:17,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:38:17,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:38:17,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:38:17,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:38:17,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:38:17,964 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:38:17,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:38:17,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:38:17,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:38:17,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:38:17,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:38:17,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:38:17,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:38:17,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:38:17,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:38:17,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:38:17,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:38:17,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:38:17,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:38:17,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:38:17,977 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:38:17,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:38:17,977 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 18:38:18,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:38:18,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:38:18,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:38:18,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:38:18,259 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:38:18,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:38:19,259 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:38:19,469 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:38:19,469 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:38:19,480 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd460498/3087429660284798b0eb7afbb33f20fd/FLAG40a3b3bcd [2022-12-05 18:38:19,495 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd460498/3087429660284798b0eb7afbb33f20fd [2022-12-05 18:38:19,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:38:19,498 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:38:19,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:38:19,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:38:19,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:38:19,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:38:19" (1/1) ... [2022-12-05 18:38:19,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138a59ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:19, skipping insertion in model container [2022-12-05 18:38:19,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:38:19" (1/1) ... [2022-12-05 18:38:19,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:38:19,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:38:19,698 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 18:38:19,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:38:19,913 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:38:19,921 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 18:38:19,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:19,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:19,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:38:20,017 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:38:20,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20 WrapperNode [2022-12-05 18:38:20,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:38:20,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:38:20,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:38:20,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:38:20,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,062 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2022-12-05 18:38:20,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:38:20,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:38:20,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:38:20,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:38:20,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:38:20,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:38:20,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:38:20,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:38:20,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (1/1) ... [2022-12-05 18:38:20,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:38:20,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:38:20,156 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 18:38:20,173 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 18:38:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:38:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:38:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:38:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:38:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:38:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:38:20,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:38:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:38:20,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:38:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 18:38:20,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 18:38:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 18:38:20,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 18:38:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:38:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:38:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:38:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:38:20,190 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 18:38:20,312 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:38:20,313 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:38:20,562 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:38:20,650 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:38:20,651 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:38:20,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:38:20 BoogieIcfgContainer [2022-12-05 18:38:20,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:38:20,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:38:20,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:38:20,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:38:20,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:38:19" (1/3) ... [2022-12-05 18:38:20,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d6add1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:38:20, skipping insertion in model container [2022-12-05 18:38:20,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:20" (2/3) ... [2022-12-05 18:38:20,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d6add1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:38:20, skipping insertion in model container [2022-12-05 18:38:20,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:38:20" (3/3) ... [2022-12-05 18:38:20,658 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:38:20,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:38:20,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:38:20,671 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:38:20,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:38:20,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2022-12-05 18:38:20,798 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-05 18:38:20,798 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:38:20,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-05 18:38:20,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2022-12-05 18:38:20,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2022-12-05 18:38:20,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:38:20,828 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;@6daf23b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:38:20,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 18:38:20,853 INFO L130 PetriNetUnfolder]: 0/85 cut-off events. [2022-12-05 18:38:20,854 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:38:20,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:20,856 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:38:20,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1506689710, now seen corresponding path program 1 times [2022-12-05 18:38:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:20,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720057996] [2022-12-05 18:38:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:21,335 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 18:38:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:21,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720057996] [2022-12-05 18:38:21,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720057996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:21,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:21,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:38:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615534452] [2022-12-05 18:38:21,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:21,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:38:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:38:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:38:21,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 125 [2022-12-05 18:38:21,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 18:38:21,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:21,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 125 [2022-12-05 18:38:21,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:21,492 INFO L130 PetriNetUnfolder]: 17/248 cut-off events. [2022-12-05 18:38:21,493 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 18:38:21,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 248 events. 17/248 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 747 event pairs, 7 based on Foata normal form. 9/245 useless extension candidates. Maximal degree in co-relation 252. Up to 27 conditions per place. [2022-12-05 18:38:21,497 INFO L137 encePairwiseOnDemand]: 120/125 looper letters, 11 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2022-12-05 18:38:21,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 120 transitions, 278 flow [2022-12-05 18:38:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:38:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:38:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-12-05 18:38:21,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.936 [2022-12-05 18:38:21,513 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 254 flow. Second operand 3 states and 351 transitions. [2022-12-05 18:38:21,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 120 transitions, 278 flow [2022-12-05 18:38:21,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 120 transitions, 274 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 18:38:21,520 INFO L231 Difference]: Finished difference. Result has 128 places, 117 transitions, 246 flow [2022-12-05 18:38:21,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=128, PETRI_TRANSITIONS=117} [2022-12-05 18:38:21,524 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, -4 predicate places. [2022-12-05 18:38:21,524 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 117 transitions, 246 flow [2022-12-05 18:38:21,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 18:38:21,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:21,525 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, 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, 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 18:38:21,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:38:21,526 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1266799691, now seen corresponding path program 1 times [2022-12-05 18:38:21,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:21,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359871641] [2022-12-05 18:38:21,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:22,458 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 18:38:22,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:22,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359871641] [2022-12-05 18:38:22,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359871641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:22,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:22,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:38:22,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469568552] [2022-12-05 18:38:22,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:22,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:38:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:22,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:38:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:38:22,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-05 18:38:22,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 117 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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 18:38:22,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:22,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-05 18:38:22,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:23,953 INFO L130 PetriNetUnfolder]: 4296/10686 cut-off events. [2022-12-05 18:38:23,954 INFO L131 PetriNetUnfolder]: For 452/452 co-relation queries the response was YES. [2022-12-05 18:38:23,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17427 conditions, 10686 events. 4296/10686 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 106146 event pairs, 528 based on Foata normal form. 0/10438 useless extension candidates. Maximal degree in co-relation 17367. Up to 2396 conditions per place. [2022-12-05 18:38:24,008 INFO L137 encePairwiseOnDemand]: 110/125 looper letters, 42 selfloop transitions, 13 changer transitions 102/232 dead transitions. [2022-12-05 18:38:24,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 232 transitions, 796 flow [2022-12-05 18:38:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:38:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:38:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1319 transitions. [2022-12-05 18:38:24,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8116923076923077 [2022-12-05 18:38:24,013 INFO L175 Difference]: Start difference. First operand has 128 places, 117 transitions, 246 flow. Second operand 13 states and 1319 transitions. [2022-12-05 18:38:24,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 232 transitions, 796 flow [2022-12-05 18:38:24,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 232 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:38:24,021 INFO L231 Difference]: Finished difference. Result has 150 places, 116 transitions, 368 flow [2022-12-05 18:38:24,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=368, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2022-12-05 18:38:24,022 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 18 predicate places. [2022-12-05 18:38:24,022 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 368 flow [2022-12-05 18:38:24,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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 18:38:24,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:24,023 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, 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, 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 18:38:24,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:38:24,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash -484791114, now seen corresponding path program 1 times [2022-12-05 18:38:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:24,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850697246] [2022-12-05 18:38:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:24,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:24,645 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 18:38:24,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:24,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850697246] [2022-12-05 18:38:24,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850697246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:24,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:24,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:38:24,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591462690] [2022-12-05 18:38:24,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:24,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:38:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:38:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:38:24,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-05 18:38:24,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 368 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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 18:38:24,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:24,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-05 18:38:24,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:25,734 INFO L130 PetriNetUnfolder]: 2886/5870 cut-off events. [2022-12-05 18:38:25,734 INFO L131 PetriNetUnfolder]: For 12654/18476 co-relation queries the response was YES. [2022-12-05 18:38:25,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20122 conditions, 5870 events. 2886/5870 cut-off events. For 12654/18476 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 46743 event pairs, 660 based on Foata normal form. 127/5830 useless extension candidates. Maximal degree in co-relation 20048. Up to 1957 conditions per place. [2022-12-05 18:38:25,788 INFO L137 encePairwiseOnDemand]: 111/125 looper letters, 48 selfloop transitions, 21 changer transitions 79/223 dead transitions. [2022-12-05 18:38:25,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 223 transitions, 1420 flow [2022-12-05 18:38:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:38:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:38:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1310 transitions. [2022-12-05 18:38:25,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8061538461538461 [2022-12-05 18:38:25,791 INFO L175 Difference]: Start difference. First operand has 150 places, 116 transitions, 368 flow. Second operand 13 states and 1310 transitions. [2022-12-05 18:38:25,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 223 transitions, 1420 flow [2022-12-05 18:38:25,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 223 transitions, 1396 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 18:38:25,811 INFO L231 Difference]: Finished difference. Result has 150 places, 127 transitions, 574 flow [2022-12-05 18:38:25,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=574, PETRI_PLACES=150, PETRI_TRANSITIONS=127} [2022-12-05 18:38:25,816 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 18 predicate places. [2022-12-05 18:38:25,817 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 127 transitions, 574 flow [2022-12-05 18:38:25,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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 18:38:25,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:25,817 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, 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, 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 18:38:25,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:38:25,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash 267329100, now seen corresponding path program 1 times [2022-12-05 18:38:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:25,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511037894] [2022-12-05 18:38:25,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:26,344 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 18:38:26,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:26,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511037894] [2022-12-05 18:38:26,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511037894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:26,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:26,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:38:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479337686] [2022-12-05 18:38:26,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:26,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:38:26,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:26,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:38:26,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:38:26,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-05 18:38:26,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 127 transitions, 574 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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 18:38:26,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:26,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-05 18:38:26,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:27,445 INFO L130 PetriNetUnfolder]: 2639/6167 cut-off events. [2022-12-05 18:38:27,445 INFO L131 PetriNetUnfolder]: For 23100/31727 co-relation queries the response was YES. [2022-12-05 18:38:27,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24604 conditions, 6167 events. 2639/6167 cut-off events. For 23100/31727 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 55049 event pairs, 645 based on Foata normal form. 111/6123 useless extension candidates. Maximal degree in co-relation 24519. Up to 1918 conditions per place. [2022-12-05 18:38:27,505 INFO L137 encePairwiseOnDemand]: 110/125 looper letters, 54 selfloop transitions, 24 changer transitions 79/232 dead transitions. [2022-12-05 18:38:27,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 232 transitions, 1822 flow [2022-12-05 18:38:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:38:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:38:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1297 transitions. [2022-12-05 18:38:27,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7981538461538461 [2022-12-05 18:38:27,508 INFO L175 Difference]: Start difference. First operand has 150 places, 127 transitions, 574 flow. Second operand 13 states and 1297 transitions. [2022-12-05 18:38:27,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 232 transitions, 1822 flow [2022-12-05 18:38:27,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 232 transitions, 1724 flow, removed 49 selfloop flow, removed 9 redundant places. [2022-12-05 18:38:27,528 INFO L231 Difference]: Finished difference. Result has 156 places, 133 transitions, 766 flow [2022-12-05 18:38:27,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=766, PETRI_PLACES=156, PETRI_TRANSITIONS=133} [2022-12-05 18:38:27,528 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 24 predicate places. [2022-12-05 18:38:27,529 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 133 transitions, 766 flow [2022-12-05 18:38:27,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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 18:38:27,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:27,529 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, 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, 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 18:38:27,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:38:27,529 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:27,530 INFO L85 PathProgramCache]: Analyzing trace with hash -950663147, now seen corresponding path program 1 times [2022-12-05 18:38:27,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:27,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772756012] [2022-12-05 18:38:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:28,001 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 18:38:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:28,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772756012] [2022-12-05 18:38:28,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772756012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:28,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:28,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:38:28,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975613355] [2022-12-05 18:38:28,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:28,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:38:28,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:38:28,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:38:28,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2022-12-05 18:38:28,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 133 transitions, 766 flow. Second operand has 10 states, 10 states have (on average 102.5) internal successors, (1025), 10 states have internal predecessors, (1025), 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 18:38:28,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:28,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2022-12-05 18:38:28,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:28,922 INFO L130 PetriNetUnfolder]: 2255/5003 cut-off events. [2022-12-05 18:38:28,922 INFO L131 PetriNetUnfolder]: For 36544/47259 co-relation queries the response was YES. [2022-12-05 18:38:28,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24200 conditions, 5003 events. 2255/5003 cut-off events. For 36544/47259 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 42573 event pairs, 671 based on Foata normal form. 429/5160 useless extension candidates. Maximal degree in co-relation 24114. Up to 2091 conditions per place. [2022-12-05 18:38:28,971 INFO L137 encePairwiseOnDemand]: 113/125 looper letters, 30 selfloop transitions, 19 changer transitions 64/216 dead transitions. [2022-12-05 18:38:28,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 216 transitions, 1964 flow [2022-12-05 18:38:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 18:38:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 18:38:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1579 transitions. [2022-12-05 18:38:28,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8421333333333333 [2022-12-05 18:38:28,975 INFO L175 Difference]: Start difference. First operand has 156 places, 133 transitions, 766 flow. Second operand 15 states and 1579 transitions. [2022-12-05 18:38:28,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 216 transitions, 1964 flow [2022-12-05 18:38:29,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 216 transitions, 1878 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-05 18:38:29,007 INFO L231 Difference]: Finished difference. Result has 168 places, 147 transitions, 1031 flow [2022-12-05 18:38:29,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1031, PETRI_PLACES=168, PETRI_TRANSITIONS=147} [2022-12-05 18:38:29,010 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 36 predicate places. [2022-12-05 18:38:29,010 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 147 transitions, 1031 flow [2022-12-05 18:38:29,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 102.5) internal successors, (1025), 10 states have internal predecessors, (1025), 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 18:38:29,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:29,011 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, 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, 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 18:38:29,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:38:29,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:29,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:29,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1682885213, now seen corresponding path program 1 times [2022-12-05 18:38:29,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:29,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648571598] [2022-12-05 18:38:29,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:29,429 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 18:38:29,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:29,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648571598] [2022-12-05 18:38:29,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648571598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:29,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:29,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:38:29,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116412057] [2022-12-05 18:38:29,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:38:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:38:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:38:29,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2022-12-05 18:38:29,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 147 transitions, 1031 flow. Second operand has 10 states, 10 states have (on average 102.6) internal successors, (1026), 10 states have internal predecessors, (1026), 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 18:38:29,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:29,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2022-12-05 18:38:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:30,133 INFO L130 PetriNetUnfolder]: 1862/4500 cut-off events. [2022-12-05 18:38:30,133 INFO L131 PetriNetUnfolder]: For 41828/54780 co-relation queries the response was YES. [2022-12-05 18:38:30,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23726 conditions, 4500 events. 1862/4500 cut-off events. For 41828/54780 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 39010 event pairs, 357 based on Foata normal form. 259/4548 useless extension candidates. Maximal degree in co-relation 23627. Up to 1783 conditions per place. [2022-12-05 18:38:30,181 INFO L137 encePairwiseOnDemand]: 116/125 looper letters, 43 selfloop transitions, 10 changer transitions 45/201 dead transitions. [2022-12-05 18:38:30,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 201 transitions, 2074 flow [2022-12-05 18:38:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:38:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:38:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1258 transitions. [2022-12-05 18:38:30,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8386666666666667 [2022-12-05 18:38:30,185 INFO L175 Difference]: Start difference. First operand has 168 places, 147 transitions, 1031 flow. Second operand 12 states and 1258 transitions. [2022-12-05 18:38:30,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 201 transitions, 2074 flow [2022-12-05 18:38:30,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 201 transitions, 2026 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-05 18:38:30,232 INFO L231 Difference]: Finished difference. Result has 172 places, 146 transitions, 1023 flow [2022-12-05 18:38:30,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1023, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2022-12-05 18:38:30,234 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 40 predicate places. [2022-12-05 18:38:30,234 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 1023 flow [2022-12-05 18:38:30,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 102.6) internal successors, (1026), 10 states have internal predecessors, (1026), 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 18:38:30,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:30,235 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, 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, 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 18:38:30,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:38:30,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash -743130267, now seen corresponding path program 1 times [2022-12-05 18:38:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:30,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397866510] [2022-12-05 18:38:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:30,864 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 18:38:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:30,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397866510] [2022-12-05 18:38:30,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397866510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:30,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:30,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:38:30,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577825735] [2022-12-05 18:38:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:30,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:38:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:38:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:38:30,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 125 [2022-12-05 18:38:30,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 146 transitions, 1023 flow. Second operand has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 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 18:38:30,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:30,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 125 [2022-12-05 18:38:30,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:31,817 INFO L130 PetriNetUnfolder]: 2495/5348 cut-off events. [2022-12-05 18:38:31,817 INFO L131 PetriNetUnfolder]: For 55035/76951 co-relation queries the response was YES. [2022-12-05 18:38:31,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30338 conditions, 5348 events. 2495/5348 cut-off events. For 55035/76951 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 43340 event pairs, 341 based on Foata normal form. 136/5324 useless extension candidates. Maximal degree in co-relation 30228. Up to 1912 conditions per place. [2022-12-05 18:38:31,950 INFO L137 encePairwiseOnDemand]: 112/125 looper letters, 88 selfloop transitions, 25 changer transitions 154/343 dead transitions. [2022-12-05 18:38:31,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 343 transitions, 4329 flow [2022-12-05 18:38:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 18:38:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 18:38:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1484 transitions. [2022-12-05 18:38:31,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7914666666666667 [2022-12-05 18:38:31,954 INFO L175 Difference]: Start difference. First operand has 172 places, 146 transitions, 1023 flow. Second operand 15 states and 1484 transitions. [2022-12-05 18:38:31,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 343 transitions, 4329 flow [2022-12-05 18:38:32,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 343 transitions, 4232 flow, removed 39 selfloop flow, removed 13 redundant places. [2022-12-05 18:38:32,022 INFO L231 Difference]: Finished difference. Result has 178 places, 160 transitions, 1375 flow [2022-12-05 18:38:32,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1375, PETRI_PLACES=178, PETRI_TRANSITIONS=160} [2022-12-05 18:38:32,023 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 46 predicate places. [2022-12-05 18:38:32,023 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 160 transitions, 1375 flow [2022-12-05 18:38:32,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 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 18:38:32,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:32,024 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, 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, 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, 1] [2022-12-05 18:38:32,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:38:32,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1223247207, now seen corresponding path program 1 times [2022-12-05 18:38:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:32,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344123692] [2022-12-05 18:38:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:32,628 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 18:38:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344123692] [2022-12-05 18:38:32,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344123692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:32,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:32,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:38:32,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213336186] [2022-12-05 18:38:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:32,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:38:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:32,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:38:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:38:32,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 125 [2022-12-05 18:38:32,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 160 transitions, 1375 flow. Second operand has 10 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 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 18:38:32,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:32,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 125 [2022-12-05 18:38:32,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:33,476 INFO L130 PetriNetUnfolder]: 1816/4447 cut-off events. [2022-12-05 18:38:33,476 INFO L131 PetriNetUnfolder]: For 62161/93911 co-relation queries the response was YES. [2022-12-05 18:38:33,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27930 conditions, 4447 events. 1816/4447 cut-off events. For 62161/93911 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 38695 event pairs, 301 based on Foata normal form. 254/4542 useless extension candidates. Maximal degree in co-relation 27821. Up to 1835 conditions per place. [2022-12-05 18:38:33,531 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 56 selfloop transitions, 26 changer transitions 48/236 dead transitions. [2022-12-05 18:38:33,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 236 transitions, 3197 flow [2022-12-05 18:38:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:38:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:38:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1240 transitions. [2022-12-05 18:38:33,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2022-12-05 18:38:33,534 INFO L175 Difference]: Start difference. First operand has 178 places, 160 transitions, 1375 flow. Second operand 12 states and 1240 transitions. [2022-12-05 18:38:33,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 236 transitions, 3197 flow [2022-12-05 18:38:33,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 236 transitions, 3123 flow, removed 32 selfloop flow, removed 6 redundant places. [2022-12-05 18:38:33,616 INFO L231 Difference]: Finished difference. Result has 182 places, 177 transitions, 1760 flow [2022-12-05 18:38:33,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1760, PETRI_PLACES=182, PETRI_TRANSITIONS=177} [2022-12-05 18:38:33,618 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 50 predicate places. [2022-12-05 18:38:33,618 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 177 transitions, 1760 flow [2022-12-05 18:38:33,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 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 18:38:33,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:33,619 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, 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, 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, 1] [2022-12-05 18:38:33,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:38:33,619 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:33,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1285153531, now seen corresponding path program 2 times [2022-12-05 18:38:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:33,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22740834] [2022-12-05 18:38:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:33,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:34,252 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 18:38:34,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:34,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22740834] [2022-12-05 18:38:34,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22740834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:34,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:34,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:38:34,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462551207] [2022-12-05 18:38:34,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:34,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:38:34,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:34,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:38:34,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:38:34,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-05 18:38:34,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 177 transitions, 1760 flow. Second operand has 11 states, 11 states have (on average 92.27272727272727) internal successors, (1015), 11 states have internal predecessors, (1015), 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 18:38:34,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:34,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-05 18:38:34,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:35,514 INFO L130 PetriNetUnfolder]: 2339/5436 cut-off events. [2022-12-05 18:38:35,515 INFO L131 PetriNetUnfolder]: For 97367/144043 co-relation queries the response was YES. [2022-12-05 18:38:35,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38214 conditions, 5436 events. 2339/5436 cut-off events. For 97367/144043 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 45819 event pairs, 130 based on Foata normal form. 245/5531 useless extension candidates. Maximal degree in co-relation 38096. Up to 1954 conditions per place. [2022-12-05 18:38:35,575 INFO L137 encePairwiseOnDemand]: 107/125 looper letters, 82 selfloop transitions, 90 changer transitions 77/324 dead transitions. [2022-12-05 18:38:35,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 324 transitions, 4837 flow [2022-12-05 18:38:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 18:38:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 18:38:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1461 transitions. [2022-12-05 18:38:35,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7792 [2022-12-05 18:38:35,578 INFO L175 Difference]: Start difference. First operand has 182 places, 177 transitions, 1760 flow. Second operand 15 states and 1461 transitions. [2022-12-05 18:38:35,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 324 transitions, 4837 flow [2022-12-05 18:38:35,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 324 transitions, 4776 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-12-05 18:38:35,715 INFO L231 Difference]: Finished difference. Result has 196 places, 219 transitions, 2802 flow [2022-12-05 18:38:35,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2802, PETRI_PLACES=196, PETRI_TRANSITIONS=219} [2022-12-05 18:38:35,717 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 64 predicate places. [2022-12-05 18:38:35,717 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 219 transitions, 2802 flow [2022-12-05 18:38:35,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 92.27272727272727) internal successors, (1015), 11 states have internal predecessors, (1015), 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 18:38:35,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:35,718 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, 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, 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, 1] [2022-12-05 18:38:35,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:38:35,718 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:35,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2139977709, now seen corresponding path program 3 times [2022-12-05 18:38:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:35,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070987172] [2022-12-05 18:38:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:35,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:36,183 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 18:38:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:36,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070987172] [2022-12-05 18:38:36,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070987172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:36,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:36,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:38:36,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586389184] [2022-12-05 18:38:36,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:36,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:38:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:36,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:38:36,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:38:36,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-05 18:38:36,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 219 transitions, 2802 flow. Second operand has 10 states, 10 states have (on average 101.8) internal successors, (1018), 10 states have internal predecessors, (1018), 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 18:38:36,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:36,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-05 18:38:36,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:37,109 INFO L130 PetriNetUnfolder]: 1995/4953 cut-off events. [2022-12-05 18:38:37,109 INFO L131 PetriNetUnfolder]: For 141714/218884 co-relation queries the response was YES. [2022-12-05 18:38:37,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40333 conditions, 4953 events. 1995/4953 cut-off events. For 141714/218884 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 44119 event pairs, 232 based on Foata normal form. 566/5358 useless extension candidates. Maximal degree in co-relation 40208. Up to 2071 conditions per place. [2022-12-05 18:38:37,173 INFO L137 encePairwiseOnDemand]: 115/125 looper letters, 60 selfloop transitions, 48 changer transitions 46/288 dead transitions. [2022-12-05 18:38:37,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 288 transitions, 5257 flow [2022-12-05 18:38:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:38:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:38:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1256 transitions. [2022-12-05 18:38:37,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8373333333333334 [2022-12-05 18:38:37,175 INFO L175 Difference]: Start difference. First operand has 196 places, 219 transitions, 2802 flow. Second operand 12 states and 1256 transitions. [2022-12-05 18:38:37,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 288 transitions, 5257 flow [2022-12-05 18:38:37,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 288 transitions, 4894 flow, removed 179 selfloop flow, removed 9 redundant places. [2022-12-05 18:38:37,356 INFO L231 Difference]: Finished difference. Result has 200 places, 230 transitions, 3210 flow [2022-12-05 18:38:37,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=2669, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3210, PETRI_PLACES=200, PETRI_TRANSITIONS=230} [2022-12-05 18:38:37,357 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 68 predicate places. [2022-12-05 18:38:37,357 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 230 transitions, 3210 flow [2022-12-05 18:38:37,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 101.8) internal successors, (1018), 10 states have internal predecessors, (1018), 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 18:38:37,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:37,358 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, 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, 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, 1] [2022-12-05 18:38:37,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:38:37,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:37,358 INFO L85 PathProgramCache]: Analyzing trace with hash -682359847, now seen corresponding path program 4 times [2022-12-05 18:38:37,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:37,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677697202] [2022-12-05 18:38:37,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:37,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:38,209 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 18:38:38,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:38,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677697202] [2022-12-05 18:38:38,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677697202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:38,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:38,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:38:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584903499] [2022-12-05 18:38:38,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:38,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:38:38,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:38,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:38:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:38:38,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-05 18:38:38,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 230 transitions, 3210 flow. Second operand has 12 states, 12 states have (on average 92.08333333333333) internal successors, (1105), 12 states have internal predecessors, (1105), 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 18:38:38,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:38,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-05 18:38:38,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:39,956 INFO L130 PetriNetUnfolder]: 2392/5989 cut-off events. [2022-12-05 18:38:39,956 INFO L131 PetriNetUnfolder]: For 123953/219961 co-relation queries the response was YES. [2022-12-05 18:38:40,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45937 conditions, 5989 events. 2392/5989 cut-off events. For 123953/219961 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 55103 event pairs, 138 based on Foata normal form. 625/6481 useless extension candidates. Maximal degree in co-relation 45805. Up to 2085 conditions per place. [2022-12-05 18:38:40,035 INFO L137 encePairwiseOnDemand]: 107/125 looper letters, 113 selfloop transitions, 121 changer transitions 116/425 dead transitions. [2022-12-05 18:38:40,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 425 transitions, 8275 flow [2022-12-05 18:38:40,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 18:38:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 18:38:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2050 transitions. [2022-12-05 18:38:40,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.780952380952381 [2022-12-05 18:38:40,041 INFO L175 Difference]: Start difference. First operand has 200 places, 230 transitions, 3210 flow. Second operand 21 states and 2050 transitions. [2022-12-05 18:38:40,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 425 transitions, 8275 flow [2022-12-05 18:38:40,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 425 transitions, 8010 flow, removed 114 selfloop flow, removed 12 redundant places. [2022-12-05 18:38:40,252 INFO L231 Difference]: Finished difference. Result has 217 places, 269 transitions, 4355 flow [2022-12-05 18:38:40,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=3093, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4355, PETRI_PLACES=217, PETRI_TRANSITIONS=269} [2022-12-05 18:38:40,253 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 85 predicate places. [2022-12-05 18:38:40,253 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 269 transitions, 4355 flow [2022-12-05 18:38:40,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 92.08333333333333) internal successors, (1105), 12 states have internal predecessors, (1105), 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 18:38:40,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:40,253 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, 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, 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, 1, 1] [2022-12-05 18:38:40,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:38:40,253 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash -118844474, now seen corresponding path program 1 times [2022-12-05 18:38:40,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:40,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368619349] [2022-12-05 18:38:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:40,811 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 18:38:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:40,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368619349] [2022-12-05 18:38:40,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368619349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:40,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:40,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:38:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451611936] [2022-12-05 18:38:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:40,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:38:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:40,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:38:40,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:38:40,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-05 18:38:40,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 269 transitions, 4355 flow. Second operand has 11 states, 11 states have (on average 101.72727272727273) internal successors, (1119), 11 states have internal predecessors, (1119), 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 18:38:40,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:40,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-05 18:38:40,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:41,811 INFO L130 PetriNetUnfolder]: 1805/5046 cut-off events. [2022-12-05 18:38:41,812 INFO L131 PetriNetUnfolder]: For 117401/206027 co-relation queries the response was YES. [2022-12-05 18:38:41,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39407 conditions, 5046 events. 1805/5046 cut-off events. For 117401/206027 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 48551 event pairs, 215 based on Foata normal form. 279/5184 useless extension candidates. Maximal degree in co-relation 39272. Up to 1921 conditions per place. [2022-12-05 18:38:41,877 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 90 selfloop transitions, 46 changer transitions 31/319 dead transitions. [2022-12-05 18:38:41,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 319 transitions, 6138 flow [2022-12-05 18:38:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:38:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:38:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1345 transitions. [2022-12-05 18:38:41,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8276923076923077 [2022-12-05 18:38:41,879 INFO L175 Difference]: Start difference. First operand has 217 places, 269 transitions, 4355 flow. Second operand 13 states and 1345 transitions. [2022-12-05 18:38:41,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 319 transitions, 6138 flow [2022-12-05 18:38:42,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 319 transitions, 5845 flow, removed 134 selfloop flow, removed 14 redundant places. [2022-12-05 18:38:42,202 INFO L231 Difference]: Finished difference. Result has 214 places, 281 transitions, 4654 flow [2022-12-05 18:38:42,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=4189, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4654, PETRI_PLACES=214, PETRI_TRANSITIONS=281} [2022-12-05 18:38:42,203 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 82 predicate places. [2022-12-05 18:38:42,203 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 281 transitions, 4654 flow [2022-12-05 18:38:42,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.72727272727273) internal successors, (1119), 11 states have internal predecessors, (1119), 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 18:38:42,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:42,203 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, 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, 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, 1, 1] [2022-12-05 18:38:42,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:38:42,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1747481266, now seen corresponding path program 2 times [2022-12-05 18:38:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:42,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152493769] [2022-12-05 18:38:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:42,823 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 18:38:42,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:42,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152493769] [2022-12-05 18:38:42,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152493769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:42,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:42,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:38:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035401091] [2022-12-05 18:38:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:42,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:38:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:38:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:38:42,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125 [2022-12-05 18:38:42,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 281 transitions, 4654 flow. Second operand has 13 states, 13 states have (on average 98.6923076923077) internal successors, (1283), 13 states have internal predecessors, (1283), 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 18:38:42,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:42,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125 [2022-12-05 18:38:42,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:43,885 INFO L130 PetriNetUnfolder]: 1711/4760 cut-off events. [2022-12-05 18:38:43,885 INFO L131 PetriNetUnfolder]: For 107530/205388 co-relation queries the response was YES. [2022-12-05 18:38:43,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37270 conditions, 4760 events. 1711/4760 cut-off events. For 107530/205388 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 45325 event pairs, 225 based on Foata normal form. 313/4939 useless extension candidates. Maximal degree in co-relation 37133. Up to 1837 conditions per place. [2022-12-05 18:38:43,952 INFO L137 encePairwiseOnDemand]: 112/125 looper letters, 84 selfloop transitions, 59 changer transitions 18/310 dead transitions. [2022-12-05 18:38:43,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 310 transitions, 5761 flow [2022-12-05 18:38:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 18:38:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 18:38:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1507 transitions. [2022-12-05 18:38:43,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8037333333333333 [2022-12-05 18:38:43,954 INFO L175 Difference]: Start difference. First operand has 214 places, 281 transitions, 4654 flow. Second operand 15 states and 1507 transitions. [2022-12-05 18:38:43,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 310 transitions, 5761 flow [2022-12-05 18:38:44,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 310 transitions, 5626 flow, removed 65 selfloop flow, removed 9 redundant places. [2022-12-05 18:38:44,241 INFO L231 Difference]: Finished difference. Result has 220 places, 283 transitions, 4819 flow [2022-12-05 18:38:44,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=4575, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4819, PETRI_PLACES=220, PETRI_TRANSITIONS=283} [2022-12-05 18:38:44,242 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 88 predicate places. [2022-12-05 18:38:44,242 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 283 transitions, 4819 flow [2022-12-05 18:38:44,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.6923076923077) internal successors, (1283), 13 states have internal predecessors, (1283), 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 18:38:44,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:44,242 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, 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, 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, 1, 1] [2022-12-05 18:38:44,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:38:44,243 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:44,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash 983379362, now seen corresponding path program 1 times [2022-12-05 18:38:44,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:44,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707993232] [2022-12-05 18:38:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:44,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:44,410 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 18:38:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:44,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707993232] [2022-12-05 18:38:44,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707993232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:44,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:44,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:38:44,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109936921] [2022-12-05 18:38:44,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:44,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:38:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:44,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:38:44,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:38:44,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-05 18:38:44,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 283 transitions, 4819 flow. Second operand has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 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 18:38:44,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:44,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-05 18:38:44,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:51,076 INFO L130 PetriNetUnfolder]: 20813/36448 cut-off events. [2022-12-05 18:38:51,077 INFO L131 PetriNetUnfolder]: For 1029774/1105419 co-relation queries the response was YES. [2022-12-05 18:38:51,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230352 conditions, 36448 events. 20813/36448 cut-off events. For 1029774/1105419 co-relation queries the response was YES. Maximal size of possible extension queue 2726. Compared 347863 event pairs, 1064 based on Foata normal form. 3065/37016 useless extension candidates. Maximal degree in co-relation 230219. Up to 12576 conditions per place. [2022-12-05 18:38:51,812 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 344 selfloop transitions, 20 changer transitions 115/636 dead transitions. [2022-12-05 18:38:51,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 636 transitions, 14956 flow [2022-12-05 18:38:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:38:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:38:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1084 transitions. [2022-12-05 18:38:51,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8672 [2022-12-05 18:38:51,814 INFO L175 Difference]: Start difference. First operand has 220 places, 283 transitions, 4819 flow. Second operand 10 states and 1084 transitions. [2022-12-05 18:38:51,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 636 transitions, 14956 flow [2022-12-05 18:38:53,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 636 transitions, 14714 flow, removed 23 selfloop flow, removed 12 redundant places. [2022-12-05 18:38:53,164 INFO L231 Difference]: Finished difference. Result has 217 places, 299 transitions, 4818 flow [2022-12-05 18:38:53,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=4675, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4818, PETRI_PLACES=217, PETRI_TRANSITIONS=299} [2022-12-05 18:38:53,165 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 85 predicate places. [2022-12-05 18:38:53,165 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 299 transitions, 4818 flow [2022-12-05 18:38:53,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 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 18:38:53,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:53,165 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, 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, 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, 1, 1, 1] [2022-12-05 18:38:53,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:38:53,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1168464472, now seen corresponding path program 1 times [2022-12-05 18:38:53,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:53,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606459183] [2022-12-05 18:38:53,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:53,715 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 18:38:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:53,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606459183] [2022-12-05 18:38:53,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606459183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:53,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:53,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:38:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648356302] [2022-12-05 18:38:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:53,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:38:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:53,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:38:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:38:53,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125 [2022-12-05 18:38:53,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 299 transitions, 4818 flow. Second operand has 12 states, 12 states have (on average 98.83333333333333) internal successors, (1186), 12 states have internal predecessors, (1186), 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 18:38:53,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:53,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125 [2022-12-05 18:38:53,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:56,335 INFO L130 PetriNetUnfolder]: 4283/14510 cut-off events. [2022-12-05 18:38:56,335 INFO L131 PetriNetUnfolder]: For 152794/218123 co-relation queries the response was YES. [2022-12-05 18:38:56,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69363 conditions, 14510 events. 4283/14510 cut-off events. For 152794/218123 co-relation queries the response was YES. Maximal size of possible extension queue 1353. Compared 192149 event pairs, 1166 based on Foata normal form. 1207/14479 useless extension candidates. Maximal degree in co-relation 69224. Up to 4163 conditions per place. [2022-12-05 18:38:56,569 INFO L137 encePairwiseOnDemand]: 115/125 looper letters, 116 selfloop transitions, 51 changer transitions 0/333 dead transitions. [2022-12-05 18:38:56,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 333 transitions, 6153 flow [2022-12-05 18:38:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:38:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:38:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1309 transitions. [2022-12-05 18:38:56,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8055384615384615 [2022-12-05 18:38:56,572 INFO L175 Difference]: Start difference. First operand has 217 places, 299 transitions, 4818 flow. Second operand 13 states and 1309 transitions. [2022-12-05 18:38:56,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 333 transitions, 6153 flow [2022-12-05 18:38:57,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 333 transitions, 6101 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-05 18:38:57,041 INFO L231 Difference]: Finished difference. Result has 235 places, 313 transitions, 5393 flow [2022-12-05 18:38:57,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=4796, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5393, PETRI_PLACES=235, PETRI_TRANSITIONS=313} [2022-12-05 18:38:57,041 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 103 predicate places. [2022-12-05 18:38:57,041 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 313 transitions, 5393 flow [2022-12-05 18:38:57,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 98.83333333333333) internal successors, (1186), 12 states have internal predecessors, (1186), 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 18:38:57,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:57,042 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, 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, 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, 1, 1, 1] [2022-12-05 18:38:57,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 18:38:57,042 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:38:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1680290914, now seen corresponding path program 1 times [2022-12-05 18:38:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:57,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391430181] [2022-12-05 18:38:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:57,157 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 18:38:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:57,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391430181] [2022-12-05 18:38:57,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391430181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:57,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:57,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:38:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419811995] [2022-12-05 18:38:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:57,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:38:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:57,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:38:57,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:38:57,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-05 18:38:57,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 313 transitions, 5393 flow. Second operand has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 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 18:38:57,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:57,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-05 18:38:57,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:04,615 INFO L130 PetriNetUnfolder]: 19642/36461 cut-off events. [2022-12-05 18:39:04,615 INFO L131 PetriNetUnfolder]: For 964479/1026589 co-relation queries the response was YES. [2022-12-05 18:39:05,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256570 conditions, 36461 events. 19642/36461 cut-off events. For 964479/1026589 co-relation queries the response was YES. Maximal size of possible extension queue 2916. Compared 374764 event pairs, 515 based on Foata normal form. 4326/39432 useless extension candidates. Maximal degree in co-relation 256428. Up to 11194 conditions per place. [2022-12-05 18:39:05,329 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 356 selfloop transitions, 38 changer transitions 220/768 dead transitions. [2022-12-05 18:39:05,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 768 transitions, 18994 flow [2022-12-05 18:39:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:39:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:39:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1412 transitions. [2022-12-05 18:39:05,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8689230769230769 [2022-12-05 18:39:05,332 INFO L175 Difference]: Start difference. First operand has 235 places, 313 transitions, 5393 flow. Second operand 13 states and 1412 transitions. [2022-12-05 18:39:05,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 768 transitions, 18994 flow [2022-12-05 18:39:07,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 768 transitions, 18451 flow, removed 219 selfloop flow, removed 6 redundant places. [2022-12-05 18:39:07,111 INFO L231 Difference]: Finished difference. Result has 247 places, 299 transitions, 4601 flow [2022-12-05 18:39:07,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4601, PETRI_PLACES=247, PETRI_TRANSITIONS=299} [2022-12-05 18:39:07,112 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 115 predicate places. [2022-12-05 18:39:07,112 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 299 transitions, 4601 flow [2022-12-05 18:39:07,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 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 18:39:07,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:07,113 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, 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, 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, 1, 1, 1, 1, 1] [2022-12-05 18:39:07,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 18:39:07,113 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:39:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1857394821, now seen corresponding path program 1 times [2022-12-05 18:39:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:07,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593127853] [2022-12-05 18:39:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:07,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:07,534 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 18:39:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593127853] [2022-12-05 18:39:07,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593127853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:07,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:07,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:07,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378645840] [2022-12-05 18:39:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:07,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:07,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-05 18:39:07,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 299 transitions, 4601 flow. Second operand has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 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 18:39:07,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:07,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-05 18:39:07,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:11,449 INFO L130 PetriNetUnfolder]: 5946/20147 cut-off events. [2022-12-05 18:39:11,449 INFO L131 PetriNetUnfolder]: For 155692/184058 co-relation queries the response was YES. [2022-12-05 18:39:11,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95582 conditions, 20147 events. 5946/20147 cut-off events. For 155692/184058 co-relation queries the response was YES. Maximal size of possible extension queue 2593. Compared 288653 event pairs, 433 based on Foata normal form. 654/19349 useless extension candidates. Maximal degree in co-relation 95428. Up to 6529 conditions per place. [2022-12-05 18:39:11,784 INFO L137 encePairwiseOnDemand]: 110/125 looper letters, 179 selfloop transitions, 63 changer transitions 89/444 dead transitions. [2022-12-05 18:39:11,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 444 transitions, 8534 flow [2022-12-05 18:39:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:39:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:39:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1270 transitions. [2022-12-05 18:39:11,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7815384615384615 [2022-12-05 18:39:11,786 INFO L175 Difference]: Start difference. First operand has 247 places, 299 transitions, 4601 flow. Second operand 13 states and 1270 transitions. [2022-12-05 18:39:11,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 444 transitions, 8534 flow [2022-12-05 18:39:14,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 444 transitions, 8323 flow, removed 96 selfloop flow, removed 13 redundant places. [2022-12-05 18:39:14,606 INFO L231 Difference]: Finished difference. Result has 250 places, 297 transitions, 4537 flow [2022-12-05 18:39:14,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=4456, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4537, PETRI_PLACES=250, PETRI_TRANSITIONS=297} [2022-12-05 18:39:14,607 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 118 predicate places. [2022-12-05 18:39:14,607 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 297 transitions, 4537 flow [2022-12-05 18:39:14,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 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 18:39:14,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:14,607 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, 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, 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, 1, 1, 1, 1, 1] [2022-12-05 18:39:14,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 18:39:14,607 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:39:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:14,608 INFO L85 PathProgramCache]: Analyzing trace with hash -470736231, now seen corresponding path program 1 times [2022-12-05 18:39:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:14,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021050161] [2022-12-05 18:39:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:14,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:14,776 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 18:39:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:14,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021050161] [2022-12-05 18:39:14,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021050161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:14,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:14,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:39:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939920022] [2022-12-05 18:39:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:39:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:39:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:39:14,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-05 18:39:14,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 297 transitions, 4537 flow. Second operand has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 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 18:39:14,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:14,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-05 18:39:14,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:24,328 INFO L130 PetriNetUnfolder]: 23295/44832 cut-off events. [2022-12-05 18:39:24,328 INFO L131 PetriNetUnfolder]: For 1044310/1120603 co-relation queries the response was YES. [2022-12-05 18:39:25,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305068 conditions, 44832 events. 23295/44832 cut-off events. For 1044310/1120603 co-relation queries the response was YES. Maximal size of possible extension queue 3879. Compared 498975 event pairs, 244 based on Foata normal form. 5654/48770 useless extension candidates. Maximal degree in co-relation 304921. Up to 10007 conditions per place. [2022-12-05 18:39:25,311 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 298 selfloop transitions, 56 changer transitions 239/739 dead transitions. [2022-12-05 18:39:25,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 739 transitions, 17615 flow [2022-12-05 18:39:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 18:39:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 18:39:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1739 transitions. [2022-12-05 18:39:25,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8695 [2022-12-05 18:39:25,313 INFO L175 Difference]: Start difference. First operand has 250 places, 297 transitions, 4537 flow. Second operand 16 states and 1739 transitions. [2022-12-05 18:39:25,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 739 transitions, 17615 flow [2022-12-05 18:39:31,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 739 transitions, 16480 flow, removed 420 selfloop flow, removed 9 redundant places. [2022-12-05 18:39:31,768 INFO L231 Difference]: Finished difference. Result has 260 places, 276 transitions, 3840 flow [2022-12-05 18:39:31,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=3834, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3840, PETRI_PLACES=260, PETRI_TRANSITIONS=276} [2022-12-05 18:39:31,769 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 128 predicate places. [2022-12-05 18:39:31,769 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 276 transitions, 3840 flow [2022-12-05 18:39:31,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 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 18:39:31,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:31,769 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:31,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 18:39:31,769 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:39:31,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1109682930, now seen corresponding path program 1 times [2022-12-05 18:39:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:31,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081591324] [2022-12-05 18:39:31,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:31,914 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 18:39:31,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:31,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081591324] [2022-12-05 18:39:31,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081591324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:31,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:31,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 18:39:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147900090] [2022-12-05 18:39:31,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:31,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 18:39:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 18:39:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-05 18:39:31,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-05 18:39:31,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 276 transitions, 3840 flow. Second operand has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 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 18:39:31,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:31,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-05 18:39:31,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:41,019 INFO L130 PetriNetUnfolder]: 21738/43255 cut-off events. [2022-12-05 18:39:41,019 INFO L131 PetriNetUnfolder]: For 837408/895785 co-relation queries the response was YES. [2022-12-05 18:39:41,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301787 conditions, 43255 events. 21738/43255 cut-off events. For 837408/895785 co-relation queries the response was YES. Maximal size of possible extension queue 3833. Compared 497450 event pairs, 227 based on Foata normal form. 3866/45412 useless extension candidates. Maximal degree in co-relation 301707. Up to 9300 conditions per place. [2022-12-05 18:39:41,920 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 115 selfloop transitions, 53 changer transitions 382/657 dead transitions. [2022-12-05 18:39:41,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 657 transitions, 14404 flow [2022-12-05 18:39:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 18:39:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 18:39:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2030 transitions. [2022-12-05 18:39:41,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8547368421052631 [2022-12-05 18:39:41,922 INFO L175 Difference]: Start difference. First operand has 260 places, 276 transitions, 3840 flow. Second operand 19 states and 2030 transitions. [2022-12-05 18:39:41,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 657 transitions, 14404 flow [2022-12-05 18:40:01,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 657 transitions, 12573 flow, removed 417 selfloop flow, removed 34 redundant places. [2022-12-05 18:40:01,672 INFO L231 Difference]: Finished difference. Result has 242 places, 197 transitions, 1787 flow [2022-12-05 18:40:01,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=3054, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1787, PETRI_PLACES=242, PETRI_TRANSITIONS=197} [2022-12-05 18:40:01,672 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 110 predicate places. [2022-12-05 18:40:01,672 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 197 transitions, 1787 flow [2022-12-05 18:40:01,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 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 18:40:01,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:01,673 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:01,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 18:40:01,673 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:40:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1045041780, now seen corresponding path program 1 times [2022-12-05 18:40:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:01,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828584441] [2022-12-05 18:40:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:01,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:02,085 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 18:40:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:02,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828584441] [2022-12-05 18:40:02,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828584441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:02,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:02,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:40:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317385359] [2022-12-05 18:40:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:02,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:40:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:02,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:40:02,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:40:02,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 125 [2022-12-05 18:40:02,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 197 transitions, 1787 flow. Second operand has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 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 18:40:02,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:02,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 125 [2022-12-05 18:40:02,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:02,758 INFO L130 PetriNetUnfolder]: 1210/4543 cut-off events. [2022-12-05 18:40:02,759 INFO L131 PetriNetUnfolder]: For 13897/14782 co-relation queries the response was YES. [2022-12-05 18:40:02,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16301 conditions, 4543 events. 1210/4543 cut-off events. For 13897/14782 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 53087 event pairs, 24 based on Foata normal form. 6/4189 useless extension candidates. Maximal degree in co-relation 16191. Up to 511 conditions per place. [2022-12-05 18:40:02,810 INFO L137 encePairwiseOnDemand]: 111/125 looper letters, 30 selfloop transitions, 8 changer transitions 92/252 dead transitions. [2022-12-05 18:40:02,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 252 transitions, 3007 flow [2022-12-05 18:40:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:40:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:40:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 855 transitions. [2022-12-05 18:40:02,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-12-05 18:40:02,811 INFO L175 Difference]: Start difference. First operand has 242 places, 197 transitions, 1787 flow. Second operand 9 states and 855 transitions. [2022-12-05 18:40:02,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 252 transitions, 3007 flow [2022-12-05 18:40:02,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 252 transitions, 2234 flow, removed 212 selfloop flow, removed 39 redundant places. [2022-12-05 18:40:02,945 INFO L231 Difference]: Finished difference. Result has 212 places, 160 transitions, 905 flow [2022-12-05 18:40:02,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=905, PETRI_PLACES=212, PETRI_TRANSITIONS=160} [2022-12-05 18:40:02,946 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 80 predicate places. [2022-12-05 18:40:02,946 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 160 transitions, 905 flow [2022-12-05 18:40:02,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 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 18:40:02,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:02,946 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:02,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 18:40:02,947 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 18:40:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1019926030, now seen corresponding path program 2 times [2022-12-05 18:40:02,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:02,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445758118] [2022-12-05 18:40:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:02,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:40:02,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:40:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:40:03,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:40:03,026 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:40:03,027 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 18:40:03,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 18:40:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 18:40:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 18:40:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 18:40:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 18:40:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 18:40:03,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 18:40:03,029 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:03,035 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:40:03,035 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:40:03,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:40:03 BasicIcfg [2022-12-05 18:40:03,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:40:03,129 INFO L158 Benchmark]: Toolchain (without parser) took 103631.85ms. Allocated memory was 127.9MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 83.9MB in the beginning and 5.3GB in the end (delta: -5.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-05 18:40:03,129 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:40:03,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.59ms. Allocated memory was 127.9MB in the beginning and 179.3MB in the end (delta: 51.4MB). Free memory was 83.8MB in the beginning and 142.1MB in the end (delta: -58.3MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2022-12-05 18:40:03,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.18ms. Allocated memory is still 179.3MB. Free memory was 142.1MB in the beginning and 139.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:40:03,130 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 179.3MB. Free memory was 139.5MB in the beginning and 137.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:40:03,130 INFO L158 Benchmark]: RCFGBuilder took 552.68ms. Allocated memory is still 179.3MB. Free memory was 137.4MB in the beginning and 104.9MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 18:40:03,130 INFO L158 Benchmark]: TraceAbstraction took 102474.89ms. Allocated memory was 179.3MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 104.4MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-05 18:40:03,131 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.13ms. Allocated memory is still 127.9MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 519.59ms. Allocated memory was 127.9MB in the beginning and 179.3MB in the end (delta: 51.4MB). Free memory was 83.8MB in the beginning and 142.1MB in the end (delta: -58.3MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.18ms. Allocated memory is still 179.3MB. Free memory was 142.1MB in the beginning and 139.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 179.3MB. Free memory was 139.5MB in the beginning and 137.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 552.68ms. Allocated memory is still 179.3MB. Free memory was 137.4MB in the beginning and 104.9MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 102474.89ms. Allocated memory was 179.3MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 104.4MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L728] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L729] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L736] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L737] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L738] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L739] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L740] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 pthread_t t1517; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-3, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-2, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, 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, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, 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, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, 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, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, 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=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 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: 102.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 92.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1592 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1592 mSDsluCounter, 2148 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1735 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3063 IncrementalHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 413 mSDtfsCounter, 3063 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5393occurred in iteration=15, InterpolantAutomatonStates: 265, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1787 NumberOfCodeBlocks, 1787 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1671 ConstructedInterpolants, 0 QuantifiedInterpolants, 9756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 18:40:03,165 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...