/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/mix053.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:39:44,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:39:44,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:39:44,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:39:44,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:39:44,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:39:44,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:39:44,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:39:44,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:39:44,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:39:44,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:39:44,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:39:44,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:39:44,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:39:44,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:39:44,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:39:44,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:39:44,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:39:44,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:39:44,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:39:44,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:39:44,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:39:44,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:39:44,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:39:44,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:39:44,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:39:44,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:39:44,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:39:44,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:39:44,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:39:44,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:39:44,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:39:44,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:39:44,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:39:44,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:39:44,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:39:44,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:39:44,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:39:44,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:39:44,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:39:44,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:39:44,184 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:39:44,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:39:44,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:39:44,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:39:44,227 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:39:44,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:39:44,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:39:44,228 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:39:44,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:39:44,229 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:39:44,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:39:44,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:39:44,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:39:44,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:39:44,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:39:44,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:39:44,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:39:44,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:39:44,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:39:44,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:39:44,231 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:39:44,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:39:44,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:39:44,231 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:39:44,231 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:39:44,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:39:44,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:39:44,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:39:44,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:39:44,499 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:39:44,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2022-12-11 23:39:45,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:39:45,604 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:39:45,605 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2022-12-11 23:39:45,624 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958b21c0a/b1eb366a24e6462eaa081d0b8621d152/FLAGfae42045b [2022-12-11 23:39:45,649 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958b21c0a/b1eb366a24e6462eaa081d0b8621d152 [2022-12-11 23:39:45,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:39:45,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:39:45,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:39:45,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:39:45,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:39:45,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:39:45" (1/1) ... [2022-12-11 23:39:45,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5f53fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:45, skipping insertion in model container [2022-12-11 23:39:45,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:39:45" (1/1) ... [2022-12-11 23:39:45,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:39:45,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:39:45,845 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/mix053.opt.i[944,957] [2022-12-11 23:39:45,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:45,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:45,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:39:46,008 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:39:46,016 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/mix053.opt.i[944,957] [2022-12-11 23:39:46,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:39:46,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:39:46,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:39:46,084 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:39:46,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46 WrapperNode [2022-12-11 23:39:46,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:39:46,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:39:46,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:39:46,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:39:46,091 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:39:46" (1/1) ... [2022-12-11 23:39:46,104 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:39:46" (1/1) ... [2022-12-11 23:39:46,119 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-11 23:39:46,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:39:46,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:39:46,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:39:46,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:39:46,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,137 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:39:46,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:39:46,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:39:46,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:39:46,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (1/1) ... [2022-12-11 23:39:46,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:39:46,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:39:46,165 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:39:46,172 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:39:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:39:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:39:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:39:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:39:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:39:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:39:46,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:39:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:39:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:39:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:39:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:39:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 23:39:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 23:39:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:39:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:39:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:39:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:39:46,194 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:39:46,281 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:39:46,282 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:39:46,500 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:39:46,642 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:39:46,642 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:39:46,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:39:46 BoogieIcfgContainer [2022-12-11 23:39:46,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:39:46,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:39:46,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:39:46,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:39:46,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:39:45" (1/3) ... [2022-12-11 23:39:46,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a1a080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:39:46, skipping insertion in model container [2022-12-11 23:39:46,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:39:46" (2/3) ... [2022-12-11 23:39:46,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a1a080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:39:46, skipping insertion in model container [2022-12-11 23:39:46,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:39:46" (3/3) ... [2022-12-11 23:39:46,649 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2022-12-11 23:39:46,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:39:46,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:39:46,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:39:46,720 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:39:46,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2022-12-11 23:39:46,813 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-11 23:39:46,813 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:39:46,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-11 23:39:46,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2022-12-11 23:39:46,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2022-12-11 23:39:46,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:39:46,837 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;@1d24d538, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:39:46,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 23:39:46,858 INFO L130 PetriNetUnfolder]: 0/85 cut-off events. [2022-12-11 23:39:46,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:39:46,861 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:46,862 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] [2022-12-11 23:39:46,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash 550895210, now seen corresponding path program 1 times [2022-12-11 23:39:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:46,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126748243] [2022-12-11 23:39:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:47,346 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:39:47,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:47,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126748243] [2022-12-11 23:39:47,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126748243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:47,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:47,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:39:47,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273855527] [2022-12-11 23:39:47,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:47,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:39:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:47,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:39:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:39:47,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 125 [2022-12-11 23:39:47,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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:39:47,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:47,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 125 [2022-12-11 23:39:47,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:47,449 INFO L130 PetriNetUnfolder]: 10/187 cut-off events. [2022-12-11 23:39:47,450 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 23:39:47,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 187 events. 10/187 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 345 event pairs, 4 based on Foata normal form. 5/183 useless extension candidates. Maximal degree in co-relation 177. Up to 17 conditions per place. [2022-12-11 23:39:47,452 INFO L137 encePairwiseOnDemand]: 120/125 looper letters, 9 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2022-12-11 23:39:47,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 119 transitions, 272 flow [2022-12-11 23:39:47,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:39:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:39:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2022-12-11 23:39:47,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9386666666666666 [2022-12-11 23:39:47,464 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 0 predicate places. [2022-12-11 23:39:47,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 119 transitions, 272 flow [2022-12-11 23:39:47,466 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 119 transitions, 272 flow [2022-12-11 23:39:47,467 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 119 transitions, 272 flow [2022-12-11 23:39:47,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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:39:47,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:47,467 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] [2022-12-11 23:39:47,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:39:47,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1376446795, now seen corresponding path program 1 times [2022-12-11 23:39:47,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:47,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900824179] [2022-12-11 23:39:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:47,898 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:39:47,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:47,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900824179] [2022-12-11 23:39:47,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900824179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:47,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:47,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:39:47,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022167429] [2022-12-11 23:39:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:47,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:39:47,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:47,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:39:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:39:47,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125 [2022-12-11 23:39:47,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 119 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 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:39:47,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:47,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125 [2022-12-11 23:39:47,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:49,067 INFO L130 PetriNetUnfolder]: 2993/7544 cut-off events. [2022-12-11 23:39:49,067 INFO L131 PetriNetUnfolder]: For 1245/2283 co-relation queries the response was YES. [2022-12-11 23:39:49,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13300 conditions, 7544 events. 2993/7544 cut-off events. For 1245/2283 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 71423 event pairs, 330 based on Foata normal form. 1/7358 useless extension candidates. Maximal degree in co-relation 13240. Up to 1419 conditions per place. [2022-12-11 23:39:49,104 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 45 selfloop transitions, 10 changer transitions 105/242 dead transitions. [2022-12-11 23:39:49,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 242 transitions, 937 flow [2022-12-11 23:39:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:39:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:39:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1398 transitions. [2022-12-11 23:39:49,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8603076923076923 [2022-12-11 23:39:49,109 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 12 predicate places. [2022-12-11 23:39:49,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 242 transitions, 937 flow [2022-12-11 23:39:49,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 137 transitions, 467 flow [2022-12-11 23:39:49,126 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 137 transitions, 467 flow [2022-12-11 23:39:49,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 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:39:49,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:49,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] [2022-12-11 23:39:49,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:39:49,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -373215526, now seen corresponding path program 1 times [2022-12-11 23:39:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081306282] [2022-12-11 23:39:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:49,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:49,376 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:39:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081306282] [2022-12-11 23:39:49,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081306282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:49,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:49,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:39:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586768818] [2022-12-11 23:39:49,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:49,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:39:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:39:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:39:49,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125 [2022-12-11 23:39:49,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 137 transitions, 467 flow. Second operand has 7 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 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:39:49,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:49,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125 [2022-12-11 23:39:49,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:50,022 INFO L130 PetriNetUnfolder]: 1898/4190 cut-off events. [2022-12-11 23:39:50,022 INFO L131 PetriNetUnfolder]: For 1284/5284 co-relation queries the response was YES. [2022-12-11 23:39:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10977 conditions, 4190 events. 1898/4190 cut-off events. For 1284/5284 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 33443 event pairs, 142 based on Foata normal form. 119/4221 useless extension candidates. Maximal degree in co-relation 10910. Up to 1623 conditions per place. [2022-12-11 23:39:50,047 INFO L137 encePairwiseOnDemand]: 113/125 looper letters, 68 selfloop transitions, 15 changer transitions 100/265 dead transitions. [2022-12-11 23:39:50,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 265 transitions, 1461 flow [2022-12-11 23:39:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:39:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:39:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1387 transitions. [2022-12-11 23:39:50,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8535384615384616 [2022-12-11 23:39:50,051 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 3 predicate places. [2022-12-11 23:39:50,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 265 transitions, 1461 flow [2022-12-11 23:39:50,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 165 transitions, 789 flow [2022-12-11 23:39:50,067 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 165 transitions, 789 flow [2022-12-11 23:39:50,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 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:39:50,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:50,070 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, 1] [2022-12-11 23:39:50,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:39:50,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1025769685, now seen corresponding path program 1 times [2022-12-11 23:39:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:50,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737891342] [2022-12-11 23:39:50,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:50,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:50,248 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:39:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:50,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737891342] [2022-12-11 23:39:50,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737891342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:50,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:50,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:39:50,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38941149] [2022-12-11 23:39:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:50,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:39:50,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:39:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:39:50,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2022-12-11 23:39:50,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 165 transitions, 789 flow. Second operand has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 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:39:50,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:50,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2022-12-11 23:39:50,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:52,041 INFO L130 PetriNetUnfolder]: 10130/17872 cut-off events. [2022-12-11 23:39:52,042 INFO L131 PetriNetUnfolder]: For 26109/29376 co-relation queries the response was YES. [2022-12-11 23:39:52,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50517 conditions, 17872 events. 10130/17872 cut-off events. For 26109/29376 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 150804 event pairs, 248 based on Foata normal form. 214/17305 useless extension candidates. Maximal degree in co-relation 50446. Up to 5759 conditions per place. [2022-12-11 23:39:52,185 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 189 selfloop transitions, 20 changer transitions 2/321 dead transitions. [2022-12-11 23:39:52,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 321 transitions, 2264 flow [2022-12-11 23:39:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:39:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:39:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1093 transitions. [2022-12-11 23:39:52,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8744 [2022-12-11 23:39:52,188 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 3 predicate places. [2022-12-11 23:39:52,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 321 transitions, 2264 flow [2022-12-11 23:39:52,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 319 transitions, 2244 flow [2022-12-11 23:39:52,305 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 319 transitions, 2244 flow [2022-12-11 23:39:52,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 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:39:52,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:52,305 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, 1, 1, 1] [2022-12-11 23:39:52,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:39:52,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash -703373666, now seen corresponding path program 1 times [2022-12-11 23:39:52,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:52,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507337478] [2022-12-11 23:39:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:52,442 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:39:52,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:52,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507337478] [2022-12-11 23:39:52,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507337478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:52,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:52,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:39:52,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607657874] [2022-12-11 23:39:52,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:52,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:39:52,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:39:52,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:39:52,444 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125 [2022-12-11 23:39:52,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 319 transitions, 2244 flow. Second operand has 7 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 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:39:52,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:52,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125 [2022-12-11 23:39:52,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:55,426 INFO L130 PetriNetUnfolder]: 16250/28650 cut-off events. [2022-12-11 23:39:55,427 INFO L131 PetriNetUnfolder]: For 65889/81044 co-relation queries the response was YES. [2022-12-11 23:39:55,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92563 conditions, 28650 events. 16250/28650 cut-off events. For 65889/81044 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 257452 event pairs, 575 based on Foata normal form. 2223/29585 useless extension candidates. Maximal degree in co-relation 92485. Up to 10128 conditions per place. [2022-12-11 23:39:55,607 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 273 selfloop transitions, 48 changer transitions 65/505 dead transitions. [2022-12-11 23:39:55,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 505 transitions, 4674 flow [2022-12-11 23:39:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:39:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:39:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1374 transitions. [2022-12-11 23:39:55,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8455384615384616 [2022-12-11 23:39:55,613 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 15 predicate places. [2022-12-11 23:39:55,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 505 transitions, 4674 flow [2022-12-11 23:39:55,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 440 transitions, 3918 flow [2022-12-11 23:39:55,689 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 440 transitions, 3918 flow [2022-12-11 23:39:55,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 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:39:55,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:55,690 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, 1, 1, 1] [2022-12-11 23:39:55,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:39:55,690 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:55,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 681860148, now seen corresponding path program 1 times [2022-12-11 23:39:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:55,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622132346] [2022-12-11 23:39:55,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:55,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:55,852 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:39:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:55,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622132346] [2022-12-11 23:39:55,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622132346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:55,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:55,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:39:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119219549] [2022-12-11 23:39:55,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:55,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:39:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:39:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:39:55,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2022-12-11 23:39:55,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 440 transitions, 3918 flow. Second operand has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 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:39:55,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:55,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2022-12-11 23:39:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:39:58,604 INFO L130 PetriNetUnfolder]: 11843/24383 cut-off events. [2022-12-11 23:39:58,604 INFO L131 PetriNetUnfolder]: For 51482/64143 co-relation queries the response was YES. [2022-12-11 23:39:58,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84790 conditions, 24383 events. 11843/24383 cut-off events. For 51482/64143 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 253406 event pairs, 186 based on Foata normal form. 1396/25118 useless extension candidates. Maximal degree in co-relation 84708. Up to 8024 conditions per place. [2022-12-11 23:39:58,736 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 380 selfloop transitions, 54 changer transitions 73/657 dead transitions. [2022-12-11 23:39:58,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 657 transitions, 7080 flow [2022-12-11 23:39:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:39:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:39:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1424 transitions. [2022-12-11 23:39:58,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8763076923076923 [2022-12-11 23:39:58,740 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 27 predicate places. [2022-12-11 23:39:58,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 657 transitions, 7080 flow [2022-12-11 23:39:58,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 584 transitions, 6170 flow [2022-12-11 23:39:58,796 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 584 transitions, 6170 flow [2022-12-11 23:39:58,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 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:39:58,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:39:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:39:58,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:39:58,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:39:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:39:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1342966959, now seen corresponding path program 1 times [2022-12-11 23:39:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:39:58,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571408121] [2022-12-11 23:39:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:39:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:39:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:39:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:39:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:39:59,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571408121] [2022-12-11 23:39:59,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571408121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:39:59,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:39:59,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:39:59,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856186238] [2022-12-11 23:39:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:39:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:39:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:39:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:39:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:39:59,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2022-12-11 23:39:59,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 584 transitions, 6170 flow. Second operand has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 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:39:59,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:39:59,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2022-12-11 23:39:59,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:01,597 INFO L130 PetriNetUnfolder]: 9661/21244 cut-off events. [2022-12-11 23:40:01,598 INFO L131 PetriNetUnfolder]: For 46841/59999 co-relation queries the response was YES. [2022-12-11 23:40:01,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86244 conditions, 21244 events. 9661/21244 cut-off events. For 46841/59999 co-relation queries the response was YES. Maximal size of possible extension queue 1698. Compared 233700 event pairs, 87 based on Foata normal form. 1502/22290 useless extension candidates. Maximal degree in co-relation 86158. Up to 6747 conditions per place. [2022-12-11 23:40:01,729 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 375 selfloop transitions, 96 changer transitions 189/784 dead transitions. [2022-12-11 23:40:01,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 784 transitions, 9754 flow [2022-12-11 23:40:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:40:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:40:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1754 transitions. [2022-12-11 23:40:01,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.877 [2022-12-11 23:40:01,733 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 42 predicate places. [2022-12-11 23:40:01,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 784 transitions, 9754 flow [2022-12-11 23:40:01,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 595 transitions, 7196 flow [2022-12-11 23:40:01,784 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 595 transitions, 7196 flow [2022-12-11 23:40:01,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 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:01,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:01,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:01,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:40:01,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:01,785 INFO L85 PathProgramCache]: Analyzing trace with hash 833350993, now seen corresponding path program 1 times [2022-12-11 23:40:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:01,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077547234] [2022-12-11 23:40:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:01,980 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:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077547234] [2022-12-11 23:40:01,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077547234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:01,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:01,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:40:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137407316] [2022-12-11 23:40:01,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:01,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:40:01,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:01,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:40:01,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:40:01,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2022-12-11 23:40:01,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 595 transitions, 7196 flow. Second operand has 9 states, 9 states have (on average 102.77777777777777) internal successors, (925), 9 states have internal predecessors, (925), 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:01,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:01,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2022-12-11 23:40:01,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:04,580 INFO L130 PetriNetUnfolder]: 9297/20501 cut-off events. [2022-12-11 23:40:04,580 INFO L131 PetriNetUnfolder]: For 46857/59079 co-relation queries the response was YES. [2022-12-11 23:40:04,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96934 conditions, 20501 events. 9297/20501 cut-off events. For 46857/59079 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 226795 event pairs, 81 based on Foata normal form. 1520/21646 useless extension candidates. Maximal degree in co-relation 96844. Up to 6382 conditions per place. [2022-12-11 23:40:04,857 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 289 selfloop transitions, 101 changer transitions 108/612 dead transitions. [2022-12-11 23:40:04,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 612 transitions, 8388 flow [2022-12-11 23:40:04,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 23:40:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 23:40:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2048 transitions. [2022-12-11 23:40:04,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8623157894736843 [2022-12-11 23:40:04,863 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 51 predicate places. [2022-12-11 23:40:04,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 612 transitions, 8388 flow [2022-12-11 23:40:04,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 504 transitions, 6600 flow [2022-12-11 23:40:04,897 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 504 transitions, 6600 flow [2022-12-11 23:40:04,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.77777777777777) internal successors, (925), 9 states have internal predecessors, (925), 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:04,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:04,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:04,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:40:04,898 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:04,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash 792655627, now seen corresponding path program 1 times [2022-12-11 23:40:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:04,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41495530] [2022-12-11 23:40:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:05,110 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:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:05,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41495530] [2022-12-11 23:40:05,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41495530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:05,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:05,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:40:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990511908] [2022-12-11 23:40:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:05,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:40:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:40:05,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:40:05,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2022-12-11 23:40:05,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 504 transitions, 6600 flow. Second operand has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 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:05,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:05,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2022-12-11 23:40:05,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:08,206 INFO L130 PetriNetUnfolder]: 13397/32005 cut-off events. [2022-12-11 23:40:08,206 INFO L131 PetriNetUnfolder]: For 84086/99549 co-relation queries the response was YES. [2022-12-11 23:40:08,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146732 conditions, 32005 events. 13397/32005 cut-off events. For 84086/99549 co-relation queries the response was YES. Maximal size of possible extension queue 2719. Compared 398335 event pairs, 105 based on Foata normal form. 837/32315 useless extension candidates. Maximal degree in co-relation 146637. Up to 9887 conditions per place. [2022-12-11 23:40:08,367 INFO L137 encePairwiseOnDemand]: 119/125 looper letters, 73 selfloop transitions, 1 changer transitions 499/726 dead transitions. [2022-12-11 23:40:08,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 726 transitions, 11555 flow [2022-12-11 23:40:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 23:40:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 23:40:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2022-12-11 23:40:08,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8537142857142858 [2022-12-11 23:40:08,376 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 54 predicate places. [2022-12-11 23:40:08,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 726 transitions, 11555 flow [2022-12-11 23:40:08,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 227 transitions, 2323 flow [2022-12-11 23:40:08,409 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 227 transitions, 2323 flow [2022-12-11 23:40:08,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 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:08,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:08,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:08,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:40:08,410 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1554889967, now seen corresponding path program 2 times [2022-12-11 23:40:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:08,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050191422] [2022-12-11 23:40:08,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:08,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:09,024 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:09,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:09,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050191422] [2022-12-11 23:40:09,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050191422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:09,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:09,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:40:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373510403] [2022-12-11 23:40:09,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:09,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:40:09,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:09,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:40:09,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:40:09,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 125 [2022-12-11 23:40:09,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 227 transitions, 2323 flow. Second operand has 10 states, 10 states have (on average 101.1) internal successors, (1011), 10 states have internal predecessors, (1011), 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:09,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:09,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 125 [2022-12-11 23:40:09,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:09,488 INFO L130 PetriNetUnfolder]: 1409/5995 cut-off events. [2022-12-11 23:40:09,488 INFO L131 PetriNetUnfolder]: For 11184/12179 co-relation queries the response was YES. [2022-12-11 23:40:09,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24376 conditions, 5995 events. 1409/5995 cut-off events. For 11184/12179 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 75059 event pairs, 29 based on Foata normal form. 14/5946 useless extension candidates. Maximal degree in co-relation 24271. Up to 1215 conditions per place. [2022-12-11 23:40:09,509 INFO L137 encePairwiseOnDemand]: 115/125 looper letters, 22 selfloop transitions, 9 changer transitions 97/238 dead transitions. [2022-12-11 23:40:09,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 238 transitions, 2677 flow [2022-12-11 23:40:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 23:40:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 23:40:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1117 transitions. [2022-12-11 23:40:09,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8123636363636364 [2022-12-11 23:40:09,511 INFO L295 CegarLoopForPetriNet]: 132 programPoint places, 55 predicate places. [2022-12-11 23:40:09,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 238 transitions, 2677 flow [2022-12-11 23:40:09,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 141 transitions, 1083 flow [2022-12-11 23:40:09,518 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 141 transitions, 1083 flow [2022-12-11 23:40:09,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 101.1) internal successors, (1011), 10 states have internal predecessors, (1011), 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:09,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:09,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:09,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:40:09,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1502155145, now seen corresponding path program 3 times [2022-12-11 23:40:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:09,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218218120] [2022-12-11 23:40:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:40:09,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:40:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:40:09,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:40:09,593 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:40:09,594 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 23:40:09,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 23:40:09,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 23:40:09,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 23:40:09,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 23:40:09,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 23:40:09,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 23:40:09,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:40:09,596 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:09,600 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:40:09,600 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:40:09,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:40:09 BasicIcfg [2022-12-11 23:40:09,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:40:09,707 INFO L158 Benchmark]: Toolchain (without parser) took 24054.76ms. Allocated memory was 188.7MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 155.0MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-11 23:40:09,707 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory was 166.9MB in the beginning and 166.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:40:09,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.80ms. Allocated memory is still 188.7MB. Free memory was 154.6MB in the beginning and 127.9MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 23:40:09,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.12ms. Allocated memory is still 188.7MB. Free memory was 127.9MB in the beginning and 125.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:40:09,708 INFO L158 Benchmark]: Boogie Preprocessor took 19.60ms. Allocated memory is still 188.7MB. Free memory was 125.2MB in the beginning and 123.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 23:40:09,708 INFO L158 Benchmark]: RCFGBuilder took 503.47ms. Allocated memory is still 188.7MB. Free memory was 123.5MB in the beginning and 157.4MB in the end (delta: -33.9MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2022-12-11 23:40:09,708 INFO L158 Benchmark]: TraceAbstraction took 23061.44ms. Allocated memory was 188.7MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 156.4MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-11 23:40:09,709 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory was 166.9MB in the beginning and 166.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.80ms. Allocated memory is still 188.7MB. Free memory was 154.6MB in the beginning and 127.9MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.12ms. Allocated memory is still 188.7MB. Free memory was 127.9MB in the beginning and 125.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.60ms. Allocated memory is still 188.7MB. Free memory was 125.2MB in the beginning and 123.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 503.47ms. Allocated memory is still 188.7MB. Free memory was 123.5MB in the beginning and 157.4MB in the end (delta: -33.9MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. * TraceAbstraction took 23061.44ms. Allocated memory was 188.7MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 156.4MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L725] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L726] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L727] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L728] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L729] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L730] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L731] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L732] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L733] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L734] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L735] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L736] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L737] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L738] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L739] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L740] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L741] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L742] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t1413; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1413, ((void *)0), P0, ((void *)0))=-3, t1413={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1414; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1414, ((void *)0), P1, ((void *)0))=-2, t1413={5:0}, t1414={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1415; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1415, ((void *)0), P2, ((void *)0))=-1, t1413={5:0}, t1414={6:0}, t1415={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1416; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1416, ((void *)0), P3, ((void *)0))=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 849]: 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.4s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 849 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 849 mSDsluCounter, 571 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1263 IncrementalHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 127 mSDtfsCounter, 1263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7196occurred in iteration=7, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 18000 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 839 ConstructedInterpolants, 0 QuantifiedInterpolants, 3427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 23:40:09,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...