/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:04:21,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:04:21,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:04:21,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:04:21,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:04:21,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:04:21,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:04:21,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:04:21,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:04:21,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:04:21,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:04:21,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:04:21,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:04:21,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:04:21,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:04:21,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:04:21,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:04:21,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:04:21,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:04:21,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:04:21,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:04:21,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:04:21,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:04:21,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:04:21,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:04:21,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:04:21,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:04:21,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:04:21,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:04:21,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:04:21,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:04:21,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:04:21,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:04:21,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:04:21,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:04:21,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:04:21,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:04:21,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:04:21,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:04:21,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:04:21,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:04:21,761 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 19:04:21,798 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:04:21,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:04:21,799 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:04:21,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:04:21,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:04:21,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:04:21,800 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:04:21,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:04:21,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:04:21,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:04:21,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:04:21,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:04:21,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:04:21,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:04:21,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:04:21,801 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:04:21,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:04:21,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:04:21,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:04:21,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:04:21,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:04:21,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:04:21,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:04:21,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:04:21,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:04:21,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:04:21,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:04:21,805 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:04:21,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:04:21,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:04:21,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:04:21,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-11 19:04:22,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:04:22,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:04:22,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:04:22,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:04:22,111 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:04:22,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 19:04:23,415 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:04:23,720 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:04:23,721 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 19:04:23,731 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a623a10/c0cc7808400a40bbb6b74b8bc75c9150/FLAG1ae732ded [2022-12-11 19:04:23,745 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a623a10/c0cc7808400a40bbb6b74b8bc75c9150 [2022-12-11 19:04:23,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:04:23,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:04:23,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:04:23,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:04:23,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:04:23,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:04:23" (1/1) ... [2022-12-11 19:04:23,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1884bab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:23, skipping insertion in model container [2022-12-11 19:04:23,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:04:23" (1/1) ... [2022-12-11 19:04:23,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:04:23,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:04:23,938 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/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-11 19:04:24,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:04:24,190 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:04:24,203 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/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-11 19:04:24,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:04:24,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:04:24,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:04:24,279 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:04:24,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24 WrapperNode [2022-12-11 19:04:24,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:04:24,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:04:24,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:04:24,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:04:24,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,350 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-11 19:04:24,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:04:24,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:04:24,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:04:24,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:04:24,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:04:24,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:04:24,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:04:24,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:04:24,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (1/1) ... [2022-12-11 19:04:24,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:04:24,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:04:24,445 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 19:04:24,468 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 19:04:24,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:04:24,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 19:04:24,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:04:24,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:04:24,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:04:24,483 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 19:04:24,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 19:04:24,483 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 19:04:24,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 19:04:24,483 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 19:04:24,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 19:04:24,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:04:24,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 19:04:24,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:04:24,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:04:24,485 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 19:04:24,620 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:04:24,622 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:04:24,940 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:04:25,085 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:04:25,085 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 19:04:25,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:04:25 BoogieIcfgContainer [2022-12-11 19:04:25,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:04:25,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:04:25,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:04:25,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:04:25,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:04:23" (1/3) ... [2022-12-11 19:04:25,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496a2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:04:25, skipping insertion in model container [2022-12-11 19:04:25,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:04:24" (2/3) ... [2022-12-11 19:04:25,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496a2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:04:25, skipping insertion in model container [2022-12-11 19:04:25,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:04:25" (3/3) ... [2022-12-11 19:04:25,095 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 19:04:25,111 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:04:25,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 19:04:25,113 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:04:25,189 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 19:04:25,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-11 19:04:25,282 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-11 19:04:25,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 19:04:25,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 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/104 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-11 19:04:25,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-11 19:04:25,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-11 19:04:25,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:04:25,315 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;@1560c4c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:04:25,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 19:04:25,334 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-11 19:04:25,334 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 19:04:25,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:25,335 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] [2022-12-11 19:04:25,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1759189953, now seen corresponding path program 1 times [2022-12-11 19:04:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13083249] [2022-12-11 19:04:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:25,858 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 19:04:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:25,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13083249] [2022-12-11 19:04:25,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13083249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:25,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:25,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 19:04:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062154027] [2022-12-11 19:04:25,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:25,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:04:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:25,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:04:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:04:25,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2022-12-11 19:04:25,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 19:04:25,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:25,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2022-12-11 19:04:25,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:26,075 INFO L130 PetriNetUnfolder]: 58/272 cut-off events. [2022-12-11 19:04:26,075 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 19:04:26,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 272 events. 58/272 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1095 event pairs, 10 based on Foata normal form. 27/283 useless extension candidates. Maximal degree in co-relation 351. Up to 79 conditions per place. [2022-12-11 19:04:26,080 INFO L137 encePairwiseOnDemand]: 106/111 looper letters, 14 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2022-12-11 19:04:26,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 110 transitions, 267 flow [2022-12-11 19:04:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:04:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:04:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2022-12-11 19:04:26,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2022-12-11 19:04:26,100 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 225 flow. Second operand 3 states and 312 transitions. [2022-12-11 19:04:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 110 transitions, 267 flow [2022-12-11 19:04:26,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 110 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-11 19:04:26,106 INFO L231 Difference]: Finished difference. Result has 113 places, 104 transitions, 218 flow [2022-12-11 19:04:26,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=113, PETRI_TRANSITIONS=104} [2022-12-11 19:04:26,111 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, -3 predicate places. [2022-12-11 19:04:26,111 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 104 transitions, 218 flow [2022-12-11 19:04:26,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 19:04:26,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:26,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:04:26,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:04:26,113 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1722348185, now seen corresponding path program 1 times [2022-12-11 19:04:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:26,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638501744] [2022-12-11 19:04:26,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:26,569 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 19:04:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:26,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638501744] [2022-12-11 19:04:26,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638501744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:26,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:26,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:04:26,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662613940] [2022-12-11 19:04:26,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:26,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:04:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:26,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:04:26,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:04:26,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2022-12-11 19:04:26,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 104 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 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 19:04:26,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:26,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2022-12-11 19:04:26,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:27,881 INFO L130 PetriNetUnfolder]: 2676/5998 cut-off events. [2022-12-11 19:04:27,881 INFO L131 PetriNetUnfolder]: For 295/295 co-relation queries the response was YES. [2022-12-11 19:04:27,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10356 conditions, 5998 events. 2676/5998 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 50326 event pairs, 334 based on Foata normal form. 0/5850 useless extension candidates. Maximal degree in co-relation 10303. Up to 1153 conditions per place. [2022-12-11 19:04:27,909 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 38 selfloop transitions, 6 changer transitions 97/211 dead transitions. [2022-12-11 19:04:27,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 211 transitions, 718 flow [2022-12-11 19:04:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:04:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:04:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1201 transitions. [2022-12-11 19:04:27,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8322938322938322 [2022-12-11 19:04:27,915 INFO L175 Difference]: Start difference. First operand has 113 places, 104 transitions, 218 flow. Second operand 13 states and 1201 transitions. [2022-12-11 19:04:27,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 211 transitions, 718 flow [2022-12-11 19:04:27,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 211 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:04:27,920 INFO L231 Difference]: Finished difference. Result has 135 places, 98 transitions, 280 flow [2022-12-11 19:04:27,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=280, PETRI_PLACES=135, PETRI_TRANSITIONS=98} [2022-12-11 19:04:27,921 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 19 predicate places. [2022-12-11 19:04:27,921 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 98 transitions, 280 flow [2022-12-11 19:04:27,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 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 19:04:27,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:27,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:04:27,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 19:04:27,922 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash -710667543, now seen corresponding path program 1 times [2022-12-11 19:04:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:27,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513152464] [2022-12-11 19:04:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:28,154 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 19:04:28,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:28,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513152464] [2022-12-11 19:04:28,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513152464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:28,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:28,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 19:04:28,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861115752] [2022-12-11 19:04:28,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:28,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 19:04:28,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 19:04:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 19:04:28,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-11 19:04:28,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 98 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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 19:04:28,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:28,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-11 19:04:28,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:28,858 INFO L130 PetriNetUnfolder]: 1397/2881 cut-off events. [2022-12-11 19:04:28,858 INFO L131 PetriNetUnfolder]: For 5084/5254 co-relation queries the response was YES. [2022-12-11 19:04:28,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8254 conditions, 2881 events. 1397/2881 cut-off events. For 5084/5254 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 20748 event pairs, 507 based on Foata normal form. 116/2920 useless extension candidates. Maximal degree in co-relation 8192. Up to 1338 conditions per place. [2022-12-11 19:04:28,879 INFO L137 encePairwiseOnDemand]: 104/111 looper letters, 26 selfloop transitions, 4 changer transitions 52/159 dead transitions. [2022-12-11 19:04:28,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 159 transitions, 794 flow [2022-12-11 19:04:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:04:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:04:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2022-12-11 19:04:28,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8638638638638638 [2022-12-11 19:04:28,883 INFO L175 Difference]: Start difference. First operand has 135 places, 98 transitions, 280 flow. Second operand 9 states and 863 transitions. [2022-12-11 19:04:28,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 159 transitions, 794 flow [2022-12-11 19:04:28,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 159 transitions, 778 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-11 19:04:28,898 INFO L231 Difference]: Finished difference. Result has 127 places, 101 transitions, 342 flow [2022-12-11 19:04:28,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=342, PETRI_PLACES=127, PETRI_TRANSITIONS=101} [2022-12-11 19:04:28,899 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 11 predicate places. [2022-12-11 19:04:28,899 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 101 transitions, 342 flow [2022-12-11 19:04:28,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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 19:04:28,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:28,900 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] [2022-12-11 19:04:28,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:04:28,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1467258740, now seen corresponding path program 1 times [2022-12-11 19:04:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:28,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126035251] [2022-12-11 19:04:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:29,076 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 19:04:29,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:29,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126035251] [2022-12-11 19:04:29,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126035251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:29,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:29,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 19:04:29,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961983854] [2022-12-11 19:04:29,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:29,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 19:04:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:29,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 19:04:29,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 19:04:29,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 111 [2022-12-11 19:04:29,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 101 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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 19:04:29,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:29,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 111 [2022-12-11 19:04:29,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:30,034 INFO L130 PetriNetUnfolder]: 2748/5364 cut-off events. [2022-12-11 19:04:30,034 INFO L131 PetriNetUnfolder]: For 5965/6330 co-relation queries the response was YES. [2022-12-11 19:04:30,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12621 conditions, 5364 events. 2748/5364 cut-off events. For 5965/6330 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 42225 event pairs, 311 based on Foata normal form. 24/5072 useless extension candidates. Maximal degree in co-relation 12554. Up to 1404 conditions per place. [2022-12-11 19:04:30,075 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 78 selfloop transitions, 17 changer transitions 0/175 dead transitions. [2022-12-11 19:04:30,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 175 transitions, 768 flow [2022-12-11 19:04:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:04:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:04:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 959 transitions. [2022-12-11 19:04:30,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8639639639639639 [2022-12-11 19:04:30,080 INFO L175 Difference]: Start difference. First operand has 127 places, 101 transitions, 342 flow. Second operand 10 states and 959 transitions. [2022-12-11 19:04:30,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 175 transitions, 768 flow [2022-12-11 19:04:30,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 175 transitions, 752 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-11 19:04:30,087 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 446 flow [2022-12-11 19:04:30,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=446, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2022-12-11 19:04:30,088 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 16 predicate places. [2022-12-11 19:04:30,088 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 446 flow [2022-12-11 19:04:30,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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 19:04:30,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:30,089 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 19:04:30,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 19:04:30,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:30,090 INFO L85 PathProgramCache]: Analyzing trace with hash -859699710, now seen corresponding path program 1 times [2022-12-11 19:04:30,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:30,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527822973] [2022-12-11 19:04:30,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:30,326 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 19:04:30,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:30,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527822973] [2022-12-11 19:04:30,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527822973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:30,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:30,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 19:04:30,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072133442] [2022-12-11 19:04:30,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:30,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 19:04:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:30,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 19:04:30,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 19:04:30,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-11 19:04:30,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 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 19:04:30,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:30,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-11 19:04:30,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:31,086 INFO L130 PetriNetUnfolder]: 1116/3864 cut-off events. [2022-12-11 19:04:31,086 INFO L131 PetriNetUnfolder]: For 6155/6591 co-relation queries the response was YES. [2022-12-11 19:04:31,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10420 conditions, 3864 events. 1116/3864 cut-off events. For 6155/6591 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 39667 event pairs, 397 based on Foata normal form. 124/3772 useless extension candidates. Maximal degree in co-relation 10348. Up to 709 conditions per place. [2022-12-11 19:04:31,124 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 44 selfloop transitions, 14 changer transitions 18/168 dead transitions. [2022-12-11 19:04:31,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 168 transitions, 886 flow [2022-12-11 19:04:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:04:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:04:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 858 transitions. [2022-12-11 19:04:31,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8588588588588588 [2022-12-11 19:04:31,127 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 446 flow. Second operand 9 states and 858 transitions. [2022-12-11 19:04:31,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 168 transitions, 886 flow [2022-12-11 19:04:31,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 168 transitions, 876 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-11 19:04:31,142 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 594 flow [2022-12-11 19:04:31,142 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=594, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2022-12-11 19:04:31,143 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 30 predicate places. [2022-12-11 19:04:31,143 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 594 flow [2022-12-11 19:04:31,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 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 19:04:31,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:31,144 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 19:04:31,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 19:04:31,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:31,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1805181690, now seen corresponding path program 1 times [2022-12-11 19:04:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:31,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307367290] [2022-12-11 19:04:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:31,388 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 19:04:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:31,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307367290] [2022-12-11 19:04:31,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307367290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:31,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:31,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:04:31,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809218462] [2022-12-11 19:04:31,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:31,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:04:31,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:04:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:04:31,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 111 [2022-12-11 19:04:31,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 594 flow. Second operand has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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 19:04:31,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:31,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 111 [2022-12-11 19:04:31,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:32,862 INFO L130 PetriNetUnfolder]: 3796/7591 cut-off events. [2022-12-11 19:04:32,863 INFO L131 PetriNetUnfolder]: For 12530/12832 co-relation queries the response was YES. [2022-12-11 19:04:32,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22655 conditions, 7591 events. 3796/7591 cut-off events. For 12530/12832 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 66071 event pairs, 351 based on Foata normal form. 143/7415 useless extension candidates. Maximal degree in co-relation 22576. Up to 1274 conditions per place. [2022-12-11 19:04:32,927 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 78 selfloop transitions, 32 changer transitions 32/222 dead transitions. [2022-12-11 19:04:32,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 222 transitions, 1338 flow [2022-12-11 19:04:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:04:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:04:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1250 transitions. [2022-12-11 19:04:32,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8662508662508662 [2022-12-11 19:04:32,932 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 594 flow. Second operand 13 states and 1250 transitions. [2022-12-11 19:04:32,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 222 transitions, 1338 flow [2022-12-11 19:04:33,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 222 transitions, 1284 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-12-11 19:04:33,070 INFO L231 Difference]: Finished difference. Result has 161 places, 136 transitions, 703 flow [2022-12-11 19:04:33,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=703, PETRI_PLACES=161, PETRI_TRANSITIONS=136} [2022-12-11 19:04:33,077 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 45 predicate places. [2022-12-11 19:04:33,079 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 136 transitions, 703 flow [2022-12-11 19:04:33,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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 19:04:33,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:33,079 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:04:33,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 19:04:33,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash 180812771, now seen corresponding path program 1 times [2022-12-11 19:04:33,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:33,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379830278] [2022-12-11 19:04:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:33,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:33,393 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 19:04:33,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379830278] [2022-12-11 19:04:33,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379830278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:33,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:33,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:04:33,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494515196] [2022-12-11 19:04:33,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:33,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:04:33,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:04:33,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:04:33,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 111 [2022-12-11 19:04:33,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 136 transitions, 703 flow. Second operand has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 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 19:04:33,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:33,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 111 [2022-12-11 19:04:33,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:34,819 INFO L130 PetriNetUnfolder]: 3759/7382 cut-off events. [2022-12-11 19:04:34,819 INFO L131 PetriNetUnfolder]: For 17703/18010 co-relation queries the response was YES. [2022-12-11 19:04:34,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24555 conditions, 7382 events. 3759/7382 cut-off events. For 17703/18010 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 63934 event pairs, 351 based on Foata normal form. 41/7093 useless extension candidates. Maximal degree in co-relation 24517. Up to 1151 conditions per place. [2022-12-11 19:04:34,868 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 31 selfloop transitions, 14 changer transitions 89/213 dead transitions. [2022-12-11 19:04:34,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 213 transitions, 1347 flow [2022-12-11 19:04:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 19:04:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 19:04:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1500 transitions. [2022-12-11 19:04:34,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8445945945945946 [2022-12-11 19:04:34,873 INFO L175 Difference]: Start difference. First operand has 161 places, 136 transitions, 703 flow. Second operand 16 states and 1500 transitions. [2022-12-11 19:04:34,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 213 transitions, 1347 flow [2022-12-11 19:04:35,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 213 transitions, 1149 flow, removed 85 selfloop flow, removed 19 redundant places. [2022-12-11 19:04:35,144 INFO L231 Difference]: Finished difference. Result has 157 places, 110 transitions, 424 flow [2022-12-11 19:04:35,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=424, PETRI_PLACES=157, PETRI_TRANSITIONS=110} [2022-12-11 19:04:35,145 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 41 predicate places. [2022-12-11 19:04:35,145 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 110 transitions, 424 flow [2022-12-11 19:04:35,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 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 19:04:35,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:35,146 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 19:04:35,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 19:04:35,146 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:35,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:35,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1753723220, now seen corresponding path program 1 times [2022-12-11 19:04:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:35,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573552111] [2022-12-11 19:04:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:35,433 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 19:04:35,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573552111] [2022-12-11 19:04:35,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573552111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:35,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:35,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:04:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112674583] [2022-12-11 19:04:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:04:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:04:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:04:35,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2022-12-11 19:04:35,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 110 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 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 19:04:35,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:35,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2022-12-11 19:04:35,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:35,815 INFO L130 PetriNetUnfolder]: 405/2040 cut-off events. [2022-12-11 19:04:35,816 INFO L131 PetriNetUnfolder]: For 3656/3913 co-relation queries the response was YES. [2022-12-11 19:04:35,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5222 conditions, 2040 events. 405/2040 cut-off events. For 3656/3913 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 21133 event pairs, 26 based on Foata normal form. 1/1888 useless extension candidates. Maximal degree in co-relation 5142. Up to 304 conditions per place. [2022-12-11 19:04:35,828 INFO L137 encePairwiseOnDemand]: 98/111 looper letters, 23 selfloop transitions, 6 changer transitions 27/136 dead transitions. [2022-12-11 19:04:35,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 136 transitions, 646 flow [2022-12-11 19:04:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:04:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:04:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 624 transitions. [2022-12-11 19:04:35,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.803088803088803 [2022-12-11 19:04:35,831 INFO L175 Difference]: Start difference. First operand has 157 places, 110 transitions, 424 flow. Second operand 7 states and 624 transitions. [2022-12-11 19:04:35,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 136 transitions, 646 flow [2022-12-11 19:04:35,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 136 transitions, 549 flow, removed 31 selfloop flow, removed 19 redundant places. [2022-12-11 19:04:35,849 INFO L231 Difference]: Finished difference. Result has 136 places, 104 transitions, 337 flow [2022-12-11 19:04:35,850 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=136, PETRI_TRANSITIONS=104} [2022-12-11 19:04:35,853 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 20 predicate places. [2022-12-11 19:04:35,853 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 104 transitions, 337 flow [2022-12-11 19:04:35,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 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 19:04:35,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:35,854 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 19:04:35,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 19:04:35,854 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:35,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash 240448076, now seen corresponding path program 2 times [2022-12-11 19:04:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:35,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201759617] [2022-12-11 19:04:35,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:04:36,736 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 19:04:36,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:04:36,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201759617] [2022-12-11 19:04:36,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201759617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:04:36,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:04:36,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 19:04:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116206520] [2022-12-11 19:04:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:04:36,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 19:04:36,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:04:36,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 19:04:36,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-11 19:04:36,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 111 [2022-12-11 19:04:36,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 104 transitions, 337 flow. Second operand has 11 states, 11 states have (on average 76.9090909090909) internal successors, (846), 11 states have internal predecessors, (846), 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 19:04:36,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:04:36,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 111 [2022-12-11 19:04:36,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:04:37,049 INFO L130 PetriNetUnfolder]: 74/444 cut-off events. [2022-12-11 19:04:37,049 INFO L131 PetriNetUnfolder]: For 201/219 co-relation queries the response was YES. [2022-12-11 19:04:37,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 444 events. 74/444 cut-off events. For 201/219 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2546 event pairs, 4 based on Foata normal form. 1/413 useless extension candidates. Maximal degree in co-relation 890. Up to 56 conditions per place. [2022-12-11 19:04:37,052 INFO L137 encePairwiseOnDemand]: 95/111 looper letters, 27 selfloop transitions, 11 changer transitions 16/126 dead transitions. [2022-12-11 19:04:37,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 126 transitions, 535 flow [2022-12-11 19:04:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:04:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:04:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1017 transitions. [2022-12-11 19:04:37,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7047817047817048 [2022-12-11 19:04:37,056 INFO L175 Difference]: Start difference. First operand has 136 places, 104 transitions, 337 flow. Second operand 13 states and 1017 transitions. [2022-12-11 19:04:37,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 126 transitions, 535 flow [2022-12-11 19:04:37,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 126 transitions, 448 flow, removed 21 selfloop flow, removed 14 redundant places. [2022-12-11 19:04:37,060 INFO L231 Difference]: Finished difference. Result has 135 places, 104 transitions, 317 flow [2022-12-11 19:04:37,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=317, PETRI_PLACES=135, PETRI_TRANSITIONS=104} [2022-12-11 19:04:37,061 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 19 predicate places. [2022-12-11 19:04:37,061 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 104 transitions, 317 flow [2022-12-11 19:04:37,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.9090909090909) internal successors, (846), 11 states have internal predecessors, (846), 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 19:04:37,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:04:37,062 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 19:04:37,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 19:04:37,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:04:37,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:04:37,063 INFO L85 PathProgramCache]: Analyzing trace with hash -551794742, now seen corresponding path program 3 times [2022-12-11 19:04:37,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:04:37,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403950976] [2022-12-11 19:04:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:04:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:04:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:04:37,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 19:04:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:04:37,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 19:04:37,232 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 19:04:37,233 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 19:04:37,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 19:04:37,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 19:04:37,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 19:04:37,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 19:04:37,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 19:04:37,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 19:04:37,240 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:04:37,246 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 19:04:37,246 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 19:04:37,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 07:04:37 BasicIcfg [2022-12-11 19:04:37,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 19:04:37,398 INFO L158 Benchmark]: Toolchain (without parser) took 13649.72ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 158.5MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 720.3MB. Max. memory is 8.0GB. [2022-12-11 19:04:37,398 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 63.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 19:04:37,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.25ms. Allocated memory is still 184.5MB. Free memory was 158.5MB in the beginning and 131.8MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 19:04:37,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.63ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 129.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 19:04:37,399 INFO L158 Benchmark]: Boogie Preprocessor took 53.74ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 127.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 19:04:37,399 INFO L158 Benchmark]: RCFGBuilder took 681.53ms. Allocated memory is still 184.5MB. Free memory was 127.6MB in the beginning and 93.5MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-11 19:04:37,400 INFO L158 Benchmark]: TraceAbstraction took 12307.75ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 92.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 654.2MB. Max. memory is 8.0GB. [2022-12-11 19:04:37,401 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.19ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 63.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 531.25ms. Allocated memory is still 184.5MB. Free memory was 158.5MB in the beginning and 131.8MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.63ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 129.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.74ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 127.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 681.53ms. Allocated memory is still 184.5MB. Free memory was 127.6MB in the beginning and 93.5MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12307.75ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 92.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 654.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L717] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L718] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L719] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L720] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L721] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L722] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L723] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L724] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L725] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L726] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L727] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L728] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L729] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L730] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L731] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L732] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L733] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L735] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] 0 pthread_t t1193; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t1193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1193, ((void *)0), P0, ((void *)0))=-2, t1193={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1194; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1194, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1194, ((void *)0), P1, ((void *)0))=-1, t1193={5:0}, t1194={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1195; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1195, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1195, ((void *)0), P2, ((void *)0))=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L780] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L797] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L819] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 695 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 380 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1100 IncrementalHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 105 mSDtfsCounter, 1100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=6, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 764 NumberOfCodeBlocks, 764 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 668 ConstructedInterpolants, 0 QuantifiedInterpolants, 2886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 19:04:37,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...