/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 --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:40:08,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:40:08,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:40:08,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:40:08,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:40:08,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:40:08,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:40:08,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:40:08,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:40:08,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:40:08,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:40:08,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:40:08,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:40:08,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:40:08,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:40:08,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:40:08,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:40:08,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:40:08,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:40:08,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:40:08,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:40:08,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:40:08,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:40:08,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:40:08,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:40:08,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:40:08,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:40:08,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:40:08,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:40:08,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:40:08,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:40:08,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:40:08,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:40:08,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:40:08,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:40:08,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:40:08,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:40:08,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:40:08,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:40:08,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:40:08,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:40:08,942 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-11 23:40:08,972 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:40:08,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:40:08,973 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:40:08,973 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:40:08,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:40:08,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:40:08,975 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:40:08,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:40:08,975 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:40:08,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:40:08,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:40:08,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:40:08,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:40:08,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:40:08,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:40:08,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:40:08,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:40:08,977 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:40:08,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:40:08,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:40:08,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:40:08,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:40:08,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:40:08,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:40:08,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:40:08,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:40:08,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:40:08,978 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:40:08,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:40:08,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:40:08,978 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:40:08,978 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:40:09,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:40:09,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:40:09,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:40:09,288 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:40:09,289 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:40:09,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 23:40:10,279 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:40:10,529 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:40:10,529 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 23:40:10,537 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae0c7854/e537afe285a44bd786555d572a95e65b/FLAG7f507b0e2 [2022-12-11 23:40:10,549 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae0c7854/e537afe285a44bd786555d572a95e65b [2022-12-11 23:40:10,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:40:10,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:40:10,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:40:10,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:40:10,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:40:10,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:10,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98356ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10, skipping insertion in model container [2022-12-11 23:40:10,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:10,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:40:10,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:40:10,692 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-11 23:40:10,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:40:10,883 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:40:10,894 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-11 23:40:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:10,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:10,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:40:10,972 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:40:10,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10 WrapperNode [2022-12-11 23:40:10,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:40:10,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:40:10,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:40:10,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:40:10,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,034 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-11 23:40:11,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:40:11,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:40:11,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:40:11,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:40:11,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,071 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:40:11,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:40:11,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:40:11,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:40:11,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (1/1) ... [2022-12-11 23:40:11,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:40:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:40:11,117 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-11 23:40:11,143 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-11 23:40:11,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:40:11,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:40:11,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:40:11,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:40:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:40:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:40:11,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:40:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:40:11,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:40:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:40:11,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:40:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:40:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:40:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:40:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:40:11,173 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:40:11,337 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:40:11,339 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:40:11,568 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:40:11,648 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:40:11,648 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:40:11,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:40:11 BoogieIcfgContainer [2022-12-11 23:40:11,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:40:11,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:40:11,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:40:11,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:40:11,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:40:10" (1/3) ... [2022-12-11 23:40:11,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e91c62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:40:11, skipping insertion in model container [2022-12-11 23:40:11,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:10" (2/3) ... [2022-12-11 23:40:11,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e91c62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:40:11, skipping insertion in model container [2022-12-11 23:40:11,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:40:11" (3/3) ... [2022-12-11 23:40:11,656 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 23:40:11,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:40:11,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:40:11,670 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:40:11,720 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:40:11,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 23:40:11,804 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-11 23:40:11,804 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:40:11,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-11 23:40:11,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 23:40:11,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-11 23:40:11,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:40:11,830 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;@5b81882b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:40:11,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 23:40:11,842 INFO L130 PetriNetUnfolder]: 0/69 cut-off events. [2022-12-11 23:40:11,842 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:40:11,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:11,846 INFO L214 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] [2022-12-11 23:40:11,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1769326636, now seen corresponding path program 1 times [2022-12-11 23:40:11,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:11,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327772382] [2022-12-11 23:40:11,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:12,355 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-11 23:40:12,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:12,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327772382] [2022-12-11 23:40:12,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327772382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:12,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:12,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:40:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897774138] [2022-12-11 23:40:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:12,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:40:12,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:12,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:40:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:40:12,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2022-12-11 23:40:12,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-11 23:40:12,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:12,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2022-12-11 23:40:12,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:12,507 INFO L130 PetriNetUnfolder]: 17/220 cut-off events. [2022-12-11 23:40:12,507 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 23:40:12,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 220 events. 17/220 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 674 event pairs, 7 based on Foata normal form. 9/217 useless extension candidates. Maximal degree in co-relation 224. Up to 27 conditions per place. [2022-12-11 23:40:12,510 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 10 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2022-12-11 23:40:12,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 237 flow [2022-12-11 23:40:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:40:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:40:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2022-12-11 23:40:12,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9308176100628931 [2022-12-11 23:40:12,525 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-11 23:40:12,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 102 transitions, 237 flow [2022-12-11 23:40:12,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 102 transitions, 237 flow [2022-12-11 23:40:12,528 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 237 flow [2022-12-11 23:40:12,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-11 23:40:12,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:12,528 INFO L214 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] [2022-12-11 23:40:12,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:40:12,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:12,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1632857268, now seen corresponding path program 1 times [2022-12-11 23:40:12,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:12,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825030081] [2022-12-11 23:40:12,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:12,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:13,093 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-11 23:40:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:13,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825030081] [2022-12-11 23:40:13,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825030081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:13,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:13,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:40:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032250020] [2022-12-11 23:40:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:13,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:40:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:13,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:40:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:40:13,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-12-11 23:40:13,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 77.71428571428571) internal successors, (544), 7 states have internal predecessors, (544), 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-11 23:40:13,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:13,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-12-11 23:40:13,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:13,819 INFO L130 PetriNetUnfolder]: 951/2737 cut-off events. [2022-12-11 23:40:13,819 INFO L131 PetriNetUnfolder]: For 468/731 co-relation queries the response was YES. [2022-12-11 23:40:13,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 2737 events. 951/2737 cut-off events. For 468/731 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22696 event pairs, 166 based on Foata normal form. 1/2652 useless extension candidates. Maximal degree in co-relation 4806. Up to 679 conditions per place. [2022-12-11 23:40:13,834 INFO L137 encePairwiseOnDemand]: 94/106 looper letters, 40 selfloop transitions, 12 changer transitions 87/202 dead transitions. [2022-12-11 23:40:13,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 202 transitions, 800 flow [2022-12-11 23:40:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1094 transitions. [2022-12-11 23:40:13,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7939042089985486 [2022-12-11 23:40:13,839 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2022-12-11 23:40:13,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 202 transitions, 800 flow [2022-12-11 23:40:13,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 115 transitions, 402 flow [2022-12-11 23:40:13,844 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 115 transitions, 402 flow [2022-12-11 23:40:13,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.71428571428571) internal successors, (544), 7 states have internal predecessors, (544), 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-11 23:40:13,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:13,845 INFO L214 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] [2022-12-11 23:40:13,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:40:13,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -614943371, now seen corresponding path program 1 times [2022-12-11 23:40:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:13,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688211450] [2022-12-11 23:40:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:14,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-11 23:40:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688211450] [2022-12-11 23:40:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688211450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:14,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:14,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:40:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064010258] [2022-12-11 23:40:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:14,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:40:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:40:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:40:14,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-12-11 23:40:14,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 115 transitions, 402 flow. Second operand has 10 states, 10 states have (on average 77.0) internal successors, (770), 10 states have internal predecessors, (770), 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-11 23:40:14,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:14,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-12-11 23:40:14,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:15,610 INFO L130 PetriNetUnfolder]: 820/2022 cut-off events. [2022-12-11 23:40:15,611 INFO L131 PetriNetUnfolder]: For 562/2131 co-relation queries the response was YES. [2022-12-11 23:40:15,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5239 conditions, 2022 events. 820/2022 cut-off events. For 562/2131 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14625 event pairs, 44 based on Foata normal form. 107/2098 useless extension candidates. Maximal degree in co-relation 5167. Up to 1024 conditions per place. [2022-12-11 23:40:15,622 INFO L137 encePairwiseOnDemand]: 88/106 looper letters, 51 selfloop transitions, 47 changer transitions 142/303 dead transitions. [2022-12-11 23:40:15,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 303 transitions, 1777 flow [2022-12-11 23:40:15,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 23:40:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 23:40:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1890 transitions. [2022-12-11 23:40:15,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7752255947497949 [2022-12-11 23:40:15,628 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 15 predicate places. [2022-12-11 23:40:15,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 303 transitions, 1777 flow [2022-12-11 23:40:15,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 161 transitions, 833 flow [2022-12-11 23:40:15,637 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 161 transitions, 833 flow [2022-12-11 23:40:15,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.0) internal successors, (770), 10 states have internal predecessors, (770), 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-11 23:40:15,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:15,638 INFO L214 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] [2022-12-11 23:40:15,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:40:15,638 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash -498183605, now seen corresponding path program 1 times [2022-12-11 23:40:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:15,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405410016] [2022-12-11 23:40:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:16,007 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-11 23:40:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:16,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405410016] [2022-12-11 23:40:16,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405410016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:16,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:16,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:40:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309890486] [2022-12-11 23:40:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:16,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:40:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:40:16,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:40:16,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-11 23:40:16,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 161 transitions, 833 flow. Second operand has 9 states, 9 states have (on average 85.55555555555556) internal successors, (770), 9 states have internal predecessors, (770), 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-11 23:40:16,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:16,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-11 23:40:16,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:16,348 INFO L130 PetriNetUnfolder]: 553/1476 cut-off events. [2022-12-11 23:40:16,349 INFO L131 PetriNetUnfolder]: For 1261/3595 co-relation queries the response was YES. [2022-12-11 23:40:16,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4417 conditions, 1476 events. 553/1476 cut-off events. For 1261/3595 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9924 event pairs, 52 based on Foata normal form. 109/1560 useless extension candidates. Maximal degree in co-relation 4339. Up to 703 conditions per place. [2022-12-11 23:40:16,356 INFO L137 encePairwiseOnDemand]: 98/106 looper letters, 53 selfloop transitions, 10 changer transitions 37/197 dead transitions. [2022-12-11 23:40:16,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 197 transitions, 1297 flow [2022-12-11 23:40:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 23:40:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 23:40:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 968 transitions. [2022-12-11 23:40:16,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8301886792452831 [2022-12-11 23:40:16,361 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2022-12-11 23:40:16,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 197 transitions, 1297 flow [2022-12-11 23:40:16,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 160 transitions, 951 flow [2022-12-11 23:40:16,367 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 160 transitions, 951 flow [2022-12-11 23:40:16,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.55555555555556) internal successors, (770), 9 states have internal predecessors, (770), 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-11 23:40:16,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:16,368 INFO L214 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] [2022-12-11 23:40:16,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:40:16,369 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:16,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash -19117933, now seen corresponding path program 1 times [2022-12-11 23:40:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:16,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339896035] [2022-12-11 23:40:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:16,876 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-11 23:40:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:16,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339896035] [2022-12-11 23:40:16,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339896035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:16,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:16,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:40:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474088130] [2022-12-11 23:40:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:16,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:40:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:40:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:40:16,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 23:40:16,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 160 transitions, 951 flow. Second operand has 10 states, 10 states have (on average 83.6) internal successors, (836), 10 states have internal predecessors, (836), 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-11 23:40:16,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:16,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 23:40:16,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:17,207 INFO L130 PetriNetUnfolder]: 509/1429 cut-off events. [2022-12-11 23:40:17,208 INFO L131 PetriNetUnfolder]: For 2053/3382 co-relation queries the response was YES. [2022-12-11 23:40:17,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4757 conditions, 1429 events. 509/1429 cut-off events. For 2053/3382 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9754 event pairs, 50 based on Foata normal form. 106/1505 useless extension candidates. Maximal degree in co-relation 4671. Up to 652 conditions per place. [2022-12-11 23:40:17,216 INFO L137 encePairwiseOnDemand]: 95/106 looper letters, 48 selfloop transitions, 20 changer transitions 44/207 dead transitions. [2022-12-11 23:40:17,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 207 transitions, 1593 flow [2022-12-11 23:40:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1116 transitions. [2022-12-11 23:40:17,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8098693759071117 [2022-12-11 23:40:17,219 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2022-12-11 23:40:17,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 207 transitions, 1593 flow [2022-12-11 23:40:17,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 163 transitions, 1113 flow [2022-12-11 23:40:17,226 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 163 transitions, 1113 flow [2022-12-11 23:40:17,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.6) internal successors, (836), 10 states have internal predecessors, (836), 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-11 23:40:17,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:17,226 INFO L214 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] [2022-12-11 23:40:17,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:40:17,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:17,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:17,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1511871113, now seen corresponding path program 1 times [2022-12-11 23:40:17,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:17,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465132943] [2022-12-11 23:40:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:17,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:17,619 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-11 23:40:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:17,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465132943] [2022-12-11 23:40:17,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465132943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:17,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:17,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:40:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825130122] [2022-12-11 23:40:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:17,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:40:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:40:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:40:17,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 23:40:17,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 163 transitions, 1113 flow. Second operand has 9 states, 9 states have (on average 84.77777777777777) internal successors, (763), 9 states have internal predecessors, (763), 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-11 23:40:17,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:17,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 23:40:17,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:17,914 INFO L130 PetriNetUnfolder]: 445/1305 cut-off events. [2022-12-11 23:40:17,914 INFO L131 PetriNetUnfolder]: For 3354/5515 co-relation queries the response was YES. [2022-12-11 23:40:17,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4833 conditions, 1305 events. 445/1305 cut-off events. For 3354/5515 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8818 event pairs, 52 based on Foata normal form. 105/1380 useless extension candidates. Maximal degree in co-relation 4740. Up to 582 conditions per place. [2022-12-11 23:40:17,929 INFO L137 encePairwiseOnDemand]: 95/106 looper letters, 58 selfloop transitions, 19 changer transitions 37/210 dead transitions. [2022-12-11 23:40:17,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 210 transitions, 1884 flow [2022-12-11 23:40:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 23:40:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 23:40:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1045 transitions. [2022-12-11 23:40:17,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8215408805031447 [2022-12-11 23:40:17,934 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 21 predicate places. [2022-12-11 23:40:17,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 210 transitions, 1884 flow [2022-12-11 23:40:17,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 173 transitions, 1390 flow [2022-12-11 23:40:17,940 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 173 transitions, 1390 flow [2022-12-11 23:40:17,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.77777777777777) internal successors, (763), 9 states have internal predecessors, (763), 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-11 23:40:17,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:17,941 INFO L214 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] [2022-12-11 23:40:17,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:40:17,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 415222317, now seen corresponding path program 2 times [2022-12-11 23:40:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:17,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406985090] [2022-12-11 23:40:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:18,457 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-11 23:40:18,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:18,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406985090] [2022-12-11 23:40:18,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406985090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:18,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:18,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 23:40:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418442977] [2022-12-11 23:40:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:18,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 23:40:18,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:18,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 23:40:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-11 23:40:18,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 23:40:18,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 173 transitions, 1390 flow. Second operand has 11 states, 11 states have (on average 83.54545454545455) internal successors, (919), 11 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-11 23:40:18,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:18,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 23:40:18,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:18,780 INFO L130 PetriNetUnfolder]: 453/1295 cut-off events. [2022-12-11 23:40:18,780 INFO L131 PetriNetUnfolder]: For 4976/7591 co-relation queries the response was YES. [2022-12-11 23:40:18,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5430 conditions, 1295 events. 453/1295 cut-off events. For 4976/7591 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8594 event pairs, 52 based on Foata normal form. 128/1394 useless extension candidates. Maximal degree in co-relation 5329. Up to 594 conditions per place. [2022-12-11 23:40:18,787 INFO L137 encePairwiseOnDemand]: 95/106 looper letters, 58 selfloop transitions, 26 changer transitions 37/216 dead transitions. [2022-12-11 23:40:18,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 216 transitions, 2210 flow [2022-12-11 23:40:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2022-12-11 23:40:18,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.809143686502177 [2022-12-11 23:40:18,790 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 27 predicate places. [2022-12-11 23:40:18,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 216 transitions, 2210 flow [2022-12-11 23:40:18,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 179 transitions, 1642 flow [2022-12-11 23:40:18,796 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 179 transitions, 1642 flow [2022-12-11 23:40:18,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 83.54545454545455) internal successors, (919), 11 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-11 23:40:18,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:18,797 INFO L214 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] [2022-12-11 23:40:18,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:40:18,797 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash 194430061, now seen corresponding path program 3 times [2022-12-11 23:40:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:18,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509680753] [2022-12-11 23:40:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:18,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:19,216 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-11 23:40:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:19,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509680753] [2022-12-11 23:40:19,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509680753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:19,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:19,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:40:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090065349] [2022-12-11 23:40:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:19,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:40:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:40:19,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:40:19,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 23:40:19,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 179 transitions, 1642 flow. Second operand has 10 states, 10 states have (on average 83.7) internal successors, (837), 10 states have internal predecessors, (837), 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-11 23:40:19,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:19,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 23:40:19,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:19,528 INFO L130 PetriNetUnfolder]: 422/1313 cut-off events. [2022-12-11 23:40:19,529 INFO L131 PetriNetUnfolder]: For 6758/9272 co-relation queries the response was YES. [2022-12-11 23:40:19,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5854 conditions, 1313 events. 422/1313 cut-off events. For 6758/9272 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9172 event pairs, 42 based on Foata normal form. 117/1405 useless extension candidates. Maximal degree in co-relation 5745. Up to 566 conditions per place. [2022-12-11 23:40:19,536 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 75 selfloop transitions, 23 changer transitions 37/230 dead transitions. [2022-12-11 23:40:19,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 230 transitions, 2688 flow [2022-12-11 23:40:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 23:40:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 23:40:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1034 transitions. [2022-12-11 23:40:19,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8128930817610063 [2022-12-11 23:40:19,540 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 32 predicate places. [2022-12-11 23:40:19,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 230 transitions, 2688 flow [2022-12-11 23:40:19,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 193 transitions, 2046 flow [2022-12-11 23:40:19,547 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 193 transitions, 2046 flow [2022-12-11 23:40:19,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.7) internal successors, (837), 10 states have internal predecessors, (837), 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-11 23:40:19,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:19,547 INFO L214 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] [2022-12-11 23:40:19,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:40:19,547 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash -349318060, now seen corresponding path program 1 times [2022-12-11 23:40:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:19,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176410019] [2022-12-11 23:40:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:19,995 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-11 23:40:19,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:19,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176410019] [2022-12-11 23:40:19,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176410019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:19,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:19,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 23:40:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705324142] [2022-12-11 23:40:19,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:19,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 23:40:19,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:19,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 23:40:19,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-11 23:40:19,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 23:40:19,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 193 transitions, 2046 flow. Second operand has 11 states, 11 states have (on average 83.63636363636364) internal successors, (920), 11 states have internal predecessors, (920), 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-11 23:40:19,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:19,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 23:40:19,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:20,242 INFO L130 PetriNetUnfolder]: 363/1141 cut-off events. [2022-12-11 23:40:20,242 INFO L131 PetriNetUnfolder]: For 8324/11871 co-relation queries the response was YES. [2022-12-11 23:40:20,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5557 conditions, 1141 events. 363/1141 cut-off events. For 8324/11871 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7565 event pairs, 24 based on Foata normal form. 129/1238 useless extension candidates. Maximal degree in co-relation 5440. Up to 501 conditions per place. [2022-12-11 23:40:20,248 INFO L137 encePairwiseOnDemand]: 94/106 looper letters, 67 selfloop transitions, 39 changer transitions 19/220 dead transitions. [2022-12-11 23:40:20,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 220 transitions, 2758 flow [2022-12-11 23:40:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 23:40:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 23:40:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1195 transitions. [2022-12-11 23:40:20,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.805256064690027 [2022-12-11 23:40:20,253 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 39 predicate places. [2022-12-11 23:40:20,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 220 transitions, 2758 flow [2022-12-11 23:40:20,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 201 transitions, 2402 flow [2022-12-11 23:40:20,259 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 201 transitions, 2402 flow [2022-12-11 23:40:20,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 83.63636363636364) internal successors, (920), 11 states have internal predecessors, (920), 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-11 23:40:20,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:20,260 INFO L214 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] [2022-12-11 23:40:20,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:40:20,260 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:20,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash 216991446, now seen corresponding path program 2 times [2022-12-11 23:40:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:20,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495479568] [2022-12-11 23:40:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:20,745 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-11 23:40:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:20,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495479568] [2022-12-11 23:40:20,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495479568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:20,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:20,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:40:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085250235] [2022-12-11 23:40:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:20,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:40:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:20,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:40:20,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:40:20,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-11 23:40:20,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 201 transitions, 2402 flow. Second operand has 12 states, 12 states have (on average 82.58333333333333) internal successors, (991), 12 states have internal predecessors, (991), 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-11 23:40:20,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:20,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-11 23:40:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:21,046 INFO L130 PetriNetUnfolder]: 373/1202 cut-off events. [2022-12-11 23:40:21,046 INFO L131 PetriNetUnfolder]: For 11024/17185 co-relation queries the response was YES. [2022-12-11 23:40:21,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6214 conditions, 1202 events. 373/1202 cut-off events. For 11024/17185 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8337 event pairs, 26 based on Foata normal form. 139/1310 useless extension candidates. Maximal degree in co-relation 6088. Up to 519 conditions per place. [2022-12-11 23:40:21,053 INFO L137 encePairwiseOnDemand]: 94/106 looper letters, 89 selfloop transitions, 22 changer transitions 19/224 dead transitions. [2022-12-11 23:40:21,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 224 transitions, 3098 flow [2022-12-11 23:40:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1095 transitions. [2022-12-11 23:40:21,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7946298984034833 [2022-12-11 23:40:21,056 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 45 predicate places. [2022-12-11 23:40:21,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 224 transitions, 3098 flow [2022-12-11 23:40:21,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 205 transitions, 2704 flow [2022-12-11 23:40:21,061 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 205 transitions, 2704 flow [2022-12-11 23:40:21,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.58333333333333) internal successors, (991), 12 states have internal predecessors, (991), 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-11 23:40:21,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:21,061 INFO L214 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] [2022-12-11 23:40:21,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:40:21,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1033537492, now seen corresponding path program 3 times [2022-12-11 23:40:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:21,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227534683] [2022-12-11 23:40:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:21,680 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-11 23:40:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:21,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227534683] [2022-12-11 23:40:21,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227534683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:21,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:21,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:40:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776293398] [2022-12-11 23:40:21,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:21,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:40:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:40:21,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:40:21,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-12-11 23:40:21,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 205 transitions, 2704 flow. Second operand has 12 states, 12 states have (on average 76.91666666666667) internal successors, (923), 12 states have internal predecessors, (923), 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-11 23:40:21,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:21,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-12-11 23:40:21,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:22,192 INFO L130 PetriNetUnfolder]: 375/1196 cut-off events. [2022-12-11 23:40:22,192 INFO L131 PetriNetUnfolder]: For 14939/36846 co-relation queries the response was YES. [2022-12-11 23:40:22,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6959 conditions, 1196 events. 375/1196 cut-off events. For 14939/36846 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8267 event pairs, 10 based on Foata normal form. 144/1304 useless extension candidates. Maximal degree in co-relation 6821. Up to 525 conditions per place. [2022-12-11 23:40:22,200 INFO L137 encePairwiseOnDemand]: 94/106 looper letters, 109 selfloop transitions, 43 changer transitions 31/246 dead transitions. [2022-12-11 23:40:22,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 246 transitions, 3628 flow [2022-12-11 23:40:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 23:40:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 23:40:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1200 transitions. [2022-12-11 23:40:22,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2022-12-11 23:40:22,202 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 53 predicate places. [2022-12-11 23:40:22,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 246 transitions, 3628 flow [2022-12-11 23:40:22,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 215 transitions, 3100 flow [2022-12-11 23:40:22,209 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 215 transitions, 3100 flow [2022-12-11 23:40:22,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.91666666666667) internal successors, (923), 12 states have internal predecessors, (923), 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-11 23:40:22,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:22,211 INFO L214 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] [2022-12-11 23:40:22,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:40:22,211 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash 342309174, now seen corresponding path program 4 times [2022-12-11 23:40:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:22,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23602560] [2022-12-11 23:40:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:22,840 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-11 23:40:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:22,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23602560] [2022-12-11 23:40:22,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23602560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:22,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:22,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 23:40:22,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315611946] [2022-12-11 23:40:22,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:22,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 23:40:22,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:22,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 23:40:22,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-11 23:40:22,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 106 [2022-12-11 23:40:22,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 215 transitions, 3100 flow. Second operand has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 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-11 23:40:22,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:22,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 106 [2022-12-11 23:40:22,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:23,316 INFO L130 PetriNetUnfolder]: 341/1223 cut-off events. [2022-12-11 23:40:23,316 INFO L131 PetriNetUnfolder]: For 19532/41812 co-relation queries the response was YES. [2022-12-11 23:40:23,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7217 conditions, 1223 events. 341/1223 cut-off events. For 19532/41812 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8985 event pairs, 8 based on Foata normal form. 104/1294 useless extension candidates. Maximal degree in co-relation 7067. Up to 494 conditions per place. [2022-12-11 23:40:23,324 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 101 selfloop transitions, 25 changer transitions 19/244 dead transitions. [2022-12-11 23:40:23,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 244 transitions, 4046 flow [2022-12-11 23:40:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1059 transitions. [2022-12-11 23:40:23,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7685050798258345 [2022-12-11 23:40:23,326 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 59 predicate places. [2022-12-11 23:40:23,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 244 transitions, 4046 flow [2022-12-11 23:40:23,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 225 transitions, 3576 flow [2022-12-11 23:40:23,332 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 225 transitions, 3576 flow [2022-12-11 23:40:23,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 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-11 23:40:23,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:23,333 INFO L214 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] [2022-12-11 23:40:23,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:40:23,333 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1955017860, now seen corresponding path program 1 times [2022-12-11 23:40:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:23,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541290094] [2022-12-11 23:40:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:23,459 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-11 23:40:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541290094] [2022-12-11 23:40:23,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541290094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:23,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:23,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:40:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160410211] [2022-12-11 23:40:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:23,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:40:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:23,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:40:23,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:40:23,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 23:40:23,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 225 transitions, 3576 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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-11 23:40:23,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:23,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 23:40:23,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:24,155 INFO L130 PetriNetUnfolder]: 2710/5394 cut-off events. [2022-12-11 23:40:24,155 INFO L131 PetriNetUnfolder]: For 137876/146149 co-relation queries the response was YES. [2022-12-11 23:40:24,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30672 conditions, 5394 events. 2710/5394 cut-off events. For 137876/146149 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 43165 event pairs, 61 based on Foata normal form. 385/5542 useless extension candidates. Maximal degree in co-relation 30518. Up to 1775 conditions per place. [2022-12-11 23:40:24,182 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 162 selfloop transitions, 13 changer transitions 138/442 dead transitions. [2022-12-11 23:40:24,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 442 transitions, 9165 flow [2022-12-11 23:40:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:40:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:40:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 904 transitions. [2022-12-11 23:40:24,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8528301886792453 [2022-12-11 23:40:24,186 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 62 predicate places. [2022-12-11 23:40:24,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 442 transitions, 9165 flow [2022-12-11 23:40:24,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 304 transitions, 5541 flow [2022-12-11 23:40:24,205 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 304 transitions, 5541 flow [2022-12-11 23:40:24,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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-11 23:40:24,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:24,206 INFO L214 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] [2022-12-11 23:40:24,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:40:24,206 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1840707788, now seen corresponding path program 1 times [2022-12-11 23:40:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:24,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411764026] [2022-12-11 23:40:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:24,315 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-11 23:40:24,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:24,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411764026] [2022-12-11 23:40:24,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411764026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:24,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:24,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:40:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353506932] [2022-12-11 23:40:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:24,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:40:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:40:24,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:40:24,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 23:40:24,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 304 transitions, 5541 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-11 23:40:24,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:24,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 23:40:24,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:24,925 INFO L130 PetriNetUnfolder]: 1373/3965 cut-off events. [2022-12-11 23:40:24,925 INFO L131 PetriNetUnfolder]: For 63277/67039 co-relation queries the response was YES. [2022-12-11 23:40:24,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19593 conditions, 3965 events. 1373/3965 cut-off events. For 63277/67039 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 38771 event pairs, 31 based on Foata normal form. 530/4398 useless extension candidates. Maximal degree in co-relation 19435. Up to 1315 conditions per place. [2022-12-11 23:40:24,944 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 175 selfloop transitions, 32 changer transitions 112/438 dead transitions. [2022-12-11 23:40:24,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 438 transitions, 9033 flow [2022-12-11 23:40:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1166 transitions. [2022-12-11 23:40:24,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2022-12-11 23:40:24,947 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 74 predicate places. [2022-12-11 23:40:24,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 438 transitions, 9033 flow [2022-12-11 23:40:24,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 326 transitions, 6129 flow [2022-12-11 23:40:24,956 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 326 transitions, 6129 flow [2022-12-11 23:40:24,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-11 23:40:24,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:24,957 INFO L214 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] [2022-12-11 23:40:24,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 23:40:24,957 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1719531641, now seen corresponding path program 1 times [2022-12-11 23:40:24,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:24,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997864358] [2022-12-11 23:40:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:25,228 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-11 23:40:25,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:25,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997864358] [2022-12-11 23:40:25,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997864358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:25,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:25,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:40:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551174875] [2022-12-11 23:40:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:25,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:40:25,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:40:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:40:25,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-11 23:40:25,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 326 transitions, 6129 flow. Second operand has 8 states, 8 states have (on average 76.125) internal successors, (609), 8 states have internal predecessors, (609), 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-11 23:40:25,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:25,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-11 23:40:25,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:26,096 INFO L130 PetriNetUnfolder]: 1982/6126 cut-off events. [2022-12-11 23:40:26,097 INFO L131 PetriNetUnfolder]: For 81130/86127 co-relation queries the response was YES. [2022-12-11 23:40:26,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29198 conditions, 6126 events. 1982/6126 cut-off events. For 81130/86127 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 66852 event pairs, 46 based on Foata normal form. 197/6172 useless extension candidates. Maximal degree in co-relation 29027. Up to 1951 conditions per place. [2022-12-11 23:40:26,125 INFO L137 encePairwiseOnDemand]: 92/106 looper letters, 109 selfloop transitions, 45 changer transitions 265/511 dead transitions. [2022-12-11 23:40:26,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 511 transitions, 11737 flow [2022-12-11 23:40:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:40:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:40:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 735 transitions. [2022-12-11 23:40:26,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7704402515723271 [2022-12-11 23:40:26,127 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 82 predicate places. [2022-12-11 23:40:26,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 511 transitions, 11737 flow [2022-12-11 23:40:26,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 246 transitions, 4481 flow [2022-12-11 23:40:26,139 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 246 transitions, 4481 flow [2022-12-11 23:40:26,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.125) internal successors, (609), 8 states have internal predecessors, (609), 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-11 23:40:26,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:26,140 INFO L214 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] [2022-12-11 23:40:26,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 23:40:26,140 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:26,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1020956055, now seen corresponding path program 2 times [2022-12-11 23:40:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:26,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998035313] [2022-12-11 23:40:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:26,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:26,263 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-11 23:40:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:26,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998035313] [2022-12-11 23:40:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998035313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:26,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:26,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:40:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754910101] [2022-12-11 23:40:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:26,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:40:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:26,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:40:26,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:40:26,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2022-12-11 23:40:26,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 246 transitions, 4481 flow. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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-11 23:40:26,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:26,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2022-12-11 23:40:26,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:26,611 INFO L130 PetriNetUnfolder]: 801/3077 cut-off events. [2022-12-11 23:40:26,611 INFO L131 PetriNetUnfolder]: For 35519/36228 co-relation queries the response was YES. [2022-12-11 23:40:26,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14673 conditions, 3077 events. 801/3077 cut-off events. For 35519/36228 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31420 event pairs, 28 based on Foata normal form. 71/3079 useless extension candidates. Maximal degree in co-relation 14498. Up to 1098 conditions per place. [2022-12-11 23:40:26,624 INFO L137 encePairwiseOnDemand]: 100/106 looper letters, 88 selfloop transitions, 6 changer transitions 84/292 dead transitions. [2022-12-11 23:40:26,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 292 transitions, 6131 flow [2022-12-11 23:40:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:40:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:40:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 807 transitions. [2022-12-11 23:40:26,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8459119496855346 [2022-12-11 23:40:26,626 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 84 predicate places. [2022-12-11 23:40:26,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 292 transitions, 6131 flow [2022-12-11 23:40:26,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 208 transitions, 3575 flow [2022-12-11 23:40:26,633 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 208 transitions, 3575 flow [2022-12-11 23:40:26,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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-11 23:40:26,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:26,634 INFO L214 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-11 23:40:26,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 23:40:26,634 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2041331607, now seen corresponding path program 1 times [2022-12-11 23:40:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:26,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866865356] [2022-12-11 23:40:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:26,763 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-11 23:40:26,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:26,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866865356] [2022-12-11 23:40:26,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866865356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:26,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:26,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:40:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930309441] [2022-12-11 23:40:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:26,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:40:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:40:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:40:26,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 23:40:26,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 208 transitions, 3575 flow. Second operand has 8 states, 8 states have (on average 85.125) internal successors, (681), 8 states have internal predecessors, (681), 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-11 23:40:26,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:26,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 23:40:26,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:27,118 INFO L130 PetriNetUnfolder]: 383/1630 cut-off events. [2022-12-11 23:40:27,118 INFO L131 PetriNetUnfolder]: For 15941/16644 co-relation queries the response was YES. [2022-12-11 23:40:27,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7614 conditions, 1630 events. 383/1630 cut-off events. For 15941/16644 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15041 event pairs, 20 based on Foata normal form. 162/1781 useless extension candidates. Maximal degree in co-relation 7435. Up to 520 conditions per place. [2022-12-11 23:40:27,123 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 20 selfloop transitions, 12 changer transitions 108/210 dead transitions. [2022-12-11 23:40:27,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 210 transitions, 3563 flow [2022-12-11 23:40:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:40:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:40:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1396 transitions. [2022-12-11 23:40:27,125 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8231132075471698 [2022-12-11 23:40:27,125 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 93 predicate places. [2022-12-11 23:40:27,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 210 transitions, 3563 flow [2022-12-11 23:40:27,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 102 transitions, 1199 flow [2022-12-11 23:40:27,127 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 102 transitions, 1199 flow [2022-12-11 23:40:27,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.125) internal successors, (681), 8 states have internal predecessors, (681), 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-11 23:40:27,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:27,127 INFO L214 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-11 23:40:27,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 23:40:27,127 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:40:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1729974027, now seen corresponding path program 1 times [2022-12-11 23:40:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:27,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559964654] [2022-12-11 23:40:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:40:27,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:40:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:40:27,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:40:27,182 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:40:27,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 23:40:27,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 23:40:27,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 23:40:27,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 23:40:27,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 23:40:27,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 23:40:27,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 23:40:27,186 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:27,191 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:40:27,191 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:40:27,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:40:27 BasicIcfg [2022-12-11 23:40:27,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:40:27,275 INFO L158 Benchmark]: Toolchain (without parser) took 16723.56ms. Allocated memory was 218.1MB in the beginning and 691.0MB in the end (delta: 472.9MB). Free memory was 192.7MB in the beginning and 573.3MB in the end (delta: -380.6MB). Peak memory consumption was 93.7MB. Max. memory is 8.0GB. [2022-12-11 23:40:27,276 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 218.1MB. Free memory was 194.2MB in the beginning and 194.0MB in the end (delta: 153.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:40:27,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.84ms. Allocated memory is still 218.1MB. Free memory was 192.6MB in the beginning and 166.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 23:40:27,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.59ms. Allocated memory is still 218.1MB. Free memory was 166.4MB in the beginning and 163.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 23:40:27,276 INFO L158 Benchmark]: Boogie Preprocessor took 49.89ms. Allocated memory is still 218.1MB. Free memory was 163.8MB in the beginning and 162.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 23:40:27,276 INFO L158 Benchmark]: RCFGBuilder took 564.05ms. Allocated memory is still 218.1MB. Free memory was 162.2MB in the beginning and 130.2MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-11 23:40:27,277 INFO L158 Benchmark]: TraceAbstraction took 15623.14ms. Allocated memory was 218.1MB in the beginning and 691.0MB in the end (delta: 472.9MB). Free memory was 128.6MB in the beginning and 573.3MB in the end (delta: -444.7MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. [2022-12-11 23:40:27,278 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 218.1MB. Free memory was 194.2MB in the beginning and 194.0MB in the end (delta: 153.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.84ms. Allocated memory is still 218.1MB. Free memory was 192.6MB in the beginning and 166.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.59ms. Allocated memory is still 218.1MB. Free memory was 166.4MB in the beginning and 163.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.89ms. Allocated memory is still 218.1MB. Free memory was 163.8MB in the beginning and 162.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 564.05ms. Allocated memory is still 218.1MB. Free memory was 162.2MB in the beginning and 130.2MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15623.14ms. Allocated memory was 218.1MB in the beginning and 691.0MB in the end (delta: 472.9MB). Free memory was 128.6MB in the beginning and 573.3MB in the end (delta: -444.7MB). Peak memory consumption was 29.7MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 814]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 1265 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1029 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2288 IncrementalHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 236 mSDtfsCounter, 2288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6129occurred in iteration=14, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 24324 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1314 NumberOfCodeBlocks, 1314 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1215 ConstructedInterpolants, 0 QuantifiedInterpolants, 6818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-11 23:40:27,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...