/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:01:05,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:01:05,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:01:05,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:01:05,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:01:05,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:01:05,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:01:05,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:01:05,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:01:05,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:01:05,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:01:05,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:01:05,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:01:05,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:01:05,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:01:05,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:01:05,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:01:05,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:01:05,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:01:05,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:01:05,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:01:05,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:01:05,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:01:05,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:01:05,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:01:05,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:01:05,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:01:05,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:01:05,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:01:05,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:01:05,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:01:05,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:01:05,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:01:05,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:01:05,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:01:05,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:01:05,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:01:05,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:01:05,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:01:05,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:01:05,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:01:05,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 21:01:05,428 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:01:05,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:01:05,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:01:05,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:01:05,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:01:05,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:01:05,431 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:01:05,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:01:05,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:01:05,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:01:05,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:01:05,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:01:05,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:01:05,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:01:05,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:01:05,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:01:05,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:01:05,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:01:05,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:01:05,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:01:05,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:01:05,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:01:05,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:01:05,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:01:05,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:01:05,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:01:05,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:01:05,435 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:01:05,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:01:05,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:01:05,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:01:05,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 21:01:05,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:01:05,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:01:05,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:01:05,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:01:05,799 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:01:05,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-11 21:01:07,074 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:01:07,373 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:01:07,373 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-11 21:01:07,389 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95469b9bd/0696284da4dc4fa5a42c701dc15b6bf5/FLAG56dc54037 [2022-12-11 21:01:07,634 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95469b9bd/0696284da4dc4fa5a42c701dc15b6bf5 [2022-12-11 21:01:07,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:01:07,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:01:07,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:01:07,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:01:07,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:01:07,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:01:07" (1/1) ... [2022-12-11 21:01:07,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190aef25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:07, skipping insertion in model container [2022-12-11 21:01:07,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:01:07" (1/1) ... [2022-12-11 21:01:07,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:01:07,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:01:07,817 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/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-11 21:01:08,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:01:08,077 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:01:08,088 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/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-11 21:01:08,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:01:08,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:01:08,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:01:08,199 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:01:08,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08 WrapperNode [2022-12-11 21:01:08,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:01:08,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:01:08,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:01:08,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:01:08,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,273 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-11 21:01:08,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:01:08,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:01:08,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:01:08,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:01:08,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,301 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:01:08,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:01:08,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:01:08,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:01:08,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (1/1) ... [2022-12-11 21:01:08,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:01:08,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:01:08,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 21:01:08,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 21:01:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:01:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:01:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:01:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:01:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:01:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:01:08,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:01:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:01:08,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:01:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 21:01:08,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 21:01:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 21:01:08,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 21:01:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:01:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:01:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:01:08,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:01:08,395 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 21:01:08,593 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:01:08,599 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:01:08,967 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:01:09,089 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:01:09,089 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:01:09,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:01:09 BoogieIcfgContainer [2022-12-11 21:01:09,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:01:09,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:01:09,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:01:09,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:01:09,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:01:07" (1/3) ... [2022-12-11 21:01:09,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41acd7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:01:09, skipping insertion in model container [2022-12-11 21:01:09,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:01:08" (2/3) ... [2022-12-11 21:01:09,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41acd7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:01:09, skipping insertion in model container [2022-12-11 21:01:09,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:01:09" (3/3) ... [2022-12-11 21:01:09,100 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-11 21:01:09,117 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:01:09,117 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:01:09,118 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:01:09,182 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:01:09,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2022-12-11 21:01:09,296 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-11 21:01:09,297 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:01:09,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-11 21:01:09,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2022-12-11 21:01:09,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2022-12-11 21:01:09,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:01:09,335 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;@4b787608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:01:09,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 21:01:09,369 INFO L130 PetriNetUnfolder]: 0/86 cut-off events. [2022-12-11 21:01:09,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:01:09,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:09,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:09,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1474980255, now seen corresponding path program 1 times [2022-12-11 21:01:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:09,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431794920] [2022-12-11 21:01:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:10,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431794920] [2022-12-11 21:01:10,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431794920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:10,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:10,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:01:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892082583] [2022-12-11 21:01:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:10,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:01:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:01:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:01:10,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 126 [2022-12-11 21:01:10,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:10,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:10,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 126 [2022-12-11 21:01:10,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:10,207 INFO L130 PetriNetUnfolder]: 10/188 cut-off events. [2022-12-11 21:01:10,208 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 21:01:10,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 188 events. 10/188 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 343 event pairs, 4 based on Foata normal form. 5/184 useless extension candidates. Maximal degree in co-relation 177. Up to 17 conditions per place. [2022-12-11 21:01:10,213 INFO L137 encePairwiseOnDemand]: 121/126 looper letters, 9 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2022-12-11 21:01:10,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 120 transitions, 274 flow [2022-12-11 21:01:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:01:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:01:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2022-12-11 21:01:10,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9391534391534392 [2022-12-11 21:01:10,233 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2022-12-11 21:01:10,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 120 transitions, 274 flow [2022-12-11 21:01:10,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 120 transitions, 274 flow [2022-12-11 21:01:10,237 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 120 transitions, 274 flow [2022-12-11 21:01:10,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:10,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:10,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:10,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:01:10,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1773641755, now seen corresponding path program 1 times [2022-12-11 21:01:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:10,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581718016] [2022-12-11 21:01:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:10,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581718016] [2022-12-11 21:01:10,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581718016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:10,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:10,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:01:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111719559] [2022-12-11 21:01:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:10,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:01:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:10,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:01:10,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:01:10,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 126 [2022-12-11 21:01:10,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 120 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:10,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:10,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 126 [2022-12-11 21:01:10,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:11,192 INFO L130 PetriNetUnfolder]: 538/1621 cut-off events. [2022-12-11 21:01:11,193 INFO L131 PetriNetUnfolder]: For 363/508 co-relation queries the response was YES. [2022-12-11 21:01:11,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 1621 events. 538/1621 cut-off events. For 363/508 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11777 event pairs, 148 based on Foata normal form. 0/1576 useless extension candidates. Maximal degree in co-relation 2796. Up to 442 conditions per place. [2022-12-11 21:01:11,212 INFO L137 encePairwiseOnDemand]: 119/126 looper letters, 27 selfloop transitions, 3 changer transitions 57/176 dead transitions. [2022-12-11 21:01:11,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 176 transitions, 613 flow [2022-12-11 21:01:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:01:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:01:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1004 transitions. [2022-12-11 21:01:11,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8853615520282186 [2022-12-11 21:01:11,218 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 8 predicate places. [2022-12-11 21:01:11,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 176 transitions, 613 flow [2022-12-11 21:01:11,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 119 transitions, 359 flow [2022-12-11 21:01:11,226 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 359 flow [2022-12-11 21:01:11,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:11,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:11,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:11,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:01:11,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1274005766, now seen corresponding path program 1 times [2022-12-11 21:01:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:11,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493511647] [2022-12-11 21:01:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:11,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493511647] [2022-12-11 21:01:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493511647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:11,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:01:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618319103] [2022-12-11 21:01:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:11,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:01:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:11,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:01:11,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:01:11,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-11 21:01:11,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:11,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:11,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-11 21:01:11,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:12,588 INFO L130 PetriNetUnfolder]: 3006/5332 cut-off events. [2022-12-11 21:01:12,588 INFO L131 PetriNetUnfolder]: For 4287/4345 co-relation queries the response was YES. [2022-12-11 21:01:12,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13045 conditions, 5332 events. 3006/5332 cut-off events. For 4287/4345 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 39596 event pairs, 237 based on Foata normal form. 2/5073 useless extension candidates. Maximal degree in co-relation 12983. Up to 2107 conditions per place. [2022-12-11 21:01:12,637 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 83 selfloop transitions, 18 changer transitions 22/211 dead transitions. [2022-12-11 21:01:12,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 211 transitions, 1021 flow [2022-12-11 21:01:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:01:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:01:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1103 transitions. [2022-12-11 21:01:12,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8753968253968254 [2022-12-11 21:01:12,641 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, -1 predicate places. [2022-12-11 21:01:12,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 211 transitions, 1021 flow [2022-12-11 21:01:12,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 189 transitions, 869 flow [2022-12-11 21:01:12,671 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 189 transitions, 869 flow [2022-12-11 21:01:12,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:12,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:12,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:12,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:01:12,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash 607014343, now seen corresponding path program 1 times [2022-12-11 21:01:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:12,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987691828] [2022-12-11 21:01:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:12,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:12,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:12,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987691828] [2022-12-11 21:01:12,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987691828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:12,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:12,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:01:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188238996] [2022-12-11 21:01:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:12,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:01:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:01:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:01:12,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2022-12-11 21:01:12,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 189 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:12,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:12,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2022-12-11 21:01:12,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:14,972 INFO L130 PetriNetUnfolder]: 6857/13376 cut-off events. [2022-12-11 21:01:14,972 INFO L131 PetriNetUnfolder]: For 15926/16812 co-relation queries the response was YES. [2022-12-11 21:01:15,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36557 conditions, 13376 events. 6857/13376 cut-off events. For 15926/16812 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 118930 event pairs, 556 based on Foata normal form. 245/13128 useless extension candidates. Maximal degree in co-relation 36488. Up to 5271 conditions per place. [2022-12-11 21:01:15,098 INFO L137 encePairwiseOnDemand]: 116/126 looper letters, 111 selfloop transitions, 35 changer transitions 15/276 dead transitions. [2022-12-11 21:01:15,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 276 transitions, 1738 flow [2022-12-11 21:01:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:01:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:01:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 972 transitions. [2022-12-11 21:01:15,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-12-11 21:01:15,103 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 7 predicate places. [2022-12-11 21:01:15,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 276 transitions, 1738 flow [2022-12-11 21:01:15,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 261 transitions, 1588 flow [2022-12-11 21:01:15,224 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 261 transitions, 1588 flow [2022-12-11 21:01:15,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:15,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:15,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:15,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:01:15,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:15,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2095104933, now seen corresponding path program 1 times [2022-12-11 21:01:15,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:15,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356521991] [2022-12-11 21:01:15,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:15,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356521991] [2022-12-11 21:01:15,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356521991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:15,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:15,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:01:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410488140] [2022-12-11 21:01:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:15,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:01:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:01:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:01:15,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-11 21:01:15,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 261 transitions, 1588 flow. Second operand has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:15,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:15,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-11 21:01:15,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:17,119 INFO L130 PetriNetUnfolder]: 5098/11370 cut-off events. [2022-12-11 21:01:17,119 INFO L131 PetriNetUnfolder]: For 15421/18122 co-relation queries the response was YES. [2022-12-11 21:01:17,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35837 conditions, 11370 events. 5098/11370 cut-off events. For 15421/18122 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 112368 event pairs, 179 based on Foata normal form. 503/11590 useless extension candidates. Maximal degree in co-relation 35764. Up to 4094 conditions per place. [2022-12-11 21:01:17,291 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 215 selfloop transitions, 48 changer transitions 10/395 dead transitions. [2022-12-11 21:01:17,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 395 transitions, 3168 flow [2022-12-11 21:01:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:01:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:01:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1435 transitions. [2022-12-11 21:01:17,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8760683760683761 [2022-12-11 21:01:17,298 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 19 predicate places. [2022-12-11 21:01:17,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 395 transitions, 3168 flow [2022-12-11 21:01:17,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 385 transitions, 3048 flow [2022-12-11 21:01:17,346 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 385 transitions, 3048 flow [2022-12-11 21:01:17,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:17,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:17,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:17,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:01:17,348 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1717108003, now seen corresponding path program 1 times [2022-12-11 21:01:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:17,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162567299] [2022-12-11 21:01:17,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:17,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:17,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162567299] [2022-12-11 21:01:17,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162567299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:17,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:17,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:01:17,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934750375] [2022-12-11 21:01:17,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:17,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:01:17,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:17,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:01:17,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:01:17,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-11 21:01:17,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 385 transitions, 3048 flow. Second operand has 8 states, 8 states have (on average 103.75) internal successors, (830), 8 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:17,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:17,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-11 21:01:17,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:19,353 INFO L130 PetriNetUnfolder]: 4250/10161 cut-off events. [2022-12-11 21:01:19,354 INFO L131 PetriNetUnfolder]: For 14555/17023 co-relation queries the response was YES. [2022-12-11 21:01:19,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37848 conditions, 10161 events. 4250/10161 cut-off events. For 14555/17023 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 104597 event pairs, 96 based on Foata normal form. 616/10593 useless extension candidates. Maximal degree in co-relation 37771. Up to 3436 conditions per place. [2022-12-11 21:01:19,443 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 221 selfloop transitions, 96 changer transitions 118/532 dead transitions. [2022-12-11 21:01:19,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 532 transitions, 5254 flow [2022-12-11 21:01:19,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 21:01:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 21:01:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1768 transitions. [2022-12-11 21:01:19,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.876984126984127 [2022-12-11 21:01:19,451 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 34 predicate places. [2022-12-11 21:01:19,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 532 transitions, 5254 flow [2022-12-11 21:01:19,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 414 transitions, 4012 flow [2022-12-11 21:01:19,496 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 414 transitions, 4012 flow [2022-12-11 21:01:19,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.75) internal successors, (830), 8 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:19,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:19,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:19,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:01:19,497 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 48829679, now seen corresponding path program 1 times [2022-12-11 21:01:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:19,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764174863] [2022-12-11 21:01:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:19,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:19,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764174863] [2022-12-11 21:01:19,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764174863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:19,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:19,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:01:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702491116] [2022-12-11 21:01:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:19,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:01:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:01:19,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:01:19,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 126 [2022-12-11 21:01:19,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 414 transitions, 4012 flow. Second operand has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:19,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:19,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 126 [2022-12-11 21:01:19,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:20,580 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][249], [113#L769true, 201#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 42#L822true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 225#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 140#true, 143#true, 175#true, 128#L856true, 21#L759true, 92#L797true]) [2022-12-11 21:01:20,580 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-11 21:01:20,580 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:20,581 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:20,581 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:20,581 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][250], [113#L769true, 201#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 119#L781true, 225#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 140#true, 143#true, 12#L829true, 175#true, 128#L856true, 21#L759true]) [2022-12-11 21:01:20,581 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-11 21:01:20,581 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:20,581 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:20,581 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:20,768 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][273], [113#L769true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 119#L781true, 140#true, 101#L857true, 143#true, 12#L829true, 175#true, 21#L759true]) [2022-12-11 21:01:20,768 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-11 21:01:20,768 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:20,768 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:20,768 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:20,769 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][276], [113#L769true, 42#L822true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 140#true, 101#L857true, 143#true, 175#true, 21#L759true, 92#L797true]) [2022-12-11 21:01:20,769 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-11 21:01:20,769 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:20,769 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:20,769 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:20,922 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][273], [113#L769true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 77#L2true, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 119#L781true, 140#true, 143#true, 12#L829true, 175#true, 21#L759true]) [2022-12-11 21:01:20,923 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 21:01:20,923 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:20,923 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:20,923 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:20,923 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][276], [113#L769true, 42#L822true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 77#L2true, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 140#true, 143#true, 175#true, 21#L759true, 92#L797true]) [2022-12-11 21:01:20,924 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 21:01:20,924 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:20,924 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:20,924 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:21,189 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][362], [113#L769true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 119#L781true, 65#L3true, 140#true, 143#true, 12#L829true, 175#true, 21#L759true]) [2022-12-11 21:01:21,189 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 21:01:21,189 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:21,189 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:21,189 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:21,191 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][361], [113#L769true, 42#L822true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 65#L3true, 140#true, 143#true, 175#true, 21#L759true, 92#L797true]) [2022-12-11 21:01:21,191 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 21:01:21,191 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:21,191 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:21,191 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:21,371 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][404], [113#L769true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 164#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 246#(= ~y~0 1), 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 119#L781true, 140#true, 143#true, 12#L829true, 175#true, 21#L759true, 126#L3-1true]) [2022-12-11 21:01:21,371 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 21:01:21,371 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:21,371 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:21,371 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:21,373 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][405], [113#L769true, 42#L822true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 164#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 246#(= ~y~0 1), 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 140#true, 143#true, 175#true, 21#L759true, 126#L3-1true, 92#L797true]) [2022-12-11 21:01:21,373 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 21:01:21,373 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:21,373 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:21,373 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:21,960 INFO L130 PetriNetUnfolder]: 7929/18324 cut-off events. [2022-12-11 21:01:21,960 INFO L131 PetriNetUnfolder]: For 50212/56782 co-relation queries the response was YES. [2022-12-11 21:01:22,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73880 conditions, 18324 events. 7929/18324 cut-off events. For 50212/56782 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 204117 event pairs, 85 based on Foata normal form. 451/18313 useless extension candidates. Maximal degree in co-relation 73798. Up to 6475 conditions per place. [2022-12-11 21:01:22,078 INFO L137 encePairwiseOnDemand]: 120/126 looper letters, 299 selfloop transitions, 3 changer transitions 146/651 dead transitions. [2022-12-11 21:01:22,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 651 transitions, 8107 flow [2022-12-11 21:01:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 21:01:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 21:01:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 772 transitions. [2022-12-11 21:01:22,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8752834467120182 [2022-12-11 21:01:22,081 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 34 predicate places. [2022-12-11 21:01:22,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 651 transitions, 8107 flow [2022-12-11 21:01:22,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 505 transitions, 5882 flow [2022-12-11 21:01:22,136 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 505 transitions, 5882 flow [2022-12-11 21:01:22,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:22,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:22,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:22,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:01:22,137 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1038191645, now seen corresponding path program 2 times [2022-12-11 21:01:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:22,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200032747] [2022-12-11 21:01:22,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:22,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200032747] [2022-12-11 21:01:22,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200032747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:22,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:22,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:01:22,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525433893] [2022-12-11 21:01:22,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:22,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:01:22,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:22,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:01:22,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:01:22,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-11 21:01:22,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 505 transitions, 5882 flow. Second operand has 9 states, 9 states have (on average 103.77777777777777) internal successors, (934), 9 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:22,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:22,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-11 21:01:22,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:23,821 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][242], [201#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 113#L769true, 42#L822true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 225#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 140#true, 143#true, 175#true, 21#L759true, 128#L856true, 272#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 92#L797true]) [2022-12-11 21:01:23,822 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-11 21:01:23,822 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:23,822 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:23,822 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:23,822 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][243], [113#L769true, 201#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 119#L781true, 225#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 140#true, 143#true, 12#L829true, 175#true, 128#L856true, 21#L759true, 272#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 21:01:23,822 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-11 21:01:23,823 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:23,823 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:23,823 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 21:01:24,066 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][258], [113#L769true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 246#(= ~y~0 1), 159#true, 119#L781true, 101#L857true, 140#true, 143#true, 12#L829true, 175#true, 21#L759true, 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 21:01:24,066 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-11 21:01:24,066 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:24,066 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:24,066 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:24,067 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][259], [113#L769true, 42#L822true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 140#true, 101#L857true, 143#true, 175#true, 21#L759true, 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 92#L797true]) [2022-12-11 21:01:24,067 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-11 21:01:24,067 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:24,067 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:24,067 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 21:01:24,299 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][258], [113#L769true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 77#L2true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 119#L781true, 140#true, 143#true, 12#L829true, 175#true, 21#L759true, 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 21:01:24,299 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 21:01:24,299 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:24,299 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:24,299 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:24,302 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][259], [113#L769true, 42#L822true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 77#L2true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 159#true, 246#(= ~y~0 1), 140#true, 143#true, 175#true, 21#L759true, 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 92#L797true]) [2022-12-11 21:01:24,302 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 21:01:24,302 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:24,303 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:24,303 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 21:01:24,587 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][327], [113#L769true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 246#(= ~y~0 1), 159#true, 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 119#L781true, 65#L3true, 140#true, 143#true, 12#L829true, 175#true, 21#L759true]) [2022-12-11 21:01:24,588 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 21:01:24,588 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:24,588 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:24,588 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:24,590 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][329], [113#L769true, 42#L822true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 159#true, 246#(= ~y~0 1), 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 65#L3true, 140#true, 143#true, 175#true, 21#L759true, 92#L797true]) [2022-12-11 21:01:24,591 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 21:01:24,591 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:24,591 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:24,591 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 21:01:24,833 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][362], [113#L769true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 164#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 246#(= ~y~0 1), 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 119#L781true, 140#true, 143#true, 12#L829true, 175#true, 21#L759true, 126#L3-1true]) [2022-12-11 21:01:24,833 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 21:01:24,833 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:24,833 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:24,834 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:24,836 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][360], [113#L769true, 42#L822true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 164#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 246#(= ~y~0 1), 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 140#true, 143#true, 175#true, 21#L759true, 126#L3-1true, 92#L797true]) [2022-12-11 21:01:24,836 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 21:01:24,836 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:24,836 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:24,836 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 21:01:25,500 INFO L130 PetriNetUnfolder]: 6859/16006 cut-off events. [2022-12-11 21:01:25,501 INFO L131 PetriNetUnfolder]: For 43909/52984 co-relation queries the response was YES. [2022-12-11 21:01:25,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75231 conditions, 16006 events. 6859/16006 cut-off events. For 43909/52984 co-relation queries the response was YES. Maximal size of possible extension queue 1400. Compared 180115 event pairs, 61 based on Foata normal form. 1378/16981 useless extension candidates. Maximal degree in co-relation 75145. Up to 5753 conditions per place. [2022-12-11 21:01:25,577 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 183 selfloop transitions, 95 changer transitions 142/515 dead transitions. [2022-12-11 21:01:25,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 515 transitions, 6850 flow [2022-12-11 21:01:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 21:01:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 21:01:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2065 transitions. [2022-12-11 21:01:25,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8625730994152047 [2022-12-11 21:01:25,582 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 49 predicate places. [2022-12-11 21:01:25,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 515 transitions, 6850 flow [2022-12-11 21:01:25,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 373 transitions, 4418 flow [2022-12-11 21:01:25,619 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 373 transitions, 4418 flow [2022-12-11 21:01:25,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.77777777777777) internal successors, (934), 9 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:25,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:25,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:25,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 21:01:25,620 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash -304539133, now seen corresponding path program 1 times [2022-12-11 21:01:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:25,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218226383] [2022-12-11 21:01:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:25,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:25,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218226383] [2022-12-11 21:01:25,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218226383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:25,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:25,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:01:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335789775] [2022-12-11 21:01:25,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:25,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:01:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:25,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:01:25,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:01:25,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 126 [2022-12-11 21:01:25,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 373 transitions, 4418 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:25,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:25,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 126 [2022-12-11 21:01:25,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:28,308 INFO L130 PetriNetUnfolder]: 7670/21773 cut-off events. [2022-12-11 21:01:28,308 INFO L131 PetriNetUnfolder]: For 47172/53718 co-relation queries the response was YES. [2022-12-11 21:01:28,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91889 conditions, 21773 events. 7670/21773 cut-off events. For 47172/53718 co-relation queries the response was YES. Maximal size of possible extension queue 1915. Compared 284470 event pairs, 93 based on Foata normal form. 182/21540 useless extension candidates. Maximal degree in co-relation 91798. Up to 6810 conditions per place. [2022-12-11 21:01:28,396 INFO L137 encePairwiseOnDemand]: 120/126 looper letters, 98 selfloop transitions, 3 changer transitions 202/489 dead transitions. [2022-12-11 21:01:28,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 489 transitions, 7045 flow [2022-12-11 21:01:28,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 21:01:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 21:01:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 754 transitions. [2022-12-11 21:01:28,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2022-12-11 21:01:28,400 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 52 predicate places. [2022-12-11 21:01:28,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 489 transitions, 7045 flow [2022-12-11 21:01:28,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 287 transitions, 3190 flow [2022-12-11 21:01:28,427 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 287 transitions, 3190 flow [2022-12-11 21:01:28,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:28,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:28,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:28,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 21:01:28,428 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 318915957, now seen corresponding path program 2 times [2022-12-11 21:01:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:28,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909724624] [2022-12-11 21:01:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:28,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:28,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909724624] [2022-12-11 21:01:28,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909724624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:28,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:28,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:01:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913479838] [2022-12-11 21:01:28,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:28,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:01:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:01:28,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:01:28,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2022-12-11 21:01:28,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 287 transitions, 3190 flow. Second operand has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:28,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:28,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2022-12-11 21:01:28,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:29,954 INFO L130 PetriNetUnfolder]: 2625/9686 cut-off events. [2022-12-11 21:01:29,954 INFO L131 PetriNetUnfolder]: For 27045/30206 co-relation queries the response was YES. [2022-12-11 21:01:29,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39766 conditions, 9686 events. 2625/9686 cut-off events. For 27045/30206 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 122545 event pairs, 56 based on Foata normal form. 331/9880 useless extension candidates. Maximal degree in co-relation 39668. Up to 2704 conditions per place. [2022-12-11 21:01:29,986 INFO L137 encePairwiseOnDemand]: 118/126 looper letters, 38 selfloop transitions, 4 changer transitions 167/322 dead transitions. [2022-12-11 21:01:29,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 322 transitions, 4113 flow [2022-12-11 21:01:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 21:01:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 21:01:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions. [2022-12-11 21:01:29,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-12-11 21:01:29,989 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 54 predicate places. [2022-12-11 21:01:29,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 322 transitions, 4113 flow [2022-12-11 21:01:30,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 155 transitions, 1329 flow [2022-12-11 21:01:30,002 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 155 transitions, 1329 flow [2022-12-11 21:01:30,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:30,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:30,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:30,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 21:01:30,002 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash 340152161, now seen corresponding path program 3 times [2022-12-11 21:01:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:30,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095092780] [2022-12-11 21:01:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:01:30,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:30,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095092780] [2022-12-11 21:01:30,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095092780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:30,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:30,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:01:30,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248394284] [2022-12-11 21:01:30,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:30,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:01:30,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:30,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:01:30,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:01:30,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 126 [2022-12-11 21:01:30,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 155 transitions, 1329 flow. Second operand has 9 states, 9 states have (on average 96.11111111111111) internal successors, (865), 9 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:30,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:30,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 126 [2022-12-11 21:01:30,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:30,854 INFO L130 PetriNetUnfolder]: 185/1023 cut-off events. [2022-12-11 21:01:30,854 INFO L131 PetriNetUnfolder]: For 3178/3365 co-relation queries the response was YES. [2022-12-11 21:01:30,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 1023 events. 185/1023 cut-off events. For 3178/3365 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8696 event pairs, 0 based on Foata normal form. 8/1020 useless extension candidates. Maximal degree in co-relation 4263. Up to 366 conditions per place. [2022-12-11 21:01:30,859 INFO L137 encePairwiseOnDemand]: 113/126 looper letters, 22 selfloop transitions, 11 changer transitions 44/166 dead transitions. [2022-12-11 21:01:30,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 166 transitions, 1607 flow [2022-12-11 21:01:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 21:01:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 21:01:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1155 transitions. [2022-12-11 21:01:30,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888 [2022-12-11 21:01:30,862 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 46 predicate places. [2022-12-11 21:01:30,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 166 transitions, 1607 flow [2022-12-11 21:01:30,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 122 transitions, 882 flow [2022-12-11 21:01:30,865 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 122 transitions, 882 flow [2022-12-11 21:01:30,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.11111111111111) internal successors, (865), 9 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:01:30,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:30,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:30,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 21:01:30,866 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash 681580537, now seen corresponding path program 4 times [2022-12-11 21:01:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:30,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282562546] [2022-12-11 21:01:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:01:30,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:01:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:01:30,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:01:30,967 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:01:30,968 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 21:01:30,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 21:01:30,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 21:01:30,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 21:01:30,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 21:01:30,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 21:01:30,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 21:01:30,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 21:01:30,975 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:30,981 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:01:30,981 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:01:31,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:01:31 BasicIcfg [2022-12-11 21:01:31,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:01:31,116 INFO L158 Benchmark]: Toolchain (without parser) took 23479.06ms. Allocated memory was 183.5MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 157.2MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 862.1MB. Max. memory is 8.0GB. [2022-12-11 21:01:31,116 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 183.5MB. Free memory was 159.9MB in the beginning and 159.8MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:01:31,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.89ms. Allocated memory is still 183.5MB. Free memory was 157.2MB in the beginning and 130.5MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 21:01:31,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.63ms. Allocated memory is still 183.5MB. Free memory was 130.5MB in the beginning and 127.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 21:01:31,119 INFO L158 Benchmark]: Boogie Preprocessor took 30.31ms. Allocated memory is still 183.5MB. Free memory was 127.9MB in the beginning and 126.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 21:01:31,119 INFO L158 Benchmark]: RCFGBuilder took 785.78ms. Allocated memory is still 183.5MB. Free memory was 126.3MB in the beginning and 94.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-11 21:01:31,119 INFO L158 Benchmark]: TraceAbstraction took 22022.56ms. Allocated memory was 183.5MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 93.8MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 799.2MB. Max. memory is 8.0GB. [2022-12-11 21:01:31,121 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.17ms. Allocated memory is still 183.5MB. Free memory was 159.9MB in the beginning and 159.8MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 561.89ms. Allocated memory is still 183.5MB. Free memory was 157.2MB in the beginning and 130.5MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.63ms. Allocated memory is still 183.5MB. Free memory was 130.5MB in the beginning and 127.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.31ms. Allocated memory is still 183.5MB. Free memory was 127.9MB in the beginning and 126.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 785.78ms. Allocated memory is still 183.5MB. Free memory was 126.3MB in the beginning and 94.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22022.56ms. Allocated memory was 183.5MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 93.8MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 799.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1365; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-3, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-2, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.4s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 804 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 804 mSDsluCounter, 523 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 416 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1242 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 107 mSDtfsCounter, 1242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5882occurred in iteration=7, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 13939 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 949 ConstructedInterpolants, 0 QuantifiedInterpolants, 3086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 21:01:31,145 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...