./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix011.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix011.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:39:10,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:39:10,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:39:10,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:39:10,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:39:10,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:39:10,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:39:10,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:39:10,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:39:10,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:39:10,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:39:10,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:39:10,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:39:10,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:39:10,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:39:10,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:39:10,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:39:10,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:39:10,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:39:10,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:39:10,752 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:39:10,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:39:10,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:39:10,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:39:10,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:39:10,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:39:10,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:39:10,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:39:10,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:39:10,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:39:10,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:39:10,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:39:10,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:39:10,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:39:10,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:39:10,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:39:10,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:39:10,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:39:10,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:39:10,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:39:10,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:39:10,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:39:10,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:39:10,816 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:39:10,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:39:10,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:39:10,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:39:10,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:39:10,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:39:10,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:39:10,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:39:10,819 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:39:10,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:39:10,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:39:10,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:39:10,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:39:10,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:39:10,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:39:10,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:39:10,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:39:10,829 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:39:10,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:39:10,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:39:10,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:39:10,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:39:10,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:39:10,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:39:10,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:39:10,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:39:10,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:39:10,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:39:10,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:39:10,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:39:10,832 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:39:10,832 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:39:10,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:39:10,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c [2022-07-21 08:39:11,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:39:11,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:39:11,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:39:11,174 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:39:11,175 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:39:11,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix011.opt.i [2022-07-21 08:39:11,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d13ed6eb/1487f3aab1bc4426bd84b1df26b8f0a5/FLAG40f67bc39 [2022-07-21 08:39:11,803 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:39:11,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011.opt.i [2022-07-21 08:39:11,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d13ed6eb/1487f3aab1bc4426bd84b1df26b8f0a5/FLAG40f67bc39 [2022-07-21 08:39:12,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d13ed6eb/1487f3aab1bc4426bd84b1df26b8f0a5 [2022-07-21 08:39:12,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:39:12,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:39:12,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:39:12,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:39:12,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:39:12,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ad31e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12, skipping insertion in model container [2022-07-21 08:39:12,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:39:12,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:39:12,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011.opt.i[944,957] [2022-07-21 08:39:12,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:39:12,621 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:39:12,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011.opt.i[944,957] [2022-07-21 08:39:12,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:39:12,721 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:39:12,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12 WrapperNode [2022-07-21 08:39:12,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:39:12,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:39:12,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:39:12,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:39:12,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,796 INFO L137 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 281 [2022-07-21 08:39:12,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:39:12,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:39:12,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:39:12,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:39:12,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:39:12,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:39:12,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:39:12,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:39:12,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (1/1) ... [2022-07-21 08:39:12,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:39:12,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:39:12,877 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-07-21 08:39:12,881 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-07-21 08:39:12,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:39:12,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:39:12,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:39:12,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:39:12,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:39:12,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:39:12,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:39:12,916 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:39:12,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:39:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-21 08:39:12,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-21 08:39:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:39:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:39:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:39:12,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:39:12,919 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:39:13,096 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:39:13,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:39:13,632 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:39:14,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:39:14,029 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:39:14,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:39:14 BoogieIcfgContainer [2022-07-21 08:39:14,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:39:14,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:39:14,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:39:14,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:39:14,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:39:12" (1/3) ... [2022-07-21 08:39:14,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567c5460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:39:14, skipping insertion in model container [2022-07-21 08:39:14,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:12" (2/3) ... [2022-07-21 08:39:14,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567c5460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:39:14, skipping insertion in model container [2022-07-21 08:39:14,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:39:14" (3/3) ... [2022-07-21 08:39:14,041 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2022-07-21 08:39:14,046 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:39:14,055 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:39:14,055 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:39:14,055 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:39:14,133 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:39:14,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-07-21 08:39:14,243 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2022-07-21 08:39:14,244 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:39:14,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-07-21 08:39:14,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-07-21 08:39:14,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-07-21 08:39:14,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:39:14,269 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=true, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ea5d9ef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6baf4f53 [2022-07-21 08:39:14,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-21 08:39:14,283 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2022-07-21 08:39:14,283 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:39:14,283 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:14,284 INFO L200 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] [2022-07-21 08:39:14,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash 199347532, now seen corresponding path program 1 times [2022-07-21 08:39:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:14,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38054794] [2022-07-21 08:39:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:14,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38054794] [2022-07-21 08:39:14,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38054794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:14,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:14,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:39:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979347786] [2022-07-21 08:39:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:14,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:39:14,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:14,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:39:14,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:39:14,685 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 119 [2022-07-21 08:39:14,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-07-21 08:39:14,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:14,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 119 [2022-07-21 08:39:14,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:14,853 INFO L129 PetriNetUnfolder]: 14/193 cut-off events. [2022-07-21 08:39:14,853 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-21 08:39:14,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 193 events. 14/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs, 6 based on Foata normal form. 6/189 useless extension candidates. Maximal degree in co-relation 185. Up to 25 conditions per place. [2022-07-21 08:39:14,858 INFO L132 encePairwiseOnDemand]: 114/119 looper letters, 9 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2022-07-21 08:39:14,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 259 flow [2022-07-21 08:39:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:39:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:39:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-07-21 08:39:14,877 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9355742296918768 [2022-07-21 08:39:14,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-07-21 08:39:14,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-07-21 08:39:14,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:14,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-07-21 08:39:14,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-07-21 08:39:14,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-07-21 08:39:14,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-07-21 08:39:14,899 INFO L186 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 334 transitions. [2022-07-21 08:39:14,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 259 flow [2022-07-21 08:39:14,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 114 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 08:39:14,908 INFO L242 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2022-07-21 08:39:14,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2022-07-21 08:39:14,913 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2022-07-21 08:39:14,914 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2022-07-21 08:39:14,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-07-21 08:39:14,915 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:14,915 INFO L200 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] [2022-07-21 08:39:14,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:39:14,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1017206924, now seen corresponding path program 1 times [2022-07-21 08:39:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:14,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902017669] [2022-07-21 08:39:14,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:14,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:15,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902017669] [2022-07-21 08:39:15,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902017669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:15,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:15,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:39:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174055154] [2022-07-21 08:39:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:15,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:39:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:15,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:39:15,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:39:15,176 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-07-21 08:39:15,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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-07-21 08:39:15,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:15,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-07-21 08:39:15,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:16,121 INFO L129 PetriNetUnfolder]: 1259/3680 cut-off events. [2022-07-21 08:39:16,122 INFO L130 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-07-21 08:39:16,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5851 conditions, 3680 events. 1259/3680 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 32675 event pairs, 340 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 5792. Up to 874 conditions per place. [2022-07-21 08:39:16,148 INFO L132 encePairwiseOnDemand]: 104/119 looper letters, 26 selfloop transitions, 11 changer transitions 70/184 dead transitions. [2022-07-21 08:39:16,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 184 transitions, 586 flow [2022-07-21 08:39:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:39:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:39:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 917 transitions. [2022-07-21 08:39:16,154 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8562091503267973 [2022-07-21 08:39:16,154 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 917 transitions. [2022-07-21 08:39:16,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 917 transitions. [2022-07-21 08:39:16,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:16,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 917 transitions. [2022-07-21 08:39:16,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.88888888888889) internal successors, (917), 9 states have internal predecessors, (917), 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-07-21 08:39:16,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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-07-21 08:39:16,164 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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-07-21 08:39:16,164 INFO L186 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 9 states and 917 transitions. [2022-07-21 08:39:16,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 184 transitions, 586 flow [2022-07-21 08:39:16,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 184 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:39:16,171 INFO L242 Difference]: Finished difference. Result has 135 places, 106 transitions, 324 flow [2022-07-21 08:39:16,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=324, PETRI_PLACES=135, PETRI_TRANSITIONS=106} [2022-07-21 08:39:16,172 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2022-07-21 08:39:16,172 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 106 transitions, 324 flow [2022-07-21 08:39:16,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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-07-21 08:39:16,173 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:16,173 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:39:16,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:39:16,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1813989683, now seen corresponding path program 1 times [2022-07-21 08:39:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:16,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358375409] [2022-07-21 08:39:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:16,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:16,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358375409] [2022-07-21 08:39:16,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358375409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:16,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:16,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:39:16,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057564507] [2022-07-21 08:39:16,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:16,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:39:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:16,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:39:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:39:16,392 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-07-21 08:39:16,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 106 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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-07-21 08:39:16,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:16,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-07-21 08:39:16,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:17,114 INFO L129 PetriNetUnfolder]: 767/1910 cut-off events. [2022-07-21 08:39:17,114 INFO L130 PetriNetUnfolder]: For 2895/2895 co-relation queries the response was YES. [2022-07-21 08:39:17,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5702 conditions, 1910 events. 767/1910 cut-off events. For 2895/2895 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13603 event pairs, 94 based on Foata normal form. 54/1919 useless extension candidates. Maximal degree in co-relation 5627. Up to 554 conditions per place. [2022-07-21 08:39:17,158 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 39 selfloop transitions, 7 changer transitions 76/199 dead transitions. [2022-07-21 08:39:17,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 199 transitions, 1100 flow [2022-07-21 08:39:17,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:39:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:39:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1291 transitions. [2022-07-21 08:39:17,163 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8345184227537169 [2022-07-21 08:39:17,163 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1291 transitions. [2022-07-21 08:39:17,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1291 transitions. [2022-07-21 08:39:17,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:17,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1291 transitions. [2022-07-21 08:39:17,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.3076923076923) internal successors, (1291), 13 states have internal predecessors, (1291), 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-07-21 08:39:17,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-07-21 08:39:17,172 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-07-21 08:39:17,172 INFO L186 Difference]: Start difference. First operand has 135 places, 106 transitions, 324 flow. Second operand 13 states and 1291 transitions. [2022-07-21 08:39:17,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 199 transitions, 1100 flow [2022-07-21 08:39:17,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 199 transitions, 994 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-07-21 08:39:17,186 INFO L242 Difference]: Finished difference. Result has 139 places, 109 transitions, 380 flow [2022-07-21 08:39:17,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=380, PETRI_PLACES=139, PETRI_TRANSITIONS=109} [2022-07-21 08:39:17,187 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 15 predicate places. [2022-07-21 08:39:17,187 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 380 flow [2022-07-21 08:39:17,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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-07-21 08:39:17,188 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:17,188 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:39:17,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:39:17,189 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash -489566786, now seen corresponding path program 1 times [2022-07-21 08:39:17,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:17,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376545171] [2022-07-21 08:39:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:17,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:17,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:17,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376545171] [2022-07-21 08:39:17,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376545171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:17,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:17,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:39:17,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646180078] [2022-07-21 08:39:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:17,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:39:17,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:17,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:39:17,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:39:17,322 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-07-21 08:39:17,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 109 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-07-21 08:39:17,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:17,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-07-21 08:39:17,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:17,853 INFO L129 PetriNetUnfolder]: 477/1344 cut-off events. [2022-07-21 08:39:17,853 INFO L130 PetriNetUnfolder]: For 3371/3371 co-relation queries the response was YES. [2022-07-21 08:39:17,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 1344 events. 477/1344 cut-off events. For 3371/3371 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8968 event pairs, 108 based on Foata normal form. 30/1328 useless extension candidates. Maximal degree in co-relation 4227. Up to 346 conditions per place. [2022-07-21 08:39:17,866 INFO L132 encePairwiseOnDemand]: 106/119 looper letters, 33 selfloop transitions, 13 changer transitions 49/172 dead transitions. [2022-07-21 08:39:17,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 172 transitions, 1026 flow [2022-07-21 08:39:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:39:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:39:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1267 transitions. [2022-07-21 08:39:17,870 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8190045248868778 [2022-07-21 08:39:17,870 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1267 transitions. [2022-07-21 08:39:17,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1267 transitions. [2022-07-21 08:39:17,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:17,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1267 transitions. [2022-07-21 08:39:17,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.46153846153847) internal successors, (1267), 13 states have internal predecessors, (1267), 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-07-21 08:39:17,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-07-21 08:39:17,877 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-07-21 08:39:17,877 INFO L186 Difference]: Start difference. First operand has 139 places, 109 transitions, 380 flow. Second operand 13 states and 1267 transitions. [2022-07-21 08:39:17,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 172 transitions, 1026 flow [2022-07-21 08:39:17,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 172 transitions, 941 flow, removed 40 selfloop flow, removed 7 redundant places. [2022-07-21 08:39:17,893 INFO L242 Difference]: Finished difference. Result has 147 places, 114 transitions, 484 flow [2022-07-21 08:39:17,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=484, PETRI_PLACES=147, PETRI_TRANSITIONS=114} [2022-07-21 08:39:17,895 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 23 predicate places. [2022-07-21 08:39:17,895 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 114 transitions, 484 flow [2022-07-21 08:39:17,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-07-21 08:39:17,896 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:17,896 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:39:17,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:39:17,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1130365692, now seen corresponding path program 1 times [2022-07-21 08:39:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:17,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888445199] [2022-07-21 08:39:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:18,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:18,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888445199] [2022-07-21 08:39:18,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888445199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:18,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:18,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:39:18,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506209250] [2022-07-21 08:39:18,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:18,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:39:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:18,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:39:18,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:39:18,056 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-07-21 08:39:18,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 114 transitions, 484 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-07-21 08:39:18,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:18,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-07-21 08:39:18,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:18,902 INFO L129 PetriNetUnfolder]: 1801/3671 cut-off events. [2022-07-21 08:39:18,903 INFO L130 PetriNetUnfolder]: For 11270/12714 co-relation queries the response was YES. [2022-07-21 08:39:18,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10491 conditions, 3671 events. 1801/3671 cut-off events. For 11270/12714 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 27992 event pairs, 102 based on Foata normal form. 47/3447 useless extension candidates. Maximal degree in co-relation 10432. Up to 1056 conditions per place. [2022-07-21 08:39:18,936 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 56 selfloop transitions, 13 changer transitions 42/202 dead transitions. [2022-07-21 08:39:18,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 202 transitions, 1348 flow [2022-07-21 08:39:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:39:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:39:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions. [2022-07-21 08:39:18,940 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8747899159663866 [2022-07-21 08:39:18,940 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1041 transitions. [2022-07-21 08:39:18,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1041 transitions. [2022-07-21 08:39:18,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:18,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1041 transitions. [2022-07-21 08:39:18,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 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-07-21 08:39:18,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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-07-21 08:39:18,946 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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-07-21 08:39:18,946 INFO L186 Difference]: Start difference. First operand has 147 places, 114 transitions, 484 flow. Second operand 10 states and 1041 transitions. [2022-07-21 08:39:18,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 202 transitions, 1348 flow [2022-07-21 08:39:18,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 202 transitions, 1255 flow, removed 34 selfloop flow, removed 10 redundant places. [2022-07-21 08:39:18,964 INFO L242 Difference]: Finished difference. Result has 143 places, 125 transitions, 538 flow [2022-07-21 08:39:18,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=538, PETRI_PLACES=143, PETRI_TRANSITIONS=125} [2022-07-21 08:39:18,965 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 19 predicate places. [2022-07-21 08:39:18,966 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 125 transitions, 538 flow [2022-07-21 08:39:18,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-07-21 08:39:18,966 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:18,966 INFO L200 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] [2022-07-21 08:39:18,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:39:18,967 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash 898542617, now seen corresponding path program 1 times [2022-07-21 08:39:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:18,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128025574] [2022-07-21 08:39:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:19,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:19,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128025574] [2022-07-21 08:39:19,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128025574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:19,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:19,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:39:19,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707518129] [2022-07-21 08:39:19,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:19,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:39:19,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:39:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:39:19,182 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-07-21 08:39:19,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 125 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 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-07-21 08:39:19,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:19,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-07-21 08:39:19,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:20,128 INFO L129 PetriNetUnfolder]: 1548/3376 cut-off events. [2022-07-21 08:39:20,128 INFO L130 PetriNetUnfolder]: For 11071/12611 co-relation queries the response was YES. [2022-07-21 08:39:20,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12169 conditions, 3376 events. 1548/3376 cut-off events. For 11071/12611 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27587 event pairs, 55 based on Foata normal form. 188/3393 useless extension candidates. Maximal degree in co-relation 12080. Up to 661 conditions per place. [2022-07-21 08:39:20,164 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 64 selfloop transitions, 26 changer transitions 52/233 dead transitions. [2022-07-21 08:39:20,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 233 transitions, 1683 flow [2022-07-21 08:39:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:39:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:39:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1352 transitions. [2022-07-21 08:39:20,168 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8739495798319328 [2022-07-21 08:39:20,168 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1352 transitions. [2022-07-21 08:39:20,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1352 transitions. [2022-07-21 08:39:20,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:20,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1352 transitions. [2022-07-21 08:39:20,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.0) internal successors, (1352), 13 states have internal predecessors, (1352), 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-07-21 08:39:20,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-07-21 08:39:20,175 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-07-21 08:39:20,175 INFO L186 Difference]: Start difference. First operand has 143 places, 125 transitions, 538 flow. Second operand 13 states and 1352 transitions. [2022-07-21 08:39:20,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 233 transitions, 1683 flow [2022-07-21 08:39:20,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 233 transitions, 1639 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-07-21 08:39:20,206 INFO L242 Difference]: Finished difference. Result has 152 places, 143 transitions, 741 flow [2022-07-21 08:39:20,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=741, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2022-07-21 08:39:20,207 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 28 predicate places. [2022-07-21 08:39:20,207 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 741 flow [2022-07-21 08:39:20,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 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-07-21 08:39:20,208 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:20,208 INFO L200 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-07-21 08:39:20,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:39:20,208 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:20,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2011034679, now seen corresponding path program 1 times [2022-07-21 08:39:20,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:20,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052976920] [2022-07-21 08:39:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:20,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:20,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052976920] [2022-07-21 08:39:20,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052976920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:20,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:20,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:39:20,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743771587] [2022-07-21 08:39:20,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:20,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:39:20,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:20,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:39:20,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:39:20,415 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-07-21 08:39:20,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 741 flow. Second operand has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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-07-21 08:39:20,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:20,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-07-21 08:39:20,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:21,245 INFO L129 PetriNetUnfolder]: 1410/3225 cut-off events. [2022-07-21 08:39:21,245 INFO L130 PetriNetUnfolder]: For 12946/14505 co-relation queries the response was YES. [2022-07-21 08:39:21,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12723 conditions, 3225 events. 1410/3225 cut-off events. For 12946/14505 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 27363 event pairs, 51 based on Foata normal form. 152/3209 useless extension candidates. Maximal degree in co-relation 12634. Up to 594 conditions per place. [2022-07-21 08:39:21,281 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 54 selfloop transitions, 30 changer transitions 52/227 dead transitions. [2022-07-21 08:39:21,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 227 transitions, 1674 flow [2022-07-21 08:39:21,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:39:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-21 08:39:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1631 transitions. [2022-07-21 08:39:21,286 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8566176470588235 [2022-07-21 08:39:21,286 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1631 transitions. [2022-07-21 08:39:21,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1631 transitions. [2022-07-21 08:39:21,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:21,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1631 transitions. [2022-07-21 08:39:21,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.9375) internal successors, (1631), 16 states have internal predecessors, (1631), 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-07-21 08:39:21,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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-07-21 08:39:21,345 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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-07-21 08:39:21,345 INFO L186 Difference]: Start difference. First operand has 152 places, 143 transitions, 741 flow. Second operand 16 states and 1631 transitions. [2022-07-21 08:39:21,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 227 transitions, 1674 flow [2022-07-21 08:39:21,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 227 transitions, 1495 flow, removed 65 selfloop flow, removed 8 redundant places. [2022-07-21 08:39:21,464 INFO L242 Difference]: Finished difference. Result has 166 places, 143 transitions, 717 flow [2022-07-21 08:39:21,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=717, PETRI_PLACES=166, PETRI_TRANSITIONS=143} [2022-07-21 08:39:21,465 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 42 predicate places. [2022-07-21 08:39:21,466 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 143 transitions, 717 flow [2022-07-21 08:39:21,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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-07-21 08:39:21,466 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:21,467 INFO L200 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] [2022-07-21 08:39:21,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:39:21,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash -426181159, now seen corresponding path program 1 times [2022-07-21 08:39:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:21,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709608726] [2022-07-21 08:39:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:21,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:21,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709608726] [2022-07-21 08:39:21,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709608726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:21,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:21,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:39:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732010736] [2022-07-21 08:39:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:21,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:39:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:39:21,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:39:21,609 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 119 [2022-07-21 08:39:21,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 143 transitions, 717 flow. Second operand has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 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-07-21 08:39:21,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:21,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 119 [2022-07-21 08:39:21,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:21,953 INFO L129 PetriNetUnfolder]: 356/1842 cut-off events. [2022-07-21 08:39:21,953 INFO L130 PetriNetUnfolder]: For 3557/3616 co-relation queries the response was YES. [2022-07-21 08:39:21,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5298 conditions, 1842 events. 356/1842 cut-off events. For 3557/3616 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18735 event pairs, 22 based on Foata normal form. 1/1745 useless extension candidates. Maximal degree in co-relation 5220. Up to 191 conditions per place. [2022-07-21 08:39:21,975 INFO L132 encePairwiseOnDemand]: 103/119 looper letters, 36 selfloop transitions, 25 changer transitions 5/170 dead transitions. [2022-07-21 08:39:21,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 170 transitions, 1011 flow [2022-07-21 08:39:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:39:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 08:39:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 766 transitions. [2022-07-21 08:39:21,977 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8046218487394958 [2022-07-21 08:39:21,978 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 766 transitions. [2022-07-21 08:39:21,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 766 transitions. [2022-07-21 08:39:21,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:21,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 766 transitions. [2022-07-21 08:39:21,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 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-07-21 08:39:21,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 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-07-21 08:39:21,982 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 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-07-21 08:39:21,982 INFO L186 Difference]: Start difference. First operand has 166 places, 143 transitions, 717 flow. Second operand 8 states and 766 transitions. [2022-07-21 08:39:21,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 170 transitions, 1011 flow [2022-07-21 08:39:22,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 170 transitions, 885 flow, removed 43 selfloop flow, removed 14 redundant places. [2022-07-21 08:39:22,034 INFO L242 Difference]: Finished difference. Result has 161 places, 152 transitions, 799 flow [2022-07-21 08:39:22,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=799, PETRI_PLACES=161, PETRI_TRANSITIONS=152} [2022-07-21 08:39:22,035 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 37 predicate places. [2022-07-21 08:39:22,035 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 152 transitions, 799 flow [2022-07-21 08:39:22,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 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-07-21 08:39:22,036 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:22,036 INFO L200 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] [2022-07-21 08:39:22,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:39:22,036 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:22,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:22,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1661255229, now seen corresponding path program 2 times [2022-07-21 08:39:22,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:22,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854607340] [2022-07-21 08:39:22,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:22,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:22,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854607340] [2022-07-21 08:39:22,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854607340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:22,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:22,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:39:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527252421] [2022-07-21 08:39:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:22,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:39:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:39:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:39:22,172 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-07-21 08:39:22,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 152 transitions, 799 flow. Second operand has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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-07-21 08:39:22,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:22,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-07-21 08:39:22,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:22,591 INFO L129 PetriNetUnfolder]: 477/2435 cut-off events. [2022-07-21 08:39:22,591 INFO L130 PetriNetUnfolder]: For 3283/3457 co-relation queries the response was YES. [2022-07-21 08:39:22,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6579 conditions, 2435 events. 477/2435 cut-off events. For 3283/3457 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 27176 event pairs, 17 based on Foata normal form. 3/2297 useless extension candidates. Maximal degree in co-relation 6551. Up to 314 conditions per place. [2022-07-21 08:39:22,610 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 20 selfloop transitions, 1 changer transitions 30/166 dead transitions. [2022-07-21 08:39:22,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 166 transitions, 949 flow [2022-07-21 08:39:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:39:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 08:39:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2022-07-21 08:39:22,612 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8463385354141657 [2022-07-21 08:39:22,612 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2022-07-21 08:39:22,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2022-07-21 08:39:22,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:22,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2022-07-21 08:39:22,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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-07-21 08:39:22,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-07-21 08:39:22,616 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-07-21 08:39:22,617 INFO L186 Difference]: Start difference. First operand has 161 places, 152 transitions, 799 flow. Second operand 7 states and 705 transitions. [2022-07-21 08:39:22,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 166 transitions, 949 flow [2022-07-21 08:39:22,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 166 transitions, 937 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-07-21 08:39:22,666 INFO L242 Difference]: Finished difference. Result has 165 places, 135 transitions, 622 flow [2022-07-21 08:39:22,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=622, PETRI_PLACES=165, PETRI_TRANSITIONS=135} [2022-07-21 08:39:22,667 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 41 predicate places. [2022-07-21 08:39:22,667 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 135 transitions, 622 flow [2022-07-21 08:39:22,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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-07-21 08:39:22,668 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:22,668 INFO L200 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] [2022-07-21 08:39:22,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:39:22,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:22,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash 707400281, now seen corresponding path program 3 times [2022-07-21 08:39:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:22,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755439434] [2022-07-21 08:39:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:39:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:22,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755439434] [2022-07-21 08:39:22,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755439434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:22,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:22,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:39:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645335074] [2022-07-21 08:39:22,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:22,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:39:22,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:39:22,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:39:22,798 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 119 [2022-07-21 08:39:22,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 135 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 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-07-21 08:39:22,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:22,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 119 [2022-07-21 08:39:22,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:23,046 INFO L129 PetriNetUnfolder]: 217/1252 cut-off events. [2022-07-21 08:39:23,046 INFO L130 PetriNetUnfolder]: For 1648/1663 co-relation queries the response was YES. [2022-07-21 08:39:23,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1252 events. 217/1252 cut-off events. For 1648/1663 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 12231 event pairs, 11 based on Foata normal form. 1/1195 useless extension candidates. Maximal degree in co-relation 3293. Up to 155 conditions per place. [2022-07-21 08:39:23,057 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 16 selfloop transitions, 2 changer transitions 14/142 dead transitions. [2022-07-21 08:39:23,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 142 transitions, 708 flow [2022-07-21 08:39:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:39:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-21 08:39:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions. [2022-07-21 08:39:23,059 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8515406162464986 [2022-07-21 08:39:23,059 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 608 transitions. [2022-07-21 08:39:23,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions. [2022-07-21 08:39:23,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:23,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions. [2022-07-21 08:39:23,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 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-07-21 08:39:23,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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-07-21 08:39:23,063 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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-07-21 08:39:23,064 INFO L186 Difference]: Start difference. First operand has 165 places, 135 transitions, 622 flow. Second operand 6 states and 608 transitions. [2022-07-21 08:39:23,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 142 transitions, 708 flow [2022-07-21 08:39:23,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 142 transitions, 639 flow, removed 13 selfloop flow, removed 11 redundant places. [2022-07-21 08:39:23,086 INFO L242 Difference]: Finished difference. Result has 159 places, 127 transitions, 519 flow [2022-07-21 08:39:23,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=159, PETRI_TRANSITIONS=127} [2022-07-21 08:39:23,088 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 35 predicate places. [2022-07-21 08:39:23,088 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 127 transitions, 519 flow [2022-07-21 08:39:23,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 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-07-21 08:39:23,088 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:23,089 INFO L200 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] [2022-07-21 08:39:23,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:39:23,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:39:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1020935007, now seen corresponding path program 4 times [2022-07-21 08:39:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:23,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22762254] [2022-07-21 08:39:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:23,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:39:23,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:39:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:39:23,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:39:23,299 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:39:23,300 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-21 08:39:23,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-21 08:39:23,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-21 08:39:23,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-21 08:39:23,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-21 08:39:23,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-21 08:39:23,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:39:23,304 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:39:23,310 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:39:23,310 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:39:23,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:39:23 BasicIcfg [2022-07-21 08:39:23,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:39:23,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:39:23,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:39:23,505 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:39:23,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:39:14" (3/4) ... [2022-07-21 08:39:23,507 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:39:23,648 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:39:23,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:39:23,650 INFO L158 Benchmark]: Toolchain (without parser) took 11394.68ms. Allocated memory was 56.6MB in the beginning and 962.6MB in the end (delta: 906.0MB). Free memory was 33.3MB in the beginning and 518.3MB in the end (delta: -485.0MB). Peak memory consumption was 420.4MB. Max. memory is 16.1GB. [2022-07-21 08:39:23,650 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:39:23,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.81ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 38.3MB in the end (delta: -5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 08:39:23,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.04ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 50.5MB in the end (delta: -12.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-21 08:39:23,651 INFO L158 Benchmark]: Boogie Preprocessor took 35.30ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 48.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:39:23,651 INFO L158 Benchmark]: RCFGBuilder took 1198.99ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 52.3kB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-07-21 08:39:23,652 INFO L158 Benchmark]: TraceAbstraction took 9470.15ms. Allocated memory was 92.3MB in the beginning and 962.6MB in the end (delta: 870.3MB). Free memory was 47.4MB in the beginning and 558.2MB in the end (delta: -510.8MB). Peak memory consumption was 359.1MB. Max. memory is 16.1GB. [2022-07-21 08:39:23,652 INFO L158 Benchmark]: Witness Printer took 143.69ms. Allocated memory is still 962.6MB. Free memory was 558.2MB in the beginning and 518.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-07-21 08:39:23,654 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.22ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.81ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 38.3MB in the end (delta: -5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.04ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 50.5MB in the end (delta: -12.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.30ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 48.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1198.99ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 52.3kB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9470.15ms. Allocated memory was 92.3MB in the beginning and 962.6MB in the end (delta: 870.3MB). Free memory was 47.4MB in the beginning and 558.2MB in the end (delta: -510.8MB). Peak memory consumption was 359.1MB. Max. memory is 16.1GB. * Witness Printer took 143.69ms. Allocated memory is still 962.6MB. Free memory was 558.2MB in the beginning and 518.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L728] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L729] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L730] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L731] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L732] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L733] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L739] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L740] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L741] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L742] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L743] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 0 pthread_t t284; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t284, ((void *)0), P0, ((void *)0))=7, t284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 pthread_t t285; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t284={5:0}, t285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t285, ((void *)0), P1, ((void *)0))=8, t284={5:0}, t285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L855] 0 pthread_t t286; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t286, ((void *)0), P2, ((void *)0))=9, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 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) [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L814] 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) [L814] 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) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 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)) [L817] 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)) [L818] 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)) [L818] 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)) [L819] 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)) [L819] 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)) [L820] 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)) [L820] 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)) [L821] 3 __unbuffered_p2_EAX = z [L822] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L826] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L764] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L778] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L778] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L779] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L780] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L780] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L782] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L783] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=50, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=50, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=50, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L829] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 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) [L862] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L862] 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) [L862] 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) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 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 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 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 [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 856]: 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: 852]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 545 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 922 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1125 IncrementalHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 125 mSDtfsCounter, 1125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=8, InterpolantAutomatonStates: 98, 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, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 930 NumberOfCodeBlocks, 930 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 3393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 08:39:23,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE