/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:22:43,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:22:43,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:22:43,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:22:43,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:22:43,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:22:43,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:22:43,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:22:43,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:22:43,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:22:43,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:22:43,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:22:43,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:22:43,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:22:43,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:22:43,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:22:43,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:22:43,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:22:43,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:22:43,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:22:43,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:22:43,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:22:43,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:22:43,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:22:43,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:22:43,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:22:43,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:22:43,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:22:43,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:22:43,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:22:43,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:22:43,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:22:43,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:22:43,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:22:43,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:22:43,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:22:43,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:22:43,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:22:43,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:22:43,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:22:43,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:22:43,757 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-09-20 22:22:43,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:22:43,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:22:43,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:22:43,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:22:43,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:22:43,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:22:43,791 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:22:43,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:22:43,792 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:22:43,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:22:43,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:22:43,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:22:43,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:22:43,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:22:43,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:22:43,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:22:43,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:22:43,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:22:43,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:22:43,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:22:43,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:22:43,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:22:43,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:22:43,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:22:43,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:22:43,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:22:43,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:22:43,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:22:43,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:22:43,795 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:22:43,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:22:43,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-20 22:22:44,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:22:44,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:22:44,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:22:44,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:22:44,039 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:22:44,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2022-09-20 22:22:44,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6119857f8/6378e812821040ea8bc52d6da2cd53a8/FLAGe93d2a95e [2022-09-20 22:22:44,500 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:22:44,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2022-09-20 22:22:44,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6119857f8/6378e812821040ea8bc52d6da2cd53a8/FLAGe93d2a95e [2022-09-20 22:22:44,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6119857f8/6378e812821040ea8bc52d6da2cd53a8 [2022-09-20 22:22:44,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:22:44,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:22:44,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:22:44,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:22:44,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:22:44,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:22:44" (1/1) ... [2022-09-20 22:22:44,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76990561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:44, skipping insertion in model container [2022-09-20 22:22:44,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:22:44" (1/1) ... [2022-09-20 22:22:44,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:22:44,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:22:45,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i[949,962] [2022-09-20 22:22:45,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:22:45,381 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:22:45,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i[949,962] [2022-09-20 22:22:45,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:22:45,495 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:22:45,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45 WrapperNode [2022-09-20 22:22:45,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:22:45,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:22:45,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:22:45,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:22:45,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,566 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 730 [2022-09-20 22:22:45,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:22:45,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:22:45,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:22:45,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:22:45,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:22:45,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:22:45,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:22:45,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:22:45,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (1/1) ... [2022-09-20 22:22:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:22:45,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:22:45,680 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-09-20 22:22:45,705 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-09-20 22:22:45,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:22:45,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:22:45,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:22:45,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:22:45,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:22:45,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:22:45,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:22:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:22:45,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:22:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:22:45,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:22:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 22:22:45,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 22:22:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:22:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:22:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:22:45,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:22:45,727 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:22:45,894 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:22:45,911 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:22:46,690 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:22:47,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:22:47,301 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:22:47,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:22:47 BoogieIcfgContainer [2022-09-20 22:22:47,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:22:47,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:22:47,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:22:47,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:22:47,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:22:44" (1/3) ... [2022-09-20 22:22:47,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d8fb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:22:47, skipping insertion in model container [2022-09-20 22:22:47,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:22:45" (2/3) ... [2022-09-20 22:22:47,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d8fb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:22:47, skipping insertion in model container [2022-09-20 22:22:47,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:22:47" (3/3) ... [2022-09-20 22:22:47,312 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2022-09-20 22:22:47,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:22:47,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-09-20 22:22:47,331 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:22:47,413 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:22:47,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 157 transitions, 334 flow [2022-09-20 22:22:47,577 INFO L130 PetriNetUnfolder]: 2/153 cut-off events. [2022-09-20 22:22:47,577 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:22:47,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 2/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-09-20 22:22:47,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 157 transitions, 334 flow [2022-09-20 22:22:47,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 153 transitions, 318 flow [2022-09-20 22:22:47,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:22:47,611 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;@63536af2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:22:47,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-09-20 22:22:47,634 INFO L130 PetriNetUnfolder]: 0/95 cut-off events. [2022-09-20 22:22:47,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:22:47,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:47,636 INFO L208 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-09-20 22:22:47,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1971041437, now seen corresponding path program 1 times [2022-09-20 22:22:47,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:47,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829547385] [2022-09-20 22:22:47,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:47,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:47,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829547385] [2022-09-20 22:22:47,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829547385] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:47,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:47,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:22:47,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011580705] [2022-09-20 22:22:47,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:47,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:22:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:47,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:22:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:22:47,958 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 157 [2022-09-20 22:22:47,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 153 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-09-20 22:22:47,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:47,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 157 [2022-09-20 22:22:47,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:48,437 INFO L130 PetriNetUnfolder]: 280/1697 cut-off events. [2022-09-20 22:22:48,438 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-09-20 22:22:48,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 1697 events. 280/1697 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 14217 event pairs, 186 based on Foata normal form. 54/1613 useless extension candidates. Maximal degree in co-relation 2099. Up to 377 conditions per place. [2022-09-20 22:22:48,456 INFO L137 encePairwiseOnDemand]: 152/157 looper letters, 22 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2022-09-20 22:22:48,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 157 transitions, 377 flow [2022-09-20 22:22:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:22:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:22:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2022-09-20 22:22:48,469 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2022-09-20 22:22:48,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2022-09-20 22:22:48,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2022-09-20 22:22:48,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:48,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2022-09-20 22:22:48,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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-09-20 22:22:48,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-09-20 22:22:48,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-09-20 22:22:48,486 INFO L175 Difference]: Start difference. First operand has 164 places, 153 transitions, 318 flow. Second operand 3 states and 440 transitions. [2022-09-20 22:22:48,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 157 transitions, 377 flow [2022-09-20 22:22:48,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 372 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:22:48,493 INFO L231 Difference]: Finished difference. Result has 160 places, 149 transitions, 310 flow [2022-09-20 22:22:48,495 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=160, PETRI_TRANSITIONS=149} [2022-09-20 22:22:48,498 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, -4 predicate places. [2022-09-20 22:22:48,498 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 149 transitions, 310 flow [2022-09-20 22:22:48,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-09-20 22:22:48,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:48,499 INFO L208 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] [2022-09-20 22:22:48,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:22:48,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash 325979700, now seen corresponding path program 1 times [2022-09-20 22:22:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:48,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904946352] [2022-09-20 22:22:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:48,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904946352] [2022-09-20 22:22:48,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904946352] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:48,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:48,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:22:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941971606] [2022-09-20 22:22:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:48,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:22:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:48,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:22:48,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:22:48,620 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 157 [2022-09-20 22:22:48,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 149 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-09-20 22:22:48,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:48,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 157 [2022-09-20 22:22:48,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:48,866 INFO L130 PetriNetUnfolder]: 221/811 cut-off events. [2022-09-20 22:22:48,867 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-09-20 22:22:48,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 811 events. 221/811 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4626 event pairs, 44 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1150. Up to 268 conditions per place. [2022-09-20 22:22:48,874 INFO L137 encePairwiseOnDemand]: 154/157 looper letters, 20 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2022-09-20 22:22:48,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 368 flow [2022-09-20 22:22:48,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:22:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:22:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-09-20 22:22:48,878 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.921443736730361 [2022-09-20 22:22:48,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-09-20 22:22:48,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-09-20 22:22:48,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:48,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-09-20 22:22:48,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-09-20 22:22:48,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-09-20 22:22:48,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-09-20 22:22:48,882 INFO L175 Difference]: Start difference. First operand has 160 places, 149 transitions, 310 flow. Second operand 3 states and 434 transitions. [2022-09-20 22:22:48,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 368 flow [2022-09-20 22:22:48,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:22:48,885 INFO L231 Difference]: Finished difference. Result has 159 places, 148 transitions, 308 flow [2022-09-20 22:22:48,886 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=159, PETRI_TRANSITIONS=148} [2022-09-20 22:22:48,886 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, -5 predicate places. [2022-09-20 22:22:48,887 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 148 transitions, 308 flow [2022-09-20 22:22:48,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-09-20 22:22:48,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:48,887 INFO L208 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, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:22:48,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:22:48,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2140422950, now seen corresponding path program 1 times [2022-09-20 22:22:48,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:48,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323865162] [2022-09-20 22:22:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:49,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:49,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323865162] [2022-09-20 22:22:49,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323865162] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:49,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:49,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:22:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841001004] [2022-09-20 22:22:49,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:49,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:22:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:22:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:22:49,118 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 157 [2022-09-20 22:22:49,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 148 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 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-09-20 22:22:49,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:49,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 157 [2022-09-20 22:22:49,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:49,918 INFO L130 PetriNetUnfolder]: 745/2151 cut-off events. [2022-09-20 22:22:49,918 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-09-20 22:22:49,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3413 conditions, 2151 events. 745/2151 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16335 event pairs, 137 based on Foata normal form. 0/2095 useless extension candidates. Maximal degree in co-relation 3338. Up to 449 conditions per place. [2022-09-20 22:22:49,933 INFO L137 encePairwiseOnDemand]: 151/157 looper letters, 24 selfloop transitions, 2 changer transitions 62/202 dead transitions. [2022-09-20 22:22:49,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 202 transitions, 572 flow [2022-09-20 22:22:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:22:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:22:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1256 transitions. [2022-09-20 22:22:49,937 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-09-20 22:22:49,937 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1256 transitions. [2022-09-20 22:22:49,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1256 transitions. [2022-09-20 22:22:49,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:49,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1256 transitions. [2022-09-20 22:22:49,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.55555555555554) internal successors, (1256), 9 states have internal predecessors, (1256), 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-09-20 22:22:49,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:22:49,945 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:22:49,945 INFO L175 Difference]: Start difference. First operand has 159 places, 148 transitions, 308 flow. Second operand 9 states and 1256 transitions. [2022-09-20 22:22:49,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 202 transitions, 572 flow [2022-09-20 22:22:49,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 202 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:22:49,949 INFO L231 Difference]: Finished difference. Result has 172 places, 134 transitions, 296 flow [2022-09-20 22:22:49,949 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=172, PETRI_TRANSITIONS=134} [2022-09-20 22:22:49,950 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 8 predicate places. [2022-09-20 22:22:49,950 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 134 transitions, 296 flow [2022-09-20 22:22:49,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 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-09-20 22:22:49,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:49,951 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:22:49,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:22:49,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 200260439, now seen corresponding path program 1 times [2022-09-20 22:22:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:49,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666525919] [2022-09-20 22:22:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:50,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:50,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666525919] [2022-09-20 22:22:50,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666525919] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:50,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:50,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:22:50,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395579292] [2022-09-20 22:22:50,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:50,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:22:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:50,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:22:50,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:22:50,174 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 157 [2022-09-20 22:22:50,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 134 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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-09-20 22:22:50,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:50,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 157 [2022-09-20 22:22:50,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:50,630 INFO L130 PetriNetUnfolder]: 371/892 cut-off events. [2022-09-20 22:22:50,630 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-09-20 22:22:50,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 892 events. 371/892 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5008 event pairs, 86 based on Foata normal form. 20/877 useless extension candidates. Maximal degree in co-relation 1667. Up to 308 conditions per place. [2022-09-20 22:22:50,638 INFO L137 encePairwiseOnDemand]: 151/157 looper letters, 24 selfloop transitions, 2 changer transitions 31/171 dead transitions. [2022-09-20 22:22:50,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 171 transitions, 507 flow [2022-09-20 22:22:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:22:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:22:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1238 transitions. [2022-09-20 22:22:50,641 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8761500353857041 [2022-09-20 22:22:50,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1238 transitions. [2022-09-20 22:22:50,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1238 transitions. [2022-09-20 22:22:50,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:50,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1238 transitions. [2022-09-20 22:22:50,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.55555555555554) internal successors, (1238), 9 states have internal predecessors, (1238), 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-09-20 22:22:50,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:22:50,649 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:22:50,650 INFO L175 Difference]: Start difference. First operand has 172 places, 134 transitions, 296 flow. Second operand 9 states and 1238 transitions. [2022-09-20 22:22:50,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 171 transitions, 507 flow [2022-09-20 22:22:50,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 171 transitions, 473 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-09-20 22:22:50,657 INFO L231 Difference]: Finished difference. Result has 159 places, 134 transitions, 300 flow [2022-09-20 22:22:50,658 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=300, PETRI_PLACES=159, PETRI_TRANSITIONS=134} [2022-09-20 22:22:50,660 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, -5 predicate places. [2022-09-20 22:22:50,660 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 134 transitions, 300 flow [2022-09-20 22:22:50,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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-09-20 22:22:50,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:50,670 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:22:50,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:22:50,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:50,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1016104575, now seen corresponding path program 1 times [2022-09-20 22:22:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:50,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297115152] [2022-09-20 22:22:50,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:50,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:50,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297115152] [2022-09-20 22:22:50,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297115152] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:50,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:50,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:22:50,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877102916] [2022-09-20 22:22:50,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:50,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:22:50,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:50,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:22:50,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:22:50,986 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 157 [2022-09-20 22:22:50,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 134 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 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-09-20 22:22:50,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:50,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 157 [2022-09-20 22:22:50,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:51,713 INFO L130 PetriNetUnfolder]: 1231/2434 cut-off events. [2022-09-20 22:22:51,713 INFO L131 PetriNetUnfolder]: For 436/436 co-relation queries the response was YES. [2022-09-20 22:22:51,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4893 conditions, 2434 events. 1231/2434 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15606 event pairs, 682 based on Foata normal form. 36/2345 useless extension candidates. Maximal degree in co-relation 4810. Up to 1261 conditions per place. [2022-09-20 22:22:51,733 INFO L137 encePairwiseOnDemand]: 150/157 looper letters, 32 selfloop transitions, 3 changer transitions 40/187 dead transitions. [2022-09-20 22:22:51,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 187 transitions, 586 flow [2022-09-20 22:22:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:22:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:22:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1238 transitions. [2022-09-20 22:22:51,736 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8761500353857041 [2022-09-20 22:22:51,737 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1238 transitions. [2022-09-20 22:22:51,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1238 transitions. [2022-09-20 22:22:51,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:51,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1238 transitions. [2022-09-20 22:22:51,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.55555555555554) internal successors, (1238), 9 states have internal predecessors, (1238), 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-09-20 22:22:51,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:22:51,743 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:22:51,743 INFO L175 Difference]: Start difference. First operand has 159 places, 134 transitions, 300 flow. Second operand 9 states and 1238 transitions. [2022-09-20 22:22:51,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 187 transitions, 586 flow [2022-09-20 22:22:51,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 187 transitions, 552 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-09-20 22:22:51,754 INFO L231 Difference]: Finished difference. Result has 160 places, 136 transitions, 327 flow [2022-09-20 22:22:51,754 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=160, PETRI_TRANSITIONS=136} [2022-09-20 22:22:51,755 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, -4 predicate places. [2022-09-20 22:22:51,755 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 136 transitions, 327 flow [2022-09-20 22:22:51,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 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-09-20 22:22:51,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:51,756 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:22:51,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:22:51,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash -118162328, now seen corresponding path program 1 times [2022-09-20 22:22:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:51,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090481364] [2022-09-20 22:22:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:51,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090481364] [2022-09-20 22:22:51,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090481364] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:51,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:51,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:22:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549851083] [2022-09-20 22:22:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:51,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:22:51,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:22:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:22:51,944 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 157 [2022-09-20 22:22:51,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 136 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 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-09-20 22:22:51,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:51,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 157 [2022-09-20 22:22:51,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:54,232 INFO L130 PetriNetUnfolder]: 6993/11690 cut-off events. [2022-09-20 22:22:54,232 INFO L131 PetriNetUnfolder]: For 1639/1639 co-relation queries the response was YES. [2022-09-20 22:22:54,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24076 conditions, 11690 events. 6993/11690 cut-off events. For 1639/1639 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 88359 event pairs, 515 based on Foata normal form. 0/11195 useless extension candidates. Maximal degree in co-relation 23992. Up to 3928 conditions per place. [2022-09-20 22:22:54,352 INFO L137 encePairwiseOnDemand]: 146/157 looper letters, 99 selfloop transitions, 18 changer transitions 5/232 dead transitions. [2022-09-20 22:22:54,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 232 transitions, 783 flow [2022-09-20 22:22:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:22:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:22:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1384 transitions. [2022-09-20 22:22:54,357 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8815286624203822 [2022-09-20 22:22:54,357 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1384 transitions. [2022-09-20 22:22:54,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1384 transitions. [2022-09-20 22:22:54,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:54,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1384 transitions. [2022-09-20 22:22:54,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 138.4) internal successors, (1384), 10 states have internal predecessors, (1384), 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-09-20 22:22:54,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 157.0) internal successors, (1727), 11 states have internal predecessors, (1727), 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-09-20 22:22:54,364 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 157.0) internal successors, (1727), 11 states have internal predecessors, (1727), 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-09-20 22:22:54,364 INFO L175 Difference]: Start difference. First operand has 160 places, 136 transitions, 327 flow. Second operand 10 states and 1384 transitions. [2022-09-20 22:22:54,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 232 transitions, 783 flow [2022-09-20 22:22:54,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 232 transitions, 774 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-09-20 22:22:54,378 INFO L231 Difference]: Finished difference. Result has 165 places, 152 transitions, 450 flow [2022-09-20 22:22:54,379 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=450, PETRI_PLACES=165, PETRI_TRANSITIONS=152} [2022-09-20 22:22:54,381 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 1 predicate places. [2022-09-20 22:22:54,381 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 152 transitions, 450 flow [2022-09-20 22:22:54,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 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-09-20 22:22:54,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:54,382 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:22:54,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:22:54,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1098680305, now seen corresponding path program 1 times [2022-09-20 22:22:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:54,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042001463] [2022-09-20 22:22:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:54,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:54,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042001463] [2022-09-20 22:22:54,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042001463] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:54,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:54,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:22:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075963661] [2022-09-20 22:22:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:54,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:22:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:54,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:22:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:22:54,582 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 157 [2022-09-20 22:22:54,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 152 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 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-09-20 22:22:54,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:54,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 157 [2022-09-20 22:22:54,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:56,224 INFO L130 PetriNetUnfolder]: 2367/7159 cut-off events. [2022-09-20 22:22:56,224 INFO L131 PetriNetUnfolder]: For 5899/7176 co-relation queries the response was YES. [2022-09-20 22:22:56,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17143 conditions, 7159 events. 2367/7159 cut-off events. For 5899/7176 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 76256 event pairs, 1011 based on Foata normal form. 154/6767 useless extension candidates. Maximal degree in co-relation 17054. Up to 1394 conditions per place. [2022-09-20 22:22:56,296 INFO L137 encePairwiseOnDemand]: 151/157 looper letters, 63 selfloop transitions, 11 changer transitions 0/202 dead transitions. [2022-09-20 22:22:56,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 202 transitions, 750 flow [2022-09-20 22:22:56,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:22:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:22:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1236 transitions. [2022-09-20 22:22:56,300 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8747346072186837 [2022-09-20 22:22:56,300 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1236 transitions. [2022-09-20 22:22:56,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1236 transitions. [2022-09-20 22:22:56,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:56,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1236 transitions. [2022-09-20 22:22:56,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.33333333333334) internal successors, (1236), 9 states have internal predecessors, (1236), 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-09-20 22:22:56,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:22:56,307 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:22:56,307 INFO L175 Difference]: Start difference. First operand has 165 places, 152 transitions, 450 flow. Second operand 9 states and 1236 transitions. [2022-09-20 22:22:56,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 202 transitions, 750 flow [2022-09-20 22:22:56,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 202 transitions, 740 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-09-20 22:22:56,331 INFO L231 Difference]: Finished difference. Result has 179 places, 160 transitions, 549 flow [2022-09-20 22:22:56,331 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=549, PETRI_PLACES=179, PETRI_TRANSITIONS=160} [2022-09-20 22:22:56,332 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 15 predicate places. [2022-09-20 22:22:56,332 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 160 transitions, 549 flow [2022-09-20 22:22:56,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 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-09-20 22:22:56,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:56,333 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:22:56,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:22:56,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:56,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1525114243, now seen corresponding path program 1 times [2022-09-20 22:22:56,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:56,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513495986] [2022-09-20 22:22:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:56,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:56,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:56,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513495986] [2022-09-20 22:22:56,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513495986] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:56,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:56,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:22:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144331399] [2022-09-20 22:22:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:56,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:22:56,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:56,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:22:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:22:56,547 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 157 [2022-09-20 22:22:56,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 160 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 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-09-20 22:22:56,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:56,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 157 [2022-09-20 22:22:56,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:59,554 INFO L130 PetriNetUnfolder]: 9993/17227 cut-off events. [2022-09-20 22:22:59,554 INFO L131 PetriNetUnfolder]: For 23100/23138 co-relation queries the response was YES. [2022-09-20 22:22:59,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50721 conditions, 17227 events. 9993/17227 cut-off events. For 23100/23138 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 146342 event pairs, 588 based on Foata normal form. 270/17037 useless extension candidates. Maximal degree in co-relation 50625. Up to 4119 conditions per place. [2022-09-20 22:22:59,677 INFO L137 encePairwiseOnDemand]: 146/157 looper letters, 55 selfloop transitions, 11 changer transitions 111/287 dead transitions. [2022-09-20 22:22:59,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 287 transitions, 1369 flow [2022-09-20 22:22:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:22:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:22:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1803 transitions. [2022-09-20 22:22:59,682 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8833904948554631 [2022-09-20 22:22:59,682 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1803 transitions. [2022-09-20 22:22:59,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1803 transitions. [2022-09-20 22:22:59,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:59,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1803 transitions. [2022-09-20 22:22:59,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 138.69230769230768) internal successors, (1803), 13 states have internal predecessors, (1803), 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-09-20 22:22:59,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 157.0) internal successors, (2198), 14 states have internal predecessors, (2198), 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-09-20 22:22:59,691 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 157.0) internal successors, (2198), 14 states have internal predecessors, (2198), 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-09-20 22:22:59,691 INFO L175 Difference]: Start difference. First operand has 179 places, 160 transitions, 549 flow. Second operand 13 states and 1803 transitions. [2022-09-20 22:22:59,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 287 transitions, 1369 flow [2022-09-20 22:22:59,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 287 transitions, 1336 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-09-20 22:22:59,815 INFO L231 Difference]: Finished difference. Result has 196 places, 143 transitions, 499 flow [2022-09-20 22:22:59,815 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=499, PETRI_PLACES=196, PETRI_TRANSITIONS=143} [2022-09-20 22:22:59,817 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 32 predicate places. [2022-09-20 22:22:59,817 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 143 transitions, 499 flow [2022-09-20 22:22:59,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 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-09-20 22:22:59,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:59,818 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:22:59,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:22:59,818 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:22:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -870718741, now seen corresponding path program 1 times [2022-09-20 22:22:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:59,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860919154] [2022-09-20 22:22:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:23:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:23:00,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:23:00,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860919154] [2022-09-20 22:23:00,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860919154] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:23:00,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:23:00,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:23:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818886170] [2022-09-20 22:23:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:23:00,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:23:00,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:23:00,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:23:00,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:23:00,087 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 157 [2022-09-20 22:23:00,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 143 transitions, 499 flow. Second operand has 8 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 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-09-20 22:23:00,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:23:00,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 157 [2022-09-20 22:23:00,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:23:01,190 INFO L130 PetriNetUnfolder]: 1793/4002 cut-off events. [2022-09-20 22:23:01,191 INFO L131 PetriNetUnfolder]: For 12376/12393 co-relation queries the response was YES. [2022-09-20 22:23:01,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13486 conditions, 4002 events. 1793/4002 cut-off events. For 12376/12393 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 31506 event pairs, 101 based on Foata normal form. 123/4025 useless extension candidates. Maximal degree in co-relation 13397. Up to 879 conditions per place. [2022-09-20 22:23:01,224 INFO L137 encePairwiseOnDemand]: 147/157 looper letters, 64 selfloop transitions, 15 changer transitions 55/244 dead transitions. [2022-09-20 22:23:01,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 244 transitions, 1316 flow [2022-09-20 22:23:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:23:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:23:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1522 transitions. [2022-09-20 22:23:01,229 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8812970469021424 [2022-09-20 22:23:01,229 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1522 transitions. [2022-09-20 22:23:01,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1522 transitions. [2022-09-20 22:23:01,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:23:01,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1522 transitions. [2022-09-20 22:23:01,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 138.36363636363637) internal successors, (1522), 11 states have internal predecessors, (1522), 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-09-20 22:23:01,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 157.0) internal successors, (1884), 12 states have internal predecessors, (1884), 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-09-20 22:23:01,236 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 157.0) internal successors, (1884), 12 states have internal predecessors, (1884), 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-09-20 22:23:01,237 INFO L175 Difference]: Start difference. First operand has 196 places, 143 transitions, 499 flow. Second operand 11 states and 1522 transitions. [2022-09-20 22:23:01,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 244 transitions, 1316 flow [2022-09-20 22:23:01,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 244 transitions, 1100 flow, removed 91 selfloop flow, removed 19 redundant places. [2022-09-20 22:23:01,302 INFO L231 Difference]: Finished difference. Result has 174 places, 147 transitions, 520 flow [2022-09-20 22:23:01,302 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=520, PETRI_PLACES=174, PETRI_TRANSITIONS=147} [2022-09-20 22:23:01,303 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 10 predicate places. [2022-09-20 22:23:01,303 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 147 transitions, 520 flow [2022-09-20 22:23:01,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 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-09-20 22:23:01,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:23:01,304 INFO L208 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, 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-09-20 22:23:01,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:23:01,304 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:23:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:23:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2072912822, now seen corresponding path program 1 times [2022-09-20 22:23:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:23:01,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551267209] [2022-09-20 22:23:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:23:01,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:23:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:23:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:23:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:23:01,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551267209] [2022-09-20 22:23:01,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551267209] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:23:01,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:23:01,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:23:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7859848] [2022-09-20 22:23:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:23:01,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:23:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:23:01,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:23:01,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:23:01,549 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 157 [2022-09-20 22:23:01,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 147 transitions, 520 flow. Second operand has 9 states, 9 states have (on average 128.66666666666666) internal successors, (1158), 9 states have internal predecessors, (1158), 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-09-20 22:23:01,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:23:01,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 157 [2022-09-20 22:23:01,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:23:02,148 INFO L130 PetriNetUnfolder]: 878/2010 cut-off events. [2022-09-20 22:23:02,148 INFO L131 PetriNetUnfolder]: For 3757/3757 co-relation queries the response was YES. [2022-09-20 22:23:02,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5990 conditions, 2010 events. 878/2010 cut-off events. For 3757/3757 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13952 event pairs, 219 based on Foata normal form. 26/1927 useless extension candidates. Maximal degree in co-relation 5939. Up to 530 conditions per place. [2022-09-20 22:23:02,163 INFO L137 encePairwiseOnDemand]: 147/157 looper letters, 48 selfloop transitions, 19 changer transitions 31/208 dead transitions. [2022-09-20 22:23:02,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 208 transitions, 1000 flow [2022-09-20 22:23:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:23:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:23:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1612 transitions. [2022-09-20 22:23:02,168 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8556263269639066 [2022-09-20 22:23:02,168 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1612 transitions. [2022-09-20 22:23:02,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1612 transitions. [2022-09-20 22:23:02,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:23:02,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1612 transitions. [2022-09-20 22:23:02,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 134.33333333333334) internal successors, (1612), 12 states have internal predecessors, (1612), 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-09-20 22:23:02,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 157.0) internal successors, (2041), 13 states have internal predecessors, (2041), 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-09-20 22:23:02,176 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 157.0) internal successors, (2041), 13 states have internal predecessors, (2041), 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-09-20 22:23:02,177 INFO L175 Difference]: Start difference. First operand has 174 places, 147 transitions, 520 flow. Second operand 12 states and 1612 transitions. [2022-09-20 22:23:02,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 208 transitions, 1000 flow [2022-09-20 22:23:02,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 208 transitions, 836 flow, removed 60 selfloop flow, removed 15 redundant places. [2022-09-20 22:23:02,199 INFO L231 Difference]: Finished difference. Result has 172 places, 147 transitions, 476 flow [2022-09-20 22:23:02,199 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=476, PETRI_PLACES=172, PETRI_TRANSITIONS=147} [2022-09-20 22:23:02,200 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 8 predicate places. [2022-09-20 22:23:02,200 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 147 transitions, 476 flow [2022-09-20 22:23:02,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 128.66666666666666) internal successors, (1158), 9 states have internal predecessors, (1158), 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-09-20 22:23:02,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:23:02,201 INFO L208 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, 1, 1, 1, 1, 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-09-20 22:23:02,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:23:02,201 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:23:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:23:02,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1824084748, now seen corresponding path program 1 times [2022-09-20 22:23:02,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:23:02,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968944435] [2022-09-20 22:23:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:23:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:23:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:23:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:23:02,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:23:02,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968944435] [2022-09-20 22:23:02,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968944435] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:23:02,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:23:02,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:23:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316319314] [2022-09-20 22:23:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:23:02,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:23:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:23:02,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:23:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:23:02,472 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 157 [2022-09-20 22:23:02,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 147 transitions, 476 flow. Second operand has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:23:02,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:23:02,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 157 [2022-09-20 22:23:02,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:23:02,862 INFO L130 PetriNetUnfolder]: 494/1672 cut-off events. [2022-09-20 22:23:02,863 INFO L131 PetriNetUnfolder]: For 1307/1487 co-relation queries the response was YES. [2022-09-20 22:23:02,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3855 conditions, 1672 events. 494/1672 cut-off events. For 1307/1487 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13227 event pairs, 146 based on Foata normal form. 1/1566 useless extension candidates. Maximal degree in co-relation 3788. Up to 268 conditions per place. [2022-09-20 22:23:02,875 INFO L137 encePairwiseOnDemand]: 151/157 looper letters, 28 selfloop transitions, 1 changer transitions 17/170 dead transitions. [2022-09-20 22:23:02,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 622 flow [2022-09-20 22:23:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:23:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:23:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 943 transitions. [2022-09-20 22:23:02,878 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8580527752502275 [2022-09-20 22:23:02,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 943 transitions. [2022-09-20 22:23:02,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 943 transitions. [2022-09-20 22:23:02,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:23:02,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 943 transitions. [2022-09-20 22:23:02,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.71428571428572) internal successors, (943), 7 states have internal predecessors, (943), 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-09-20 22:23:02,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 157.0) internal successors, (1256), 8 states have internal predecessors, (1256), 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-09-20 22:23:02,883 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 157.0) internal successors, (1256), 8 states have internal predecessors, (1256), 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-09-20 22:23:02,883 INFO L175 Difference]: Start difference. First operand has 172 places, 147 transitions, 476 flow. Second operand 7 states and 943 transitions. [2022-09-20 22:23:02,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 622 flow [2022-09-20 22:23:02,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 170 transitions, 498 flow, removed 30 selfloop flow, removed 17 redundant places. [2022-09-20 22:23:02,903 INFO L231 Difference]: Finished difference. Result has 162 places, 147 transitions, 365 flow [2022-09-20 22:23:02,903 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=365, PETRI_PLACES=162, PETRI_TRANSITIONS=147} [2022-09-20 22:23:02,903 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, -2 predicate places. [2022-09-20 22:23:02,903 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 147 transitions, 365 flow [2022-09-20 22:23:02,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:23:02,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:23:02,904 INFO L208 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, 1, 1, 1, 1, 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-09-20 22:23:02,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:23:02,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:23:02,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:23:02,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1331587500, now seen corresponding path program 2 times [2022-09-20 22:23:02,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:23:02,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278585909] [2022-09-20 22:23:02,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:23:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:23:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:23:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:23:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:23:03,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278585909] [2022-09-20 22:23:03,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278585909] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:23:03,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:23:03,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:23:03,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910741086] [2022-09-20 22:23:03,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:23:03,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:23:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:23:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:23:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:23:03,258 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 157 [2022-09-20 22:23:03,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 147 transitions, 365 flow. Second operand has 11 states, 11 states have (on average 128.27272727272728) internal successors, (1411), 11 states have internal predecessors, (1411), 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-09-20 22:23:03,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:23:03,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 157 [2022-09-20 22:23:03,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:23:03,712 INFO L130 PetriNetUnfolder]: 524/1885 cut-off events. [2022-09-20 22:23:03,712 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-09-20 22:23:03,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3164 conditions, 1885 events. 524/1885 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16034 event pairs, 74 based on Foata normal form. 1/1785 useless extension candidates. Maximal degree in co-relation 3150. Up to 299 conditions per place. [2022-09-20 22:23:03,726 INFO L137 encePairwiseOnDemand]: 146/157 looper letters, 31 selfloop transitions, 7 changer transitions 6/166 dead transitions. [2022-09-20 22:23:03,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 166 transitions, 503 flow [2022-09-20 22:23:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:23:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:23:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1179 transitions. [2022-09-20 22:23:03,729 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8343949044585988 [2022-09-20 22:23:03,729 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1179 transitions. [2022-09-20 22:23:03,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1179 transitions. [2022-09-20 22:23:03,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:23:03,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1179 transitions. [2022-09-20 22:23:03,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 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-09-20 22:23:03,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:23:03,737 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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-09-20 22:23:03,737 INFO L175 Difference]: Start difference. First operand has 162 places, 147 transitions, 365 flow. Second operand 9 states and 1179 transitions. [2022-09-20 22:23:03,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 166 transitions, 503 flow [2022-09-20 22:23:03,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 166 transitions, 488 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-09-20 22:23:03,741 INFO L231 Difference]: Finished difference. Result has 166 places, 151 transitions, 403 flow [2022-09-20 22:23:03,741 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=166, PETRI_TRANSITIONS=151} [2022-09-20 22:23:03,742 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 2 predicate places. [2022-09-20 22:23:03,742 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 151 transitions, 403 flow [2022-09-20 22:23:03,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 128.27272727272728) internal successors, (1411), 11 states have internal predecessors, (1411), 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-09-20 22:23:03,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:23:03,743 INFO L208 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, 1, 1, 1, 1, 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-09-20 22:23:03,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 22:23:03,743 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:23:03,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:23:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1812595958, now seen corresponding path program 3 times [2022-09-20 22:23:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:23:03,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295587933] [2022-09-20 22:23:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:23:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:23:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:23:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:23:04,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:23:04,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295587933] [2022-09-20 22:23:04,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295587933] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:23:04,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:23:04,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-20 22:23:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120751088] [2022-09-20 22:23:04,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:23:04,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-20 22:23:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:23:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-20 22:23:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-09-20 22:23:04,502 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 157 [2022-09-20 22:23:04,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 151 transitions, 403 flow. Second operand has 18 states, 18 states have (on average 119.83333333333333) internal successors, (2157), 18 states have internal predecessors, (2157), 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-09-20 22:23:04,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:23:04,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 157 [2022-09-20 22:23:04,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:23:05,955 INFO L130 PetriNetUnfolder]: 919/3262 cut-off events. [2022-09-20 22:23:05,955 INFO L131 PetriNetUnfolder]: For 552/608 co-relation queries the response was YES. [2022-09-20 22:23:05,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5929 conditions, 3262 events. 919/3262 cut-off events. For 552/608 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 32312 event pairs, 69 based on Foata normal form. 5/3070 useless extension candidates. Maximal degree in co-relation 5914. Up to 532 conditions per place. [2022-09-20 22:23:05,977 INFO L137 encePairwiseOnDemand]: 138/157 looper letters, 50 selfloop transitions, 27 changer transitions 21/212 dead transitions. [2022-09-20 22:23:05,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 212 transitions, 826 flow [2022-09-20 22:23:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-20 22:23:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-09-20 22:23:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2920 transitions. [2022-09-20 22:23:05,986 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7749469214437368 [2022-09-20 22:23:05,986 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2920 transitions. [2022-09-20 22:23:05,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2920 transitions. [2022-09-20 22:23:05,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:23:05,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2920 transitions. [2022-09-20 22:23:05,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 121.66666666666667) internal successors, (2920), 24 states have internal predecessors, (2920), 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-09-20 22:23:05,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 157.0) internal successors, (3925), 25 states have internal predecessors, (3925), 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-09-20 22:23:05,997 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 157.0) internal successors, (3925), 25 states have internal predecessors, (3925), 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-09-20 22:23:05,997 INFO L175 Difference]: Start difference. First operand has 166 places, 151 transitions, 403 flow. Second operand 24 states and 2920 transitions. [2022-09-20 22:23:05,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 212 transitions, 826 flow [2022-09-20 22:23:06,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 212 transitions, 806 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-09-20 22:23:06,003 INFO L231 Difference]: Finished difference. Result has 190 places, 170 transitions, 557 flow [2022-09-20 22:23:06,003 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=557, PETRI_PLACES=190, PETRI_TRANSITIONS=170} [2022-09-20 22:23:06,004 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 26 predicate places. [2022-09-20 22:23:06,004 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 170 transitions, 557 flow [2022-09-20 22:23:06,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 119.83333333333333) internal successors, (2157), 18 states have internal predecessors, (2157), 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-09-20 22:23:06,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:23:06,005 INFO L208 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, 1, 1, 1, 1, 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-09-20 22:23:06,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 22:23:06,005 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:23:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:23:06,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1365292492, now seen corresponding path program 4 times [2022-09-20 22:23:06,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:23:06,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424285146] [2022-09-20 22:23:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:23:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:23:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:23:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:23:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:23:06,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424285146] [2022-09-20 22:23:06,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424285146] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:23:06,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:23:06,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-09-20 22:23:06,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243630459] [2022-09-20 22:23:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:23:06,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-20 22:23:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:23:06,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-20 22:23:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-09-20 22:23:06,517 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 157 [2022-09-20 22:23:06,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 170 transitions, 557 flow. Second operand has 14 states, 14 states have (on average 124.07142857142857) internal successors, (1737), 14 states have internal predecessors, (1737), 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-09-20 22:23:06,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:23:06,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 157 [2022-09-20 22:23:06,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:23:07,448 INFO L130 PetriNetUnfolder]: 1048/3765 cut-off events. [2022-09-20 22:23:07,448 INFO L131 PetriNetUnfolder]: For 953/1019 co-relation queries the response was YES. [2022-09-20 22:23:07,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7208 conditions, 3765 events. 1048/3765 cut-off events. For 953/1019 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 39218 event pairs, 79 based on Foata normal form. 4/3542 useless extension candidates. Maximal degree in co-relation 7186. Up to 652 conditions per place. [2022-09-20 22:23:07,492 INFO L137 encePairwiseOnDemand]: 145/157 looper letters, 43 selfloop transitions, 13 changer transitions 18/192 dead transitions. [2022-09-20 22:23:07,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 192 transitions, 800 flow [2022-09-20 22:23:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:23:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:23:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1391 transitions. [2022-09-20 22:23:07,495 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8054429646786335 [2022-09-20 22:23:07,495 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1391 transitions. [2022-09-20 22:23:07,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1391 transitions. [2022-09-20 22:23:07,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:23:07,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1391 transitions. [2022-09-20 22:23:07,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.45454545454545) internal successors, (1391), 11 states have internal predecessors, (1391), 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-09-20 22:23:07,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 157.0) internal successors, (1884), 12 states have internal predecessors, (1884), 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-09-20 22:23:07,502 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 157.0) internal successors, (1884), 12 states have internal predecessors, (1884), 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-09-20 22:23:07,502 INFO L175 Difference]: Start difference. First operand has 190 places, 170 transitions, 557 flow. Second operand 11 states and 1391 transitions. [2022-09-20 22:23:07,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 192 transitions, 800 flow [2022-09-20 22:23:07,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 192 transitions, 760 flow, removed 10 selfloop flow, removed 12 redundant places. [2022-09-20 22:23:07,510 INFO L231 Difference]: Finished difference. Result has 188 places, 169 transitions, 556 flow [2022-09-20 22:23:07,510 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=556, PETRI_PLACES=188, PETRI_TRANSITIONS=169} [2022-09-20 22:23:07,511 INFO L287 CegarLoopForPetriNet]: 164 programPoint places, 24 predicate places. [2022-09-20 22:23:07,511 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 169 transitions, 556 flow [2022-09-20 22:23:07,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 124.07142857142857) internal successors, (1737), 14 states have internal predecessors, (1737), 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-09-20 22:23:07,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:23:07,512 INFO L208 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, 1, 1, 1, 1, 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-09-20 22:23:07,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 22:23:07,512 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-09-20 22:23:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:23:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -389005024, now seen corresponding path program 5 times [2022-09-20 22:23:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:23:07,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981465151] [2022-09-20 22:23:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:23:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:23:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:23:07,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 22:23:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:23:07,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 22:23:07,918 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 22:23:07,919 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-09-20 22:23:07,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-09-20 22:23:07,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-09-20 22:23:07,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2022-09-20 22:23:07,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-09-20 22:23:07,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-09-20 22:23:07,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-09-20 22:23:07,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-09-20 22:23:07,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-09-20 22:23:07,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 22:23:07,922 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:23:07,928 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:23:07,928 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:23:08,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:23:08 BasicIcfg [2022-09-20 22:23:08,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:23:08,238 INFO L158 Benchmark]: Toolchain (without parser) took 23405.44ms. Allocated memory was 176.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 149.7MB in the beginning and 960.1MB in the end (delta: -810.5MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-09-20 22:23:08,239 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:23:08,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.47ms. Allocated memory is still 176.2MB. Free memory was 149.7MB in the beginning and 129.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-09-20 22:23:08,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.05ms. Allocated memory is still 176.2MB. Free memory was 129.7MB in the beginning and 124.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-09-20 22:23:08,241 INFO L158 Benchmark]: Boogie Preprocessor took 69.46ms. Allocated memory is still 176.2MB. Free memory was 124.9MB in the beginning and 121.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-09-20 22:23:08,241 INFO L158 Benchmark]: RCFGBuilder took 1667.29ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 121.0MB in the beginning and 94.3MB in the end (delta: 26.7MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-09-20 22:23:08,241 INFO L158 Benchmark]: TraceAbstraction took 20931.21ms. Allocated memory was 211.8MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 93.8MB in the beginning and 960.1MB in the end (delta: -866.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-09-20 22:23:08,243 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.16ms. Allocated memory is still 176.2MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 662.47ms. Allocated memory is still 176.2MB. Free memory was 149.7MB in the beginning and 129.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.05ms. Allocated memory is still 176.2MB. Free memory was 129.7MB in the beginning and 124.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.46ms. Allocated memory is still 176.2MB. Free memory was 124.9MB in the beginning and 121.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1667.29ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 121.0MB in the beginning and 94.3MB in the end (delta: 26.7MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. * TraceAbstraction took 20931.21ms. Allocated memory was 211.8MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 93.8MB in the beginning and 960.1MB in the end (delta: -866.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L728] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L729] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L730] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L731] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L732] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L733] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L734] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L735] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L736] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L737] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L738] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L739] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L740] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L741] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L742] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L743] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L744] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0] [L748] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L749] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L750] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L751] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L752] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L753] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L754] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L755] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L756] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L757] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L758] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L759] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L760] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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}] [L761] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L762] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L763] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L764] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L765] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L766] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L923] 0 pthread_t t233; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t233={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L924] FCALL, FORK 0 pthread_create(&t233, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t233, ((void *)0), P0, ((void *)0))=-3, t233={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L925] 0 pthread_t t234; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t233={5:0}, t234={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L926] FCALL, FORK 0 pthread_create(&t234, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t234, ((void *)0), P1, ((void *)0))=-2, t233={5:0}, t234={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L927] 0 pthread_t t235; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L928] FCALL, FORK 0 pthread_create(&t235, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t235, ((void *)0), P2, ((void *)0))=-1, t233={5:0}, t234={6:0}, t235={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L929] 0 pthread_t t236; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L930] FCALL, FORK 0 pthread_create(&t236, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t236, ((void *)0), P3, ((void *)0))=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L864] 4 z$w_buff1 = z$w_buff0 [L865] 4 z$w_buff0 = 1 [L866] 4 z$w_buff1_used = z$w_buff0_used [L867] 4 z$w_buff0_used = (_Bool)1 [L868] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L868] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L869] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L870] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L871] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L872] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L873] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L874] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L877] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L878] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L879] 4 z$flush_delayed = weak$$choice2 [L880] 4 z$mem_tmp = z [L881] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L881] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L881] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L881] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L882] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L882] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L883] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L883] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L884] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L884] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L885] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L886] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L887] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L887] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L888] 4 __unbuffered_p3_EAX = z [L889] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L889] 4 z = z$flush_delayed ? z$mem_tmp : z [L890] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L893] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L785] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L805] 3 y$w_buff1 = y$w_buff0 [L806] 3 y$w_buff0 = 2 [L807] 3 y$w_buff1_used = y$w_buff0_used [L808] 3 y$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L810] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L811] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L812] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L813] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L814] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L815] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L818] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 3 y$flush_delayed = weak$$choice2 [L821] 3 y$mem_tmp = y [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L822] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L823] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L823] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L824] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L825] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L827] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L828] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L829] 3 __unbuffered_p2_EAX = y [L830] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L830] 3 y = y$flush_delayed ? y$mem_tmp : y [L831] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=52, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L834] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 3 z$flush_delayed = weak$$choice2 [L837] 3 z$mem_tmp = z [L838] EXPR 3 !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) [L838] 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) [L839] EXPR 3 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)) [L839] 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)) [L840] EXPR 3 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)) [L840] 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)) [L841] EXPR 3 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)) [L841] 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)) [L842] EXPR 3 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)) [L842] 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)) [L843] EXPR 3 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)) [L843] 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)) [L844] EXPR 3 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)) [L844] 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)) [L845] 3 __unbuffered_p2_EBX = z [L846] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L846] 3 z = z$flush_delayed ? z$mem_tmp : z [L847] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=51, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, 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] [L850] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L850] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L851] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L851] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L852] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L852] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L853] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L854] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L854] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L896] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L896] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L896] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L896] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L897] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L897] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L898] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L898] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L899] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L899] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L900] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L900] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L901] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L901] 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) [L902] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L902] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L903] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L903] 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 [L904] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L904] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L905] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L905] 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 [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, 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] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, 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] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=51, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, 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] [L908] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=51, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, 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] [L932] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice0=51, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, 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] [L934] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, 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] [L934] RET 0 assume_abort_if_not(main$tmp_guard0) [L936] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L936] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L936] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L936] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L937] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L937] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L938] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L938] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L939] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L939] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L940] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L940] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L941] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L941] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L941] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L941] 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) [L942] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L942] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L943] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L943] 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 [L944] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L944] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L945] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L945] 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 [L948] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L949] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L950] 0 y$flush_delayed = weak$$choice2 [L951] 0 y$mem_tmp = y [L952] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L952] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L953] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L953] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L954] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L954] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L955] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L955] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L956] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L957] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L957] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L958] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L958] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L959] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L960] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L960] 0 y = y$flush_delayed ? y$mem_tmp : y [L961] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, 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] [L963] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, 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: 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: 930]: 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: 928]: 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: 924]: 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: 926]: 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, 195 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1010 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 561 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1605 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2406 IncrementalHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 109 mSDtfsCounter, 2406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=13, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1697 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1558 ConstructedInterpolants, 0 QuantifiedInterpolants, 7474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-09-20 22:23:08,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...