./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF --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 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:19:11,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:19:11,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:19:11,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:19:11,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:19:11,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:19:11,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:19:11,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:19:11,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:19:11,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:19:11,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:19:11,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:19:11,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:19:11,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:19:11,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:19:11,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:19:11,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:19:11,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:19:11,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:19:11,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:19:11,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:19:11,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:19:11,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:19:11,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:19:11,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:19:11,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:19:11,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:19:11,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:19:11,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:19:11,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:19:11,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:19:11,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:19:11,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:19:11,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:19:11,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:19:11,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:19:11,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:19:11,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:19:11,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:19:11,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:19:11,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:19:11,770 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:19:11,810 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:19:11,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:19:11,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:19:11,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:19:11,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:19:11,819 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:19:11,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:19:11,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:19:11,820 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:19:11,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:19:11,821 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:19:11,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:19:11,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:19:11,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:19:11,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:19:11,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:19:11,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:19:11,823 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:19:11,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:19:11,823 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:19:11,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:19:11,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:19:11,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:19:11,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:19:11,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:19:11,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:19:11,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:19:11,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:19:11,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:19:11,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:19:11,827 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:19:11,827 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:19:11,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:19:11,828 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:19:11,828 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF 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 -> 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b [2021-11-20 07:19:12,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:19:12,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:19:12,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:19:12,133 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:19:12,134 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:19:12,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2021-11-20 07:19:12,199 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/data/6b4f1eea8/34421b8f0e65452cb6db07964cd04119/FLAGe41274d5c [2021-11-20 07:19:12,831 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:19:12,832 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2021-11-20 07:19:12,864 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/data/6b4f1eea8/34421b8f0e65452cb6db07964cd04119/FLAGe41274d5c [2021-11-20 07:19:13,077 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/data/6b4f1eea8/34421b8f0e65452cb6db07964cd04119 [2021-11-20 07:19:13,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:19:13,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:19:13,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:19:13,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:19:13,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:19:13,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d489c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13, skipping insertion in model container [2021-11-20 07:19:13,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:19:13,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:19:13,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/sv-benchmarks/c/pthread-wmm/mix010.oepc.i[945,958] [2021-11-20 07:19:13,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:19:13,663 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:19:13,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/sv-benchmarks/c/pthread-wmm/mix010.oepc.i[945,958] [2021-11-20 07:19:13,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:19:13,791 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:19:13,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13 WrapperNode [2021-11-20 07:19:13,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:19:13,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:19:13,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:19:13,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:19:13,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,859 INFO L137 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2021-11-20 07:19:13,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:19:13,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:19:13,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:19:13,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:19:13,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:19:13,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:19:13,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:19:13,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:19:13,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (1/1) ... [2021-11-20 07:19:13,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:19:13,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:19:13,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:19:13,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:19:14,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 07:19:14,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-20 07:19:14,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:19:14,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:19:14,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:19:14,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-20 07:19:14,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-20 07:19:14,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-20 07:19:14,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-20 07:19:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-20 07:19:14,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-20 07:19:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:19:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-20 07:19:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:19:14,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:19:14,015 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 07:19:14,149 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:19:14,150 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:19:14,707 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:19:15,110 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:19:15,110 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 07:19:15,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:19:15 BoogieIcfgContainer [2021-11-20 07:19:15,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:19:15,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:19:15,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:19:15,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:19:15,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:19:13" (1/3) ... [2021-11-20 07:19:15,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26958a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:19:15, skipping insertion in model container [2021-11-20 07:19:15,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:13" (2/3) ... [2021-11-20 07:19:15,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26958a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:19:15, skipping insertion in model container [2021-11-20 07:19:15,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:19:15" (3/3) ... [2021-11-20 07:19:15,123 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2021-11-20 07:19:15,129 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 07:19:15,130 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:19:15,130 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-20 07:19:15,130 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 07:19:15,181 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,182 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,182 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,182 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,182 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,183 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,183 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,183 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,184 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,184 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,185 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,185 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,185 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,186 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,186 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,186 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,186 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,187 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,187 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,188 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,188 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,190 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,190 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,190 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,190 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,191 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,191 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,191 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,192 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,192 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,193 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,193 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,193 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,194 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,194 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,194 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,194 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,194 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,195 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,195 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,195 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,195 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,196 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,196 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,196 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,197 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,197 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,197 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,197 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,197 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,197 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,198 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,198 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,198 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,199 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,199 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,200 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,201 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,201 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,201 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,202 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,202 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,203 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,203 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,203 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,203 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,203 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,204 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,204 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,204 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,204 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,205 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,217 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,217 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,217 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,217 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,217 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,217 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,222 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,222 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,222 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,222 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,223 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,223 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,223 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,223 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,223 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,223 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,224 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,224 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,224 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,224 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,224 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,224 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,225 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,225 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,225 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,225 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,225 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,225 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,228 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,230 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,231 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,231 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,231 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,232 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,232 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,234 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,234 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,234 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,234 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,234 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,235 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,235 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,235 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,235 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,241 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,241 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,241 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,241 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,242 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,242 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,242 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,242 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,242 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,243 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,244 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,244 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,244 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,244 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,244 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,245 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,245 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,245 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,245 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,245 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,245 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,246 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,246 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,246 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,246 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,246 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,247 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,247 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,247 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,247 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,248 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,248 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,248 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,248 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,248 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,250 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,252 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,255 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,255 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,256 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,256 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,256 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,256 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,256 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,256 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,257 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,257 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:19:15,259 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-20 07:19:15,318 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:19:15,328 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:19:15,328 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-20 07:19:15,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2021-11-20 07:19:15,436 INFO L129 PetriNetUnfolder]: 2/119 cut-off events. [2021-11-20 07:19:15,436 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 07:19:15,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-11-20 07:19:15,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2021-11-20 07:19:15,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2021-11-20 07:19:15,461 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-11-20 07:19:15,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 07:19:15,461 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:15,462 INFO L254 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] [2021-11-20 07:19:15,463 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -594751337, now seen corresponding path program 1 times [2021-11-20 07:19:15,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:15,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048048531] [2021-11-20 07:19:15,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:15,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:15,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:15,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048048531] [2021-11-20 07:19:15,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048048531] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:15,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:15,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:19:15,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796056668] [2021-11-20 07:19:15,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:15,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:19:15,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:15,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:19:15,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:19:15,786 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 122 [2021-11-20 07:19:15,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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) [2021-11-20 07:19:15,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:15,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 122 [2021-11-20 07:19:15,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:16,022 INFO L129 PetriNetUnfolder]: 58/283 cut-off events. [2021-11-20 07:19:16,023 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-11-20 07:19:16,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 283 events. 58/283 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1157 event pairs, 10 based on Foata normal form. 23/291 useless extension candidates. Maximal degree in co-relation 356. Up to 79 conditions per place. [2021-11-20 07:19:16,031 INFO L132 encePairwiseOnDemand]: 117/122 looper letters, 14 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2021-11-20 07:19:16,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 121 transitions, 289 flow [2021-11-20 07:19:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:19:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-20 07:19:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2021-11-20 07:19:16,047 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9426229508196722 [2021-11-20 07:19:16,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2021-11-20 07:19:16,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2021-11-20 07:19:16,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:16,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2021-11-20 07:19:16,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:19:16,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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) [2021-11-20 07:19:16,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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) [2021-11-20 07:19:16,067 INFO L186 Difference]: Start difference. First operand has 127 places, 119 transitions, 247 flow. Second operand 3 states and 345 transitions. [2021-11-20 07:19:16,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 121 transitions, 289 flow [2021-11-20 07:19:16,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 284 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-20 07:19:16,075 INFO L242 Difference]: Finished difference. Result has 124 places, 115 transitions, 240 flow [2021-11-20 07:19:16,077 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2021-11-20 07:19:16,081 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2021-11-20 07:19:16,081 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 240 flow [2021-11-20 07:19:16,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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) [2021-11-20 07:19:16,082 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:16,082 INFO L254 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] [2021-11-20 07:19:16,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:19:16,082 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1907752176, now seen corresponding path program 1 times [2021-11-20 07:19:16,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:16,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861882267] [2021-11-20 07:19:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:16,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:16,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:16,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861882267] [2021-11-20 07:19:16,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861882267] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:16,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:16,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:19:16,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925333028] [2021-11-20 07:19:16,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:16,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:19:16,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:16,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:19:16,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:19:16,497 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2021-11-20 07:19:16,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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) [2021-11-20 07:19:16,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:16,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2021-11-20 07:19:16,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:17,643 INFO L129 PetriNetUnfolder]: 1548/3917 cut-off events. [2021-11-20 07:19:17,643 INFO L130 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2021-11-20 07:19:17,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6462 conditions, 3917 events. 1548/3917 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 31748 event pairs, 231 based on Foata normal form. 0/3824 useless extension candidates. Maximal degree in co-relation 6402. Up to 1235 conditions per place. [2021-11-20 07:19:17,677 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 30 selfloop transitions, 2 changer transitions 66/177 dead transitions. [2021-11-20 07:19:17,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 177 transitions, 554 flow [2021-11-20 07:19:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:19:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 07:19:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2021-11-20 07:19:17,685 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.843351548269581 [2021-11-20 07:19:17,685 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2021-11-20 07:19:17,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2021-11-20 07:19:17,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:17,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2021-11-20 07:19:17,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.88888888888889) internal successors, (926), 9 states have internal predecessors, (926), 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) [2021-11-20 07:19:17,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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) [2021-11-20 07:19:17,698 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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) [2021-11-20 07:19:17,698 INFO L186 Difference]: Start difference. First operand has 124 places, 115 transitions, 240 flow. Second operand 9 states and 926 transitions. [2021-11-20 07:19:17,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 177 transitions, 554 flow [2021-11-20 07:19:17,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 177 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-20 07:19:17,707 INFO L242 Difference]: Finished difference. Result has 137 places, 103 transitions, 232 flow [2021-11-20 07:19:17,707 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=137, PETRI_TRANSITIONS=103} [2021-11-20 07:19:17,709 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 10 predicate places. [2021-11-20 07:19:17,709 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 103 transitions, 232 flow [2021-11-20 07:19:17,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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) [2021-11-20 07:19:17,710 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:17,710 INFO L254 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] [2021-11-20 07:19:17,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:19:17,710 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1979965074, now seen corresponding path program 1 times [2021-11-20 07:19:17,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:17,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569890336] [2021-11-20 07:19:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:17,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:17,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:17,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569890336] [2021-11-20 07:19:17,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569890336] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:17,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:17,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:19:17,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413433037] [2021-11-20 07:19:17,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:17,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:19:17,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:17,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:19:17,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:19:17,977 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2021-11-20 07:19:17,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 103 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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) [2021-11-20 07:19:17,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:17,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2021-11-20 07:19:17,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:18,448 INFO L129 PetriNetUnfolder]: 409/865 cut-off events. [2021-11-20 07:19:18,448 INFO L130 PetriNetUnfolder]: For 228/228 co-relation queries the response was YES. [2021-11-20 07:19:18,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 865 events. 409/865 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4379 event pairs, 90 based on Foata normal form. 24/867 useless extension candidates. Maximal degree in co-relation 1717. Up to 352 conditions per place. [2021-11-20 07:19:18,456 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 19 selfloop transitions, 2 changer transitions 34/141 dead transitions. [2021-11-20 07:19:18,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 141 transitions, 436 flow [2021-11-20 07:19:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:19:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 07:19:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 957 transitions. [2021-11-20 07:19:18,461 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8715846994535519 [2021-11-20 07:19:18,461 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 957 transitions. [2021-11-20 07:19:18,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 957 transitions. [2021-11-20 07:19:18,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:18,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 957 transitions. [2021-11-20 07:19:18,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.33333333333333) internal successors, (957), 9 states have internal predecessors, (957), 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) [2021-11-20 07:19:18,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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) [2021-11-20 07:19:18,470 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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) [2021-11-20 07:19:18,470 INFO L186 Difference]: Start difference. First operand has 137 places, 103 transitions, 232 flow. Second operand 9 states and 957 transitions. [2021-11-20 07:19:18,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 141 transitions, 436 flow [2021-11-20 07:19:18,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 141 transitions, 404 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-11-20 07:19:18,487 INFO L242 Difference]: Finished difference. Result has 126 places, 103 transitions, 236 flow [2021-11-20 07:19:18,488 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=126, PETRI_TRANSITIONS=103} [2021-11-20 07:19:18,490 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -1 predicate places. [2021-11-20 07:19:18,490 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 103 transitions, 236 flow [2021-11-20 07:19:18,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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) [2021-11-20 07:19:18,492 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:18,492 INFO L254 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] [2021-11-20 07:19:18,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:19:18,493 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash -973130979, now seen corresponding path program 1 times [2021-11-20 07:19:18,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:18,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009920788] [2021-11-20 07:19:18,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:18,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:18,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:18,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009920788] [2021-11-20 07:19:18,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009920788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:18,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:18,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:19:18,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693217591] [2021-11-20 07:19:18,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:18,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:19:18,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:18,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:19:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:19:18,662 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2021-11-20 07:19:18,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 103 transitions, 236 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) [2021-11-20 07:19:18,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:18,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2021-11-20 07:19:18,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:19,315 INFO L129 PetriNetUnfolder]: 917/1963 cut-off events. [2021-11-20 07:19:19,315 INFO L130 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2021-11-20 07:19:19,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1963 events. 917/1963 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13306 event pairs, 67 based on Foata normal form. 0/1922 useless extension candidates. Maximal degree in co-relation 3624. Up to 481 conditions per place. [2021-11-20 07:19:19,331 INFO L132 encePairwiseOnDemand]: 112/122 looper letters, 31 selfloop transitions, 6 changer transitions 50/170 dead transitions. [2021-11-20 07:19:19,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 170 transitions, 548 flow [2021-11-20 07:19:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:19:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-20 07:19:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1069 transitions. [2021-11-20 07:19:19,337 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8762295081967213 [2021-11-20 07:19:19,337 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1069 transitions. [2021-11-20 07:19:19,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1069 transitions. [2021-11-20 07:19:19,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:19,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1069 transitions. [2021-11-20 07:19:19,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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) [2021-11-20 07:19:19,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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) [2021-11-20 07:19:19,347 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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) [2021-11-20 07:19:19,347 INFO L186 Difference]: Start difference. First operand has 126 places, 103 transitions, 236 flow. Second operand 10 states and 1069 transitions. [2021-11-20 07:19:19,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 170 transitions, 548 flow [2021-11-20 07:19:19,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 170 transitions, 532 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-11-20 07:19:19,359 INFO L242 Difference]: Finished difference. Result has 127 places, 105 transitions, 274 flow [2021-11-20 07:19:19,359 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2021-11-20 07:19:19,361 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2021-11-20 07:19:19,361 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 274 flow [2021-11-20 07:19:19,362 INFO L471 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) [2021-11-20 07:19:19,362 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:19,362 INFO L254 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] [2021-11-20 07:19:19,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:19:19,364 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash 8228587, now seen corresponding path program 1 times [2021-11-20 07:19:19,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:19,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644487239] [2021-11-20 07:19:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:19,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:19,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:19,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644487239] [2021-11-20 07:19:19,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644487239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:19,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:19,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:19:19,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528031163] [2021-11-20 07:19:19,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:19,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:19:19,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:19,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:19:19,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:19:19,598 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2021-11-20 07:19:19,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 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) [2021-11-20 07:19:19,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:19,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2021-11-20 07:19:19,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:20,026 INFO L129 PetriNetUnfolder]: 316/849 cut-off events. [2021-11-20 07:19:20,026 INFO L130 PetriNetUnfolder]: For 681/683 co-relation queries the response was YES. [2021-11-20 07:19:20,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 849 events. 316/849 cut-off events. For 681/683 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4837 event pairs, 35 based on Foata normal form. 30/870 useless extension candidates. Maximal degree in co-relation 2042. Up to 182 conditions per place. [2021-11-20 07:19:20,033 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 37 selfloop transitions, 9 changer transitions 39/168 dead transitions. [2021-11-20 07:19:20,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 703 flow [2021-11-20 07:19:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:19:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-20 07:19:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1067 transitions. [2021-11-20 07:19:20,038 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8745901639344262 [2021-11-20 07:19:20,038 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1067 transitions. [2021-11-20 07:19:20,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1067 transitions. [2021-11-20 07:19:20,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:20,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1067 transitions. [2021-11-20 07:19:20,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.7) internal successors, (1067), 10 states have internal predecessors, (1067), 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) [2021-11-20 07:19:20,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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) [2021-11-20 07:19:20,047 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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) [2021-11-20 07:19:20,047 INFO L186 Difference]: Start difference. First operand has 127 places, 105 transitions, 274 flow. Second operand 10 states and 1067 transitions. [2021-11-20 07:19:20,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 168 transitions, 703 flow [2021-11-20 07:19:20,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 168 transitions, 679 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-11-20 07:19:20,054 INFO L242 Difference]: Finished difference. Result has 131 places, 108 transitions, 342 flow [2021-11-20 07:19:20,055 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=131, PETRI_TRANSITIONS=108} [2021-11-20 07:19:20,057 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 4 predicate places. [2021-11-20 07:19:20,057 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 108 transitions, 342 flow [2021-11-20 07:19:20,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 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) [2021-11-20 07:19:20,058 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:20,058 INFO L254 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] [2021-11-20 07:19:20,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:19:20,059 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash -259209701, now seen corresponding path program 1 times [2021-11-20 07:19:20,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:20,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724215046] [2021-11-20 07:19:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:20,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:20,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:20,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724215046] [2021-11-20 07:19:20,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724215046] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:20,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:20,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:19:20,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282265874] [2021-11-20 07:19:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:20,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:19:20,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:19:20,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:19:20,369 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2021-11-20 07:19:20,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 108 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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) [2021-11-20 07:19:20,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:20,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2021-11-20 07:19:20,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:20,919 INFO L129 PetriNetUnfolder]: 293/1014 cut-off events. [2021-11-20 07:19:20,919 INFO L130 PetriNetUnfolder]: For 1158/1216 co-relation queries the response was YES. [2021-11-20 07:19:20,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1014 events. 293/1014 cut-off events. For 1158/1216 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6124 event pairs, 56 based on Foata normal form. 28/1022 useless extension candidates. Maximal degree in co-relation 2368. Up to 273 conditions per place. [2021-11-20 07:19:20,929 INFO L132 encePairwiseOnDemand]: 109/122 looper letters, 36 selfloop transitions, 9 changer transitions 31/158 dead transitions. [2021-11-20 07:19:20,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 158 transitions, 600 flow [2021-11-20 07:19:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:19:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-20 07:19:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1079 transitions. [2021-11-20 07:19:20,934 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8040238450074516 [2021-11-20 07:19:20,934 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1079 transitions. [2021-11-20 07:19:20,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1079 transitions. [2021-11-20 07:19:20,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:20,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1079 transitions. [2021-11-20 07:19:20,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.0909090909091) internal successors, (1079), 11 states have internal predecessors, (1079), 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) [2021-11-20 07:19:20,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-11-20 07:19:20,943 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-11-20 07:19:20,943 INFO L186 Difference]: Start difference. First operand has 131 places, 108 transitions, 342 flow. Second operand 11 states and 1079 transitions. [2021-11-20 07:19:20,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 158 transitions, 600 flow [2021-11-20 07:19:20,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 158 transitions, 544 flow, removed 20 selfloop flow, removed 9 redundant places. [2021-11-20 07:19:20,956 INFO L242 Difference]: Finished difference. Result has 136 places, 112 transitions, 356 flow [2021-11-20 07:19:20,956 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=356, PETRI_PLACES=136, PETRI_TRANSITIONS=112} [2021-11-20 07:19:20,957 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2021-11-20 07:19:20,957 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 112 transitions, 356 flow [2021-11-20 07:19:20,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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) [2021-11-20 07:19:20,958 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:20,958 INFO L254 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] [2021-11-20 07:19:20,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:19:20,959 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2144868467, now seen corresponding path program 2 times [2021-11-20 07:19:20,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:20,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941884249] [2021-11-20 07:19:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:20,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:21,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:21,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941884249] [2021-11-20 07:19:21,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941884249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:21,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:21,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:19:21,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146189918] [2021-11-20 07:19:21,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:21,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:19:21,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:21,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:19:21,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:19:21,117 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2021-11-20 07:19:21,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 112 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:19:21,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:21,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2021-11-20 07:19:21,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:21,488 INFO L129 PetriNetUnfolder]: 249/815 cut-off events. [2021-11-20 07:19:21,488 INFO L130 PetriNetUnfolder]: For 720/731 co-relation queries the response was YES. [2021-11-20 07:19:21,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2009 conditions, 815 events. 249/815 cut-off events. For 720/731 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5043 event pairs, 50 based on Foata normal form. 23/807 useless extension candidates. Maximal degree in co-relation 1988. Up to 145 conditions per place. [2021-11-20 07:19:21,497 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 33 selfloop transitions, 14 changer transitions 19/152 dead transitions. [2021-11-20 07:19:21,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 152 transitions, 683 flow [2021-11-20 07:19:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:19:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-20 07:19:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1141 transitions. [2021-11-20 07:19:21,503 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8502235469448585 [2021-11-20 07:19:21,503 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1141 transitions. [2021-11-20 07:19:21,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1141 transitions. [2021-11-20 07:19:21,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:21,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1141 transitions. [2021-11-20 07:19:21,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 103.72727272727273) internal successors, (1141), 11 states have internal predecessors, (1141), 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) [2021-11-20 07:19:21,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-11-20 07:19:21,513 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-11-20 07:19:21,513 INFO L186 Difference]: Start difference. First operand has 136 places, 112 transitions, 356 flow. Second operand 11 states and 1141 transitions. [2021-11-20 07:19:21,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 152 transitions, 683 flow [2021-11-20 07:19:21,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 152 transitions, 635 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-11-20 07:19:21,520 INFO L242 Difference]: Finished difference. Result has 139 places, 115 transitions, 389 flow [2021-11-20 07:19:21,520 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=389, PETRI_PLACES=139, PETRI_TRANSITIONS=115} [2021-11-20 07:19:21,521 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 12 predicate places. [2021-11-20 07:19:21,521 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 115 transitions, 389 flow [2021-11-20 07:19:21,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:19:21,522 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:21,522 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:21,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:19:21,523 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:21,523 INFO L85 PathProgramCache]: Analyzing trace with hash 577240168, now seen corresponding path program 1 times [2021-11-20 07:19:21,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:21,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994886033] [2021-11-20 07:19:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:21,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:21,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:21,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994886033] [2021-11-20 07:19:21,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994886033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:21,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:21,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:19:21,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747687988] [2021-11-20 07:19:21,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:21,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:19:21,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:21,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:19:21,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:19:21,700 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2021-11-20 07:19:21,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 115 transitions, 389 flow. Second operand has 7 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) [2021-11-20 07:19:21,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:21,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2021-11-20 07:19:21,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:22,015 INFO L129 PetriNetUnfolder]: 174/930 cut-off events. [2021-11-20 07:19:22,015 INFO L130 PetriNetUnfolder]: For 1222/1241 co-relation queries the response was YES. [2021-11-20 07:19:22,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 930 events. 174/930 cut-off events. For 1222/1241 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6813 event pairs, 35 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 2223. Up to 130 conditions per place. [2021-11-20 07:19:22,023 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 21 selfloop transitions, 1 changer transitions 16/132 dead transitions. [2021-11-20 07:19:22,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 132 transitions, 533 flow [2021-11-20 07:19:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:19:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 07:19:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 722 transitions. [2021-11-20 07:19:22,027 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8454332552693209 [2021-11-20 07:19:22,027 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 722 transitions. [2021-11-20 07:19:22,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 722 transitions. [2021-11-20 07:19:22,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:22,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 722 transitions. [2021-11-20 07:19:22,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.14285714285714) internal successors, (722), 7 states have internal predecessors, (722), 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) [2021-11-20 07:19:22,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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) [2021-11-20 07:19:22,033 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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) [2021-11-20 07:19:22,034 INFO L186 Difference]: Start difference. First operand has 139 places, 115 transitions, 389 flow. Second operand 7 states and 722 transitions. [2021-11-20 07:19:22,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 132 transitions, 533 flow [2021-11-20 07:19:22,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 457 flow, removed 31 selfloop flow, removed 11 redundant places. [2021-11-20 07:19:22,045 INFO L242 Difference]: Finished difference. Result has 137 places, 114 transitions, 338 flow [2021-11-20 07:19:22,045 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=137, PETRI_TRANSITIONS=114} [2021-11-20 07:19:22,046 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 10 predicate places. [2021-11-20 07:19:22,046 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 114 transitions, 338 flow [2021-11-20 07:19:22,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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) [2021-11-20 07:19:22,047 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:22,047 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:22,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:19:22,048 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash 15537558, now seen corresponding path program 2 times [2021-11-20 07:19:22,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:22,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279276761] [2021-11-20 07:19:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:22,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:22,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:22,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279276761] [2021-11-20 07:19:22,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279276761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:22,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:22,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:19:22,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653993670] [2021-11-20 07:19:22,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:22,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:19:22,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:22,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:19:22,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:19:22,268 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2021-11-20 07:19:22,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 114 transitions, 338 flow. Second operand has 9 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 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) [2021-11-20 07:19:22,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:22,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2021-11-20 07:19:22,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:22,644 INFO L129 PetriNetUnfolder]: 94/691 cut-off events. [2021-11-20 07:19:22,644 INFO L130 PetriNetUnfolder]: For 260/264 co-relation queries the response was YES. [2021-11-20 07:19:22,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 691 events. 94/691 cut-off events. For 260/264 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4702 event pairs, 6 based on Foata normal form. 1/670 useless extension candidates. Maximal degree in co-relation 1384. Up to 80 conditions per place. [2021-11-20 07:19:22,650 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 29 selfloop transitions, 5 changer transitions 10/135 dead transitions. [2021-11-20 07:19:22,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 135 transitions, 496 flow [2021-11-20 07:19:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:19:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-20 07:19:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2021-11-20 07:19:22,654 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8131147540983606 [2021-11-20 07:19:22,654 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2021-11-20 07:19:22,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2021-11-20 07:19:22,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:22,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2021-11-20 07:19:22,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 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) [2021-11-20 07:19:22,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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) [2021-11-20 07:19:22,663 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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) [2021-11-20 07:19:22,663 INFO L186 Difference]: Start difference. First operand has 137 places, 114 transitions, 338 flow. Second operand 10 states and 992 transitions. [2021-11-20 07:19:22,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 135 transitions, 496 flow [2021-11-20 07:19:22,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 467 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-11-20 07:19:22,670 INFO L242 Difference]: Finished difference. Result has 141 places, 117 transitions, 352 flow [2021-11-20 07:19:22,670 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=352, PETRI_PLACES=141, PETRI_TRANSITIONS=117} [2021-11-20 07:19:22,671 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 14 predicate places. [2021-11-20 07:19:22,672 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 117 transitions, 352 flow [2021-11-20 07:19:22,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 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) [2021-11-20 07:19:22,672 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:22,673 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:22,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:19:22,673 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:22,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1843802600, now seen corresponding path program 3 times [2021-11-20 07:19:22,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:22,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652402932] [2021-11-20 07:19:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:22,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:19:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:19:23,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:19:23,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652402932] [2021-11-20 07:19:23,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652402932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:19:23,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:19:23,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 07:19:23,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476142855] [2021-11-20 07:19:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:19:23,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 07:19:23,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:19:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 07:19:23,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:19:23,031 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2021-11-20 07:19:23,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 117 transitions, 352 flow. Second operand has 12 states, 12 states have (on average 95.0) internal successors, (1140), 12 states have internal predecessors, (1140), 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) [2021-11-20 07:19:23,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:19:23,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2021-11-20 07:19:23,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:19:23,409 INFO L129 PetriNetUnfolder]: 81/591 cut-off events. [2021-11-20 07:19:23,410 INFO L130 PetriNetUnfolder]: For 270/302 co-relation queries the response was YES. [2021-11-20 07:19:23,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 591 events. 81/591 cut-off events. For 270/302 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3758 event pairs, 7 based on Foata normal form. 22/600 useless extension candidates. Maximal degree in co-relation 1213. Up to 57 conditions per place. [2021-11-20 07:19:23,414 INFO L132 encePairwiseOnDemand]: 112/122 looper letters, 26 selfloop transitions, 6 changer transitions 12/133 dead transitions. [2021-11-20 07:19:23,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 508 flow [2021-11-20 07:19:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:19:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-20 07:19:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1064 transitions. [2021-11-20 07:19:23,419 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7928464977645305 [2021-11-20 07:19:23,419 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1064 transitions. [2021-11-20 07:19:23,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1064 transitions. [2021-11-20 07:19:23,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:19:23,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1064 transitions. [2021-11-20 07:19:23,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.72727272727273) internal successors, (1064), 11 states have internal predecessors, (1064), 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) [2021-11-20 07:19:23,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-11-20 07:19:23,429 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-11-20 07:19:23,429 INFO L186 Difference]: Start difference. First operand has 141 places, 117 transitions, 352 flow. Second operand 11 states and 1064 transitions. [2021-11-20 07:19:23,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 133 transitions, 508 flow [2021-11-20 07:19:23,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 133 transitions, 493 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-11-20 07:19:23,436 INFO L242 Difference]: Finished difference. Result has 146 places, 116 transitions, 365 flow [2021-11-20 07:19:23,436 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=365, PETRI_PLACES=146, PETRI_TRANSITIONS=116} [2021-11-20 07:19:23,437 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 19 predicate places. [2021-11-20 07:19:23,437 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 116 transitions, 365 flow [2021-11-20 07:19:23,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 95.0) internal successors, (1140), 12 states have internal predecessors, (1140), 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) [2021-11-20 07:19:23,438 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:19:23,438 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:19:23,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 07:19:23,439 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:19:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:19:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1521935512, now seen corresponding path program 4 times [2021-11-20 07:19:23,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:19:23,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377067442] [2021-11-20 07:19:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:19:23,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:19:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:19:23,517 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 07:19:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:19:23,632 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 07:19:23,632 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 07:19:23,633 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-20 07:19:23,635 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-20 07:19:23,635 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-11-20 07:19:23,635 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-11-20 07:19:23,635 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-11-20 07:19:23,636 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-20 07:19:23,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 07:19:23,639 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2021-11-20 07:19:23,644 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-20 07:19:23,645 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:19:23,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:19:23 BasicIcfg [2021-11-20 07:19:23,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:19:23,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:19:23,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:19:23,857 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:19:23,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:19:15" (3/4) ... [2021-11-20 07:19:23,859 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 07:19:24,022 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:19:24,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:19:24,023 INFO L158 Benchmark]: Toolchain (without parser) took 10939.01ms. Allocated memory was 115.3MB in the beginning and 289.4MB in the end (delta: 174.1MB). Free memory was 85.3MB in the beginning and 100.9MB in the end (delta: -15.5MB). Peak memory consumption was 157.1MB. Max. memory is 16.1GB. [2021-11-20 07:19:24,024 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 86.0MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:19:24,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.72ms. Allocated memory is still 115.3MB. Free memory was 85.0MB in the beginning and 77.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 07:19:24,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.48ms. Allocated memory is still 115.3MB. Free memory was 77.0MB in the beginning and 74.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:19:24,025 INFO L158 Benchmark]: Boogie Preprocessor took 40.81ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 72.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:19:24,025 INFO L158 Benchmark]: RCFGBuilder took 1211.46ms. Allocated memory is still 115.3MB. Free memory was 72.0MB in the beginning and 71.4MB in the end (delta: 563.6kB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2021-11-20 07:19:24,026 INFO L158 Benchmark]: TraceAbstraction took 8741.47ms. Allocated memory was 115.3MB in the beginning and 289.4MB in the end (delta: 174.1MB). Free memory was 70.8MB in the beginning and 143.9MB in the end (delta: -73.1MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2021-11-20 07:19:24,026 INFO L158 Benchmark]: Witness Printer took 165.05ms. Allocated memory is still 289.4MB. Free memory was 143.9MB in the beginning and 100.9MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-11-20 07:19:24,029 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.26ms. Allocated memory is still 86.0MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 704.72ms. Allocated memory is still 115.3MB. Free memory was 85.0MB in the beginning and 77.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.48ms. Allocated memory is still 115.3MB. Free memory was 77.0MB in the beginning and 74.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.81ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 72.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1211.46ms. Allocated memory is still 115.3MB. Free memory was 72.0MB in the beginning and 71.4MB in the end (delta: 563.6kB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8741.47ms. Allocated memory was 115.3MB in the beginning and 289.4MB in the end (delta: 174.1MB). Free memory was 70.8MB in the beginning and 143.9MB in the end (delta: -73.1MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Witness Printer took 165.05ms. Allocated memory is still 289.4MB. Free memory was 143.9MB in the beginning and 100.9MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L722] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L723] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L724] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L725] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L726] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L727] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L728] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L729] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L730] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L731] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L732] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L733] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L734] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L735] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L736] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L737] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L738] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L739] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L741] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t257; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t257, ((void *)0), P0, ((void *)0))=-2, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t258, ((void *)0), P1, ((void *)0))=-1, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t259, ((void *)0), P2, ((void *)0))=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 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: 8.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 110 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=7, InterpolantAutomatonStates: 91, 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.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 948 NumberOfCodeBlocks, 948 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 842 ConstructedInterpolants, 0 QuantifiedInterpolants, 4147 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! [2021-11-20 07:19:24,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2d6393-883d-4951-b9f7-0ed9730b2551/bin/uautomizer-DQz5hQGWxF/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