/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:24:23,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:24:23,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:24:23,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:24:23,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:24:23,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:24:23,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:24:23,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:24:23,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:24:23,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:24:23,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:24:23,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:24:23,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:24:23,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:24:23,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:24:23,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:24:23,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:24:23,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:24:23,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:24:23,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:24:23,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:24:23,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:24:23,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:24:23,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:24:23,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:24:23,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:24:23,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:24:23,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:24:23,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:24:23,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:24:23,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:24:23,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:24:23,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:24:23,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:24:23,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:24:23,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:24:23,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:24:23,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:24:23,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:24:23,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:24:23,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:24:23,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-05 20:24:23,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:24:23,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:24:23,175 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:24:23,175 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:24:23,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:24:23,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:24:23,176 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:24:23,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:24:23,176 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:24:23,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:24:23,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:24:23,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:24:23,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:24:23,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:24:23,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:24:23,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:24:23,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:24:23,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:24:23,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:24:23,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:24:23,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:24:23,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:24:23,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:24:23,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:24:23,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:24:23,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:24:23,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:24:23,449 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:24:23,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:24:24,506 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:24:24,723 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:24:24,723 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:24:24,745 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5fb271a/25a73a89a70f4c6c9d4e0c58af41079a/FLAGa75c24681 [2022-12-05 20:24:24,762 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5fb271a/25a73a89a70f4c6c9d4e0c58af41079a [2022-12-05 20:24:24,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:24:24,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:24:24,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:24:24,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:24:24,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:24:24,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:24:24" (1/1) ... [2022-12-05 20:24:24,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7da982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:24, skipping insertion in model container [2022-12-05 20:24:24,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:24:24" (1/1) ... [2022-12-05 20:24:24,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:24:24,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:24:24,955 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:24:25,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:24:25,160 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:24:25,169 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:24:25,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:24:25,263 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:24:25,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25 WrapperNode [2022-12-05 20:24:25,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:24:25,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:24:25,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:24:25,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:24:25,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,328 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-05 20:24:25,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:24:25,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:24:25,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:24:25,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:24:25,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:24:25,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:24:25,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:24:25,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:24:25,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:24:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:24:25,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:24:25,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:24:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:24:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:24:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:24:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:24:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:24:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:24:25,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:24:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:24:25,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:24:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:24:25,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:24:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 20:24:25,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 20:24:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:24:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:24:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:24:25,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:24:25,455 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:24:25,571 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:24:25,572 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:24:25,836 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:24:25,962 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:24:25,962 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:24:25,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:24:25 BoogieIcfgContainer [2022-12-05 20:24:25,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:24:25,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:24:25,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:24:25,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:24:25,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:24:24" (1/3) ... [2022-12-05 20:24:25,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493dec9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:24:25, skipping insertion in model container [2022-12-05 20:24:25,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (2/3) ... [2022-12-05 20:24:25,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493dec9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:24:25, skipping insertion in model container [2022-12-05 20:24:25,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:24:25" (3/3) ... [2022-12-05 20:24:25,970 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:24:25,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:24:25,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:24:25,986 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:24:26,043 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:24:26,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-05 20:24:26,141 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-05 20:24:26,141 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:26,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:24:26,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-05 20:24:26,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-05 20:24:26,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:24:26,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-05 20:24:26,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-05 20:24:26,210 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-05 20:24:26,210 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:26,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:24:26,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-05 20:24:26,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-05 20:24:30,696 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-05 20:24:30,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:24:30,712 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;@3a02aa36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:24:30,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:24:30,747 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 20:24:30,747 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:30,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:30,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:24:30,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:30,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash 541648, now seen corresponding path program 1 times [2022-12-05 20:24:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:30,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403210737] [2022-12-05 20:24:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:31,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403210737] [2022-12-05 20:24:31,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403210737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:31,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:31,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:24:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770478169] [2022-12-05 20:24:31,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:31,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:31,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:31,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:31,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:24:31,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:31,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:31,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:24:31,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:31,911 INFO L130 PetriNetUnfolder]: 6050/8368 cut-off events. [2022-12-05 20:24:31,911 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-05 20:24:31,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16767 conditions, 8368 events. 6050/8368 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 42750 event pairs, 2306 based on Foata normal form. 0/7635 useless extension candidates. Maximal degree in co-relation 16755. Up to 6574 conditions per place. [2022-12-05 20:24:31,945 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 41 selfloop transitions, 2 changer transitions 10/56 dead transitions. [2022-12-05 20:24:31,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 239 flow [2022-12-05 20:24:31,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-05 20:24:31,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-05 20:24:31,955 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-05 20:24:31,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 239 flow [2022-12-05 20:24:31,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:24:31,959 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 66 flow [2022-12-05 20:24:31,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2022-12-05 20:24:31,962 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-05 20:24:31,963 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 66 flow [2022-12-05 20:24:31,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:31,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:31,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:31,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:24:31,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:31,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 785827368, now seen corresponding path program 1 times [2022-12-05 20:24:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:31,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933760683] [2022-12-05 20:24:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933760683] [2022-12-05 20:24:32,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933760683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:32,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:32,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:24:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036188718] [2022-12-05 20:24:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:32,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:32,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:24:32,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 66 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:32,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:32,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:24:32,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:33,836 INFO L130 PetriNetUnfolder]: 13646/18640 cut-off events. [2022-12-05 20:24:33,836 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2022-12-05 20:24:33,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38657 conditions, 18640 events. 13646/18640 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 97945 event pairs, 4702 based on Foata normal form. 529/19169 useless extension candidates. Maximal degree in co-relation 38647. Up to 10935 conditions per place. [2022-12-05 20:24:33,920 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2022-12-05 20:24:33,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2022-12-05 20:24:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-05 20:24:33,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-05 20:24:33,922 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 66 flow. Second operand 3 states and 50 transitions. [2022-12-05 20:24:33,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2022-12-05 20:24:33,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:33,924 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2022-12-05 20:24:33,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-05 20:24:33,925 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-05 20:24:33,925 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2022-12-05 20:24:33,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:33,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:33,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:33,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:24:33,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1409155189, now seen corresponding path program 1 times [2022-12-05 20:24:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:33,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387040944] [2022-12-05 20:24:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:33,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:34,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:34,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387040944] [2022-12-05 20:24:34,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387040944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:34,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:34,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:24:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492827028] [2022-12-05 20:24:34,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:34,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:34,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:34,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:34,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:34,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:24:34,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:34,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:34,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:24:34,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:35,454 INFO L130 PetriNetUnfolder]: 13388/18294 cut-off events. [2022-12-05 20:24:35,454 INFO L131 PetriNetUnfolder]: For 6881/6881 co-relation queries the response was YES. [2022-12-05 20:24:35,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45582 conditions, 18294 events. 13388/18294 cut-off events. For 6881/6881 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 94922 event pairs, 1209 based on Foata normal form. 40/18334 useless extension candidates. Maximal degree in co-relation 45570. Up to 10001 conditions per place. [2022-12-05 20:24:35,592 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 55 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2022-12-05 20:24:35,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 66 transitions, 346 flow [2022-12-05 20:24:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-05 20:24:35,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-05 20:24:35,595 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 4 states and 63 transitions. [2022-12-05 20:24:35,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 66 transitions, 346 flow [2022-12-05 20:24:35,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:35,616 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 186 flow [2022-12-05 20:24:35,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2022-12-05 20:24:35,617 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-12-05 20:24:35,617 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 186 flow [2022-12-05 20:24:35,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:35,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:35,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:35,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:24:35,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1409157142, now seen corresponding path program 1 times [2022-12-05 20:24:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:35,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009814917] [2022-12-05 20:24:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:35,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009814917] [2022-12-05 20:24:35,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009814917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:35,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:35,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:24:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192931258] [2022-12-05 20:24:35,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:35,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:35,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:35,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:35,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:35,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:24:35,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 186 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:35,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:35,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:24:35,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:36,995 INFO L130 PetriNetUnfolder]: 13130/17948 cut-off events. [2022-12-05 20:24:36,995 INFO L131 PetriNetUnfolder]: For 14197/14197 co-relation queries the response was YES. [2022-12-05 20:24:37,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48499 conditions, 17948 events. 13130/17948 cut-off events. For 14197/14197 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 93689 event pairs, 2522 based on Foata normal form. 40/17988 useless extension candidates. Maximal degree in co-relation 48484. Up to 10157 conditions per place. [2022-12-05 20:24:37,067 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 64 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2022-12-05 20:24:37,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 81 transitions, 492 flow [2022-12-05 20:24:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-05 20:24:37,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2022-12-05 20:24:37,068 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 186 flow. Second operand 4 states and 69 transitions. [2022-12-05 20:24:37,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 81 transitions, 492 flow [2022-12-05 20:24:37,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:24:37,095 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 330 flow [2022-12-05 20:24:37,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-05 20:24:37,096 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2022-12-05 20:24:37,096 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 330 flow [2022-12-05 20:24:37,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:37,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:37,096 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:37,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:24:37,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:37,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash -734139673, now seen corresponding path program 1 times [2022-12-05 20:24:37,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:37,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341135832] [2022-12-05 20:24:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:37,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:37,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341135832] [2022-12-05 20:24:37,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341135832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:37,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:37,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:24:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984165440] [2022-12-05 20:24:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:37,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:37,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:37,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:37,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:24:37,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:37,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:37,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:24:37,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:38,021 INFO L130 PetriNetUnfolder]: 6567/9710 cut-off events. [2022-12-05 20:24:38,021 INFO L131 PetriNetUnfolder]: For 16098/16890 co-relation queries the response was YES. [2022-12-05 20:24:38,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27276 conditions, 9710 events. 6567/9710 cut-off events. For 16098/16890 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 56385 event pairs, 1394 based on Foata normal form. 571/10103 useless extension candidates. Maximal degree in co-relation 27256. Up to 8056 conditions per place. [2022-12-05 20:24:38,069 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 60 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2022-12-05 20:24:38,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 620 flow [2022-12-05 20:24:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 20:24:38,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-05 20:24:38,070 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 330 flow. Second operand 3 states and 53 transitions. [2022-12-05 20:24:38,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 620 flow [2022-12-05 20:24:38,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:24:38,085 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 363 flow [2022-12-05 20:24:38,085 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-05 20:24:38,086 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-12-05 20:24:38,086 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 363 flow [2022-12-05 20:24:38,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:38,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:38,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:38,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:24:38,086 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:38,087 INFO L85 PathProgramCache]: Analyzing trace with hash -208288131, now seen corresponding path program 1 times [2022-12-05 20:24:38,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:38,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186968874] [2022-12-05 20:24:38,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:38,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:38,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186968874] [2022-12-05 20:24:38,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186968874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:38,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:38,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:38,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89591465] [2022-12-05 20:24:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:38,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:38,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:38,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:38,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:24:38,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 363 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:38,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:38,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:24:38,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:39,701 INFO L130 PetriNetUnfolder]: 11071/15909 cut-off events. [2022-12-05 20:24:39,702 INFO L131 PetriNetUnfolder]: For 33373/33373 co-relation queries the response was YES. [2022-12-05 20:24:39,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52965 conditions, 15909 events. 11071/15909 cut-off events. For 33373/33373 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 90169 event pairs, 2389 based on Foata normal form. 223/16132 useless extension candidates. Maximal degree in co-relation 52942. Up to 7409 conditions per place. [2022-12-05 20:24:39,799 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 76 selfloop transitions, 19 changer transitions 5/100 dead transitions. [2022-12-05 20:24:39,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 100 transitions, 777 flow [2022-12-05 20:24:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 20:24:39,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-05 20:24:39,800 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 363 flow. Second operand 4 states and 68 transitions. [2022-12-05 20:24:39,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 100 transitions, 777 flow [2022-12-05 20:24:39,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 100 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:39,859 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 472 flow [2022-12-05 20:24:39,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=472, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2022-12-05 20:24:39,859 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2022-12-05 20:24:39,860 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 472 flow [2022-12-05 20:24:39,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:39,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:39,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:39,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:24:39,860 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:39,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1420268293, now seen corresponding path program 1 times [2022-12-05 20:24:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:39,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224490673] [2022-12-05 20:24:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:39,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:39,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224490673] [2022-12-05 20:24:39,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224490673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:39,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:39,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:39,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327803660] [2022-12-05 20:24:39,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:39,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:39,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:39,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:39,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:24:39,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 472 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:39,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:39,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:24:39,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:41,665 INFO L130 PetriNetUnfolder]: 14593/21120 cut-off events. [2022-12-05 20:24:41,666 INFO L131 PetriNetUnfolder]: For 65724/65724 co-relation queries the response was YES. [2022-12-05 20:24:41,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72015 conditions, 21120 events. 14593/21120 cut-off events. For 65724/65724 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 127007 event pairs, 4711 based on Foata normal form. 204/21324 useless extension candidates. Maximal degree in co-relation 71988. Up to 10228 conditions per place. [2022-12-05 20:24:41,792 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 80 selfloop transitions, 19 changer transitions 7/106 dead transitions. [2022-12-05 20:24:41,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 926 flow [2022-12-05 20:24:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 20:24:41,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 20:24:41,794 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 472 flow. Second operand 4 states and 72 transitions. [2022-12-05 20:24:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 926 flow [2022-12-05 20:24:41,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 106 transitions, 898 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:41,862 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 567 flow [2022-12-05 20:24:41,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=567, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2022-12-05 20:24:41,863 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2022-12-05 20:24:41,863 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 567 flow [2022-12-05 20:24:41,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:41,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:41,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:41,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:24:41,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1581341905, now seen corresponding path program 1 times [2022-12-05 20:24:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569384872] [2022-12-05 20:24:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:41,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:41,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569384872] [2022-12-05 20:24:41,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569384872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:41,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:41,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:41,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089180611] [2022-12-05 20:24:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:41,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:41,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:41,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:24:41,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:41,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:41,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:24:41,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:42,874 INFO L130 PetriNetUnfolder]: 5998/9424 cut-off events. [2022-12-05 20:24:42,874 INFO L131 PetriNetUnfolder]: For 24298/24783 co-relation queries the response was YES. [2022-12-05 20:24:42,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30548 conditions, 9424 events. 5998/9424 cut-off events. For 24298/24783 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 60892 event pairs, 1184 based on Foata normal form. 885/10122 useless extension candidates. Maximal degree in co-relation 30517. Up to 4743 conditions per place. [2022-12-05 20:24:42,913 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 85 selfloop transitions, 9 changer transitions 3/111 dead transitions. [2022-12-05 20:24:42,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 1208 flow [2022-12-05 20:24:42,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-05 20:24:42,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-05 20:24:42,915 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 567 flow. Second operand 4 states and 73 transitions. [2022-12-05 20:24:42,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 1208 flow [2022-12-05 20:24:42,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 111 transitions, 1162 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:42,926 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 582 flow [2022-12-05 20:24:42,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=582, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2022-12-05 20:24:42,927 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2022-12-05 20:24:42,927 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 582 flow [2022-12-05 20:24:42,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:42,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:42,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:42,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:24:42,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:42,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash 243971534, now seen corresponding path program 1 times [2022-12-05 20:24:42,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:42,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398963614] [2022-12-05 20:24:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:43,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:43,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398963614] [2022-12-05 20:24:43,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398963614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:43,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:43,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:43,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606814685] [2022-12-05 20:24:43,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:43,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:43,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:24:43,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:43,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:43,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:24:43,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:43,711 INFO L130 PetriNetUnfolder]: 4258/6682 cut-off events. [2022-12-05 20:24:43,711 INFO L131 PetriNetUnfolder]: For 18026/18426 co-relation queries the response was YES. [2022-12-05 20:24:43,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24647 conditions, 6682 events. 4258/6682 cut-off events. For 18026/18426 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 41649 event pairs, 924 based on Foata normal form. 475/6979 useless extension candidates. Maximal degree in co-relation 24614. Up to 2598 conditions per place. [2022-12-05 20:24:43,746 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 95 selfloop transitions, 13 changer transitions 7/129 dead transitions. [2022-12-05 20:24:43,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 129 transitions, 1352 flow [2022-12-05 20:24:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-05 20:24:43,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-05 20:24:43,747 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 582 flow. Second operand 5 states and 91 transitions. [2022-12-05 20:24:43,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 129 transitions, 1352 flow [2022-12-05 20:24:43,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 129 transitions, 1334 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:43,762 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 616 flow [2022-12-05 20:24:43,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=616, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2022-12-05 20:24:43,763 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2022-12-05 20:24:43,763 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 616 flow [2022-12-05 20:24:43,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:43,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:43,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:43,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:24:43,763 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1349696063, now seen corresponding path program 1 times [2022-12-05 20:24:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:43,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513602736] [2022-12-05 20:24:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:44,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513602736] [2022-12-05 20:24:44,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513602736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:44,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:44,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:44,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391644361] [2022-12-05 20:24:44,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:44,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:44,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:44,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:44,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:44,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:24:44,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 616 flow. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:44,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:44,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:24:44,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:45,917 INFO L130 PetriNetUnfolder]: 9275/14361 cut-off events. [2022-12-05 20:24:45,918 INFO L131 PetriNetUnfolder]: For 63053/63053 co-relation queries the response was YES. [2022-12-05 20:24:45,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59355 conditions, 14361 events. 9275/14361 cut-off events. For 63053/63053 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 93135 event pairs, 958 based on Foata normal form. 11/14372 useless extension candidates. Maximal degree in co-relation 59321. Up to 3991 conditions per place. [2022-12-05 20:24:45,987 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 193 selfloop transitions, 59 changer transitions 37/289 dead transitions. [2022-12-05 20:24:45,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 289 transitions, 2946 flow [2022-12-05 20:24:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:24:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:24:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2022-12-05 20:24:45,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 20:24:45,989 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 616 flow. Second operand 9 states and 168 transitions. [2022-12-05 20:24:45,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 289 transitions, 2946 flow [2022-12-05 20:24:46,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 289 transitions, 2720 flow, removed 56 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:46,298 INFO L231 Difference]: Finished difference. Result has 78 places, 99 transitions, 1228 flow [2022-12-05 20:24:46,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1228, PETRI_PLACES=78, PETRI_TRANSITIONS=99} [2022-12-05 20:24:46,299 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2022-12-05 20:24:46,299 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 99 transitions, 1228 flow [2022-12-05 20:24:46,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:46,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:46,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:46,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:24:46,300 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1322261277, now seen corresponding path program 2 times [2022-12-05 20:24:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:46,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541679358] [2022-12-05 20:24:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:46,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541679358] [2022-12-05 20:24:46,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541679358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:46,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:46,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:46,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249853923] [2022-12-05 20:24:46,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:46,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:46,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:46,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:46,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:46,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:24:46,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 99 transitions, 1228 flow. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:46,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:46,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:24:46,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:48,044 INFO L130 PetriNetUnfolder]: 7534/12141 cut-off events. [2022-12-05 20:24:48,044 INFO L131 PetriNetUnfolder]: For 56519/56519 co-relation queries the response was YES. [2022-12-05 20:24:48,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55551 conditions, 12141 events. 7534/12141 cut-off events. For 56519/56519 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 81118 event pairs, 1404 based on Foata normal form. 11/12152 useless extension candidates. Maximal degree in co-relation 55513. Up to 5155 conditions per place. [2022-12-05 20:24:48,122 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 140 selfloop transitions, 70 changer transitions 64/274 dead transitions. [2022-12-05 20:24:48,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 274 transitions, 2952 flow [2022-12-05 20:24:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:24:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:24:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2022-12-05 20:24:48,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2022-12-05 20:24:48,124 INFO L175 Difference]: Start difference. First operand has 78 places, 99 transitions, 1228 flow. Second operand 9 states and 156 transitions. [2022-12-05 20:24:48,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 274 transitions, 2952 flow [2022-12-05 20:24:48,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 274 transitions, 2817 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-05 20:24:48,385 INFO L231 Difference]: Finished difference. Result has 86 places, 112 transitions, 1469 flow [2022-12-05 20:24:48,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1469, PETRI_PLACES=86, PETRI_TRANSITIONS=112} [2022-12-05 20:24:48,385 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 39 predicate places. [2022-12-05 20:24:48,385 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 1469 flow [2022-12-05 20:24:48,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:48,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:48,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:48,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:24:48,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:48,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:48,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1887165811, now seen corresponding path program 3 times [2022-12-05 20:24:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:48,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146247562] [2022-12-05 20:24:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:48,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:48,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146247562] [2022-12-05 20:24:48,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146247562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:48,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:48,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:48,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850494881] [2022-12-05 20:24:48,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:48,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:48,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:48,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:48,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:24:48,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 1469 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:48,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:48,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:24:48,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:49,639 INFO L130 PetriNetUnfolder]: 4805/7765 cut-off events. [2022-12-05 20:24:49,639 INFO L131 PetriNetUnfolder]: For 46766/47600 co-relation queries the response was YES. [2022-12-05 20:24:49,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40072 conditions, 7765 events. 4805/7765 cut-off events. For 46766/47600 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 52004 event pairs, 632 based on Foata normal form. 314/7941 useless extension candidates. Maximal degree in co-relation 40032. Up to 3149 conditions per place. [2022-12-05 20:24:49,680 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 163 selfloop transitions, 17 changer transitions 54/247 dead transitions. [2022-12-05 20:24:49,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 247 transitions, 3600 flow [2022-12-05 20:24:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-05 20:24:49,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2022-12-05 20:24:49,681 INFO L175 Difference]: Start difference. First operand has 86 places, 112 transitions, 1469 flow. Second operand 6 states and 94 transitions. [2022-12-05 20:24:49,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 247 transitions, 3600 flow [2022-12-05 20:24:49,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 247 transitions, 3392 flow, removed 63 selfloop flow, removed 4 redundant places. [2022-12-05 20:24:49,997 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 1092 flow [2022-12-05 20:24:49,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1092, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2022-12-05 20:24:49,998 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 39 predicate places. [2022-12-05 20:24:49,998 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 1092 flow [2022-12-05 20:24:49,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:49,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:49,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:49,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:24:49,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1585540470, now seen corresponding path program 1 times [2022-12-05 20:24:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:49,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908053284] [2022-12-05 20:24:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:50,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908053284] [2022-12-05 20:24:50,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908053284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:50,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:50,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:24:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690842269] [2022-12-05 20:24:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:50,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:50,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:50,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:50,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:24:50,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 1092 flow. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:50,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:50,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:24:50,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:50,948 INFO L130 PetriNetUnfolder]: 3125/4869 cut-off events. [2022-12-05 20:24:50,949 INFO L131 PetriNetUnfolder]: For 30200/30200 co-relation queries the response was YES. [2022-12-05 20:24:50,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26637 conditions, 4869 events. 3125/4869 cut-off events. For 30200/30200 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 26258 event pairs, 319 based on Foata normal form. 3/4872 useless extension candidates. Maximal degree in co-relation 26596. Up to 1587 conditions per place. [2022-12-05 20:24:50,973 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 96 selfloop transitions, 57 changer transitions 131/284 dead transitions. [2022-12-05 20:24:50,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 284 transitions, 3391 flow [2022-12-05 20:24:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 20:24:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 20:24:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2022-12-05 20:24:50,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35824175824175825 [2022-12-05 20:24:50,975 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 1092 flow. Second operand 13 states and 163 transitions. [2022-12-05 20:24:50,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 284 transitions, 3391 flow [2022-12-05 20:24:51,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 284 transitions, 2996 flow, removed 63 selfloop flow, removed 9 redundant places. [2022-12-05 20:24:51,063 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 1143 flow [2022-12-05 20:24:51,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1143, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2022-12-05 20:24:51,064 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 49 predicate places. [2022-12-05 20:24:51,064 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 1143 flow [2022-12-05 20:24:51,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:51,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:51,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:51,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:24:51,064 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 853556020, now seen corresponding path program 2 times [2022-12-05 20:24:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:51,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728064150] [2022-12-05 20:24:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:24:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:51,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728064150] [2022-12-05 20:24:51,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728064150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:51,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:51,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:24:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417852829] [2022-12-05 20:24:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:51,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:24:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:24:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:24:51,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:24:51,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 1143 flow. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:51,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:51,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:24:51,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:52,532 INFO L130 PetriNetUnfolder]: 1768/2902 cut-off events. [2022-12-05 20:24:52,532 INFO L131 PetriNetUnfolder]: For 16272/16424 co-relation queries the response was YES. [2022-12-05 20:24:52,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15049 conditions, 2902 events. 1768/2902 cut-off events. For 16272/16424 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15853 event pairs, 178 based on Foata normal form. 54/2945 useless extension candidates. Maximal degree in co-relation 15006. Up to 981 conditions per place. [2022-12-05 20:24:52,548 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 143 selfloop transitions, 8 changer transitions 52/219 dead transitions. [2022-12-05 20:24:52,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 219 transitions, 2531 flow [2022-12-05 20:24:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:24:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:24:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-05 20:24:52,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42448979591836733 [2022-12-05 20:24:52,549 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 1143 flow. Second operand 7 states and 104 transitions. [2022-12-05 20:24:52,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 219 transitions, 2531 flow [2022-12-05 20:24:52,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 219 transitions, 2401 flow, removed 52 selfloop flow, removed 6 redundant places. [2022-12-05 20:24:52,605 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 1180 flow [2022-12-05 20:24:52,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1180, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2022-12-05 20:24:52,605 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2022-12-05 20:24:52,606 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 1180 flow [2022-12-05 20:24:52,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:52,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:52,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:52,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:24:52,606 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1025015758, now seen corresponding path program 3 times [2022-12-05 20:24:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:52,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488442470] [2022-12-05 20:24:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:24:52,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:24:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:24:52,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:24:52,707 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:24:52,708 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 20:24:52,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 20:24:52,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 20:24:52,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 20:24:52,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 20:24:52,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 20:24:52,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 20:24:52,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:24:52,710 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:52,714 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:24:52,714 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:24:52,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:24:52 BasicIcfg [2022-12-05 20:24:52,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:24:52,792 INFO L158 Benchmark]: Toolchain (without parser) took 28026.21ms. Allocated memory was 180.4MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 154.7MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-05 20:24:52,793 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:24:52,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.93ms. Allocated memory is still 180.4MB. Free memory was 154.7MB in the beginning and 127.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 20:24:52,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.94ms. Allocated memory is still 180.4MB. Free memory was 127.0MB in the beginning and 124.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:24:52,794 INFO L158 Benchmark]: Boogie Preprocessor took 24.19ms. Allocated memory is still 180.4MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:24:52,794 INFO L158 Benchmark]: RCFGBuilder took 610.05ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 122.2MB in the beginning and 190.3MB in the end (delta: -68.1MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. [2022-12-05 20:24:52,794 INFO L158 Benchmark]: TraceAbstraction took 26825.82ms. Allocated memory was 217.1MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 189.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-05 20:24:52,795 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.15ms. Allocated memory is still 180.4MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 496.93ms. Allocated memory is still 180.4MB. Free memory was 154.7MB in the beginning and 127.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.94ms. Allocated memory is still 180.4MB. Free memory was 127.0MB in the beginning and 124.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.19ms. Allocated memory is still 180.4MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 610.05ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 122.2MB in the beginning and 190.3MB in the end (delta: -68.1MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. * TraceAbstraction took 26825.82ms. Allocated memory was 217.1MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 189.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 135 PlacesBefore, 47 PlacesAfterwards, 124 TransitionsBefore, 35 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2354, independent: 2286, independent conditional: 2286, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2354, independent: 2286, independent conditional: 0, independent unconditional: 2286, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2354, independent: 2286, independent conditional: 0, independent unconditional: 2286, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2354, independent: 2286, independent conditional: 0, independent unconditional: 2286, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1858, independent: 1807, independent conditional: 0, independent unconditional: 1807, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1858, independent: 1784, independent conditional: 0, independent unconditional: 1784, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2354, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1858, unknown conditional: 0, unknown unconditional: 1858] , Statistics on independence cache: Total cache size (in pairs): 2816, Positive cache size: 2765, Positive conditional cache size: 0, Positive unconditional cache size: 2765, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-2, t1457={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=-1, t1457={5:0}, t1458={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1459; [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1460; [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=1, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L798] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 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) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 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 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 866]: 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: 864]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2055 IncrementalHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 50 mSDtfsCounter, 2055 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1469occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 1929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:24:52,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...