./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro --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 a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:23:55,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:23:55,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:23:55,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:23:55,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:23:55,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:23:55,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:23:55,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:23:55,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:23:55,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:23:55,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:23:55,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:23:55,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:23:55,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:23:55,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:23:55,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:23:55,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:23:55,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:23:55,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:23:55,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:23:55,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:23:55,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:23:55,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:23:55,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:23:55,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:23:55,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:23:55,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:23:55,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:23:55,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:23:55,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:23:55,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:23:55,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:23:55,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:23:55,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:23:55,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:23:55,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:23:55,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:23:55,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:23:55,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:23:55,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:23:55,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:23:55,770 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 18:23:55,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:23:55,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:23:55,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:23:55,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:23:55,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:23:55,811 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:23:55,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:23:55,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:23:55,812 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:23:55,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:23:55,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:23:55,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:23:55,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:23:55,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:23:55,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:23:55,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:23:55,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:23:55,815 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:23:55,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:23:55,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:23:55,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:23:55,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:23:55,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:23:55,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:23:55,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:23:55,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:23:55,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:23:55,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:23:55,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:23:55,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:23:55,820 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:23:55,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:23:55,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:23:55,821 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_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/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_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro 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 -> a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 [2022-11-18 18:23:56,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:23:56,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:23:56,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:23:56,135 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:23:56,136 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:23:56,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix017.oepc.i [2022-11-18 18:23:56,220 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/data/c7325fda5/0b3228e0c92346bf8d6b6729fd2d9b06/FLAGadf1be180 [2022-11-18 18:23:56,696 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:23:56,697 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/sv-benchmarks/c/pthread-wmm/mix017.oepc.i [2022-11-18 18:23:56,709 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/data/c7325fda5/0b3228e0c92346bf8d6b6729fd2d9b06/FLAGadf1be180 [2022-11-18 18:23:57,020 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/data/c7325fda5/0b3228e0c92346bf8d6b6729fd2d9b06 [2022-11-18 18:23:57,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:23:57,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:23:57,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:23:57,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:23:57,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:23:57,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d0c3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57, skipping insertion in model container [2022-11-18 18:23:57,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:23:57,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:23:57,377 WARN L234 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_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/sv-benchmarks/c/pthread-wmm/mix017.oepc.i[945,958] [2022-11-18 18:23:57,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:23:57,662 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:23:57,677 WARN L234 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_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/sv-benchmarks/c/pthread-wmm/mix017.oepc.i[945,958] [2022-11-18 18:23:57,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:23:57,820 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:23:57,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57 WrapperNode [2022-11-18 18:23:57,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:23:57,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:23:57,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:23:57,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:23:57,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,893 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-18 18:23:57,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:23:57,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:23:57,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:23:57,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:23:57,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,950 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:23:57,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:23:57,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:23:57,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:23:57,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (1/1) ... [2022-11-18 18:23:57,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:23:57,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:23:58,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:23:58,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:23:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:23:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 18:23:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:23:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:23:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:23:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 18:23:58,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 18:23:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 18:23:58,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 18:23:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 18:23:58,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 18:23:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 18:23:58,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 18:23:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:23:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 18:23:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:23:58,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:23:58,065 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:23:58,230 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:23:58,232 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:23:58,722 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:23:58,938 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:23:58,938 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 18:23:58,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:23:58 BoogieIcfgContainer [2022-11-18 18:23:58,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:23:58,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:23:58,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:23:58,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:23:58,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:23:57" (1/3) ... [2022-11-18 18:23:58,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613fe38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:23:58, skipping insertion in model container [2022-11-18 18:23:58,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:57" (2/3) ... [2022-11-18 18:23:58,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613fe38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:23:58, skipping insertion in model container [2022-11-18 18:23:58,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:23:58" (3/3) ... [2022-11-18 18:23:58,952 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2022-11-18 18:23:58,960 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 18:23:58,996 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:23:58,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 18:23:58,997 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:23:59,089 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 18:23:59,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-11-18 18:23:59,213 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-11-18 18:23:59,213 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:23:59,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-11-18 18:23:59,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2022-11-18 18:23:59,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2022-11-18 18:23:59,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:23:59,240 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d4216ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:23:59,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 18:23:59,253 INFO L130 PetriNetUnfolder]: 0/52 cut-off events. [2022-11-18 18:23:59,253 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:23:59,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:23:59,254 INFO L209 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] [2022-11-18 18:23:59,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:23:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash -256767669, now seen corresponding path program 1 times [2022-11-18 18:23:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:59,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596385829] [2022-11-18 18:23:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:59,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:59,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:59,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596385829] [2022-11-18 18:23:59,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596385829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:59,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:59,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:23:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801427702] [2022-11-18 18:23:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:59,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:23:59,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:59,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:23:59,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:23:59,967 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 139 [2022-11-18 18:23:59,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:59,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:23:59,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 139 [2022-11-18 18:23:59,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:00,368 INFO L130 PetriNetUnfolder]: 162/622 cut-off events. [2022-11-18 18:24:00,368 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-18 18:24:00,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 622 events. 162/622 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3397 event pairs, 132 based on Foata normal form. 41/621 useless extension candidates. Maximal degree in co-relation 869. Up to 191 conditions per place. [2022-11-18 18:24:00,383 INFO L137 encePairwiseOnDemand]: 134/139 looper letters, 18 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2022-11-18 18:24:00,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 339 flow [2022-11-18 18:24:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:24:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:24:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2022-11-18 18:24:00,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9448441247002398 [2022-11-18 18:24:00,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2022-11-18 18:24:00,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2022-11-18 18:24:00,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:00,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2022-11-18 18:24:00,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:00,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:00,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:00,435 INFO L175 Difference]: Start difference. First operand has 146 places, 135 transitions, 282 flow. Second operand 3 states and 394 transitions. [2022-11-18 18:24:00,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 139 transitions, 339 flow [2022-11-18 18:24:00,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 332 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:24:00,448 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 274 flow [2022-11-18 18:24:00,451 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2022-11-18 18:24:00,456 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, -4 predicate places. [2022-11-18 18:24:00,457 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 274 flow [2022-11-18 18:24:00,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:00,457 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:00,458 INFO L209 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] [2022-11-18 18:24:00,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:24:00,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1480291070, now seen corresponding path program 1 times [2022-11-18 18:24:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:00,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790614431] [2022-11-18 18:24:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790614431] [2022-11-18 18:24:01,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790614431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:01,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:01,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:24:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421777048] [2022-11-18 18:24:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:01,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:24:01,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:01,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:24:01,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:24:01,134 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 139 [2022-11-18 18:24:01,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:01,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:01,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 139 [2022-11-18 18:24:01,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:04,195 INFO L130 PetriNetUnfolder]: 5066/11821 cut-off events. [2022-11-18 18:24:04,195 INFO L131 PetriNetUnfolder]: For 475/475 co-relation queries the response was YES. [2022-11-18 18:24:04,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19390 conditions, 11821 events. 5066/11821 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 111676 event pairs, 2528 based on Foata normal form. 0/11516 useless extension candidates. Maximal degree in co-relation 19328. Up to 4352 conditions per place. [2022-11-18 18:24:04,290 INFO L137 encePairwiseOnDemand]: 130/139 looper letters, 30 selfloop transitions, 5 changer transitions 68/194 dead transitions. [2022-11-18 18:24:04,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 194 transitions, 600 flow [2022-11-18 18:24:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:24:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:24:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1064 transitions. [2022-11-18 18:24:04,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8505195843325339 [2022-11-18 18:24:04,294 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1064 transitions. [2022-11-18 18:24:04,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1064 transitions. [2022-11-18 18:24:04,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:04,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1064 transitions. [2022-11-18 18:24:04,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 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) [2022-11-18 18:24:04,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:04,304 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:04,304 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 9 states and 1064 transitions. [2022-11-18 18:24:04,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 194 transitions, 600 flow [2022-11-18 18:24:04,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 194 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:24:04,314 INFO L231 Difference]: Finished difference. Result has 155 places, 121 transitions, 311 flow [2022-11-18 18:24:04,315 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=155, PETRI_TRANSITIONS=121} [2022-11-18 18:24:04,316 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 9 predicate places. [2022-11-18 18:24:04,317 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 121 transitions, 311 flow [2022-11-18 18:24:04,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:04,318 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:04,318 INFO L209 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] [2022-11-18 18:24:04,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:24:04,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1293789416, now seen corresponding path program 1 times [2022-11-18 18:24:04,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:04,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824626892] [2022-11-18 18:24:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:04,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:04,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824626892] [2022-11-18 18:24:04,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824626892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:04,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:04,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:24:04,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870048525] [2022-11-18 18:24:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:04,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:24:04,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:04,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:24:04,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:24:04,803 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 139 [2022-11-18 18:24:04,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 121 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:04,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:04,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 139 [2022-11-18 18:24:04,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:06,462 INFO L130 PetriNetUnfolder]: 3070/5296 cut-off events. [2022-11-18 18:24:06,463 INFO L131 PetriNetUnfolder]: For 6506/6593 co-relation queries the response was YES. [2022-11-18 18:24:06,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14209 conditions, 5296 events. 3070/5296 cut-off events. For 6506/6593 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 35696 event pairs, 898 based on Foata normal form. 136/5221 useless extension candidates. Maximal degree in co-relation 14144. Up to 2047 conditions per place. [2022-11-18 18:24:06,525 INFO L137 encePairwiseOnDemand]: 133/139 looper letters, 22 selfloop transitions, 3 changer transitions 40/166 dead transitions. [2022-11-18 18:24:06,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 166 transitions, 573 flow [2022-11-18 18:24:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:24:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:24:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2022-11-18 18:24:06,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8800959232613909 [2022-11-18 18:24:06,532 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2022-11-18 18:24:06,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2022-11-18 18:24:06,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:06,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2022-11-18 18:24:06,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:06,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:06,540 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:06,540 INFO L175 Difference]: Start difference. First operand has 155 places, 121 transitions, 311 flow. Second operand 9 states and 1101 transitions. [2022-11-18 18:24:06,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 166 transitions, 573 flow [2022-11-18 18:24:06,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 166 transitions, 554 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-18 18:24:06,592 INFO L231 Difference]: Finished difference. Result has 146 places, 121 transitions, 323 flow [2022-11-18 18:24:06,592 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=323, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2022-11-18 18:24:06,593 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 0 predicate places. [2022-11-18 18:24:06,593 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 323 flow [2022-11-18 18:24:06,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:06,594 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:06,594 INFO L209 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] [2022-11-18 18:24:06,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:24:06,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1346020412, now seen corresponding path program 1 times [2022-11-18 18:24:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814687650] [2022-11-18 18:24:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:06,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814687650] [2022-11-18 18:24:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814687650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:06,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:06,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:24:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528169484] [2022-11-18 18:24:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:06,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:24:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:24:06,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:24:06,987 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-11-18 18:24:06,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 121 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:06,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:06,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-11-18 18:24:06,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:10,376 INFO L130 PetriNetUnfolder]: 8186/14618 cut-off events. [2022-11-18 18:24:10,376 INFO L131 PetriNetUnfolder]: For 5369/5487 co-relation queries the response was YES. [2022-11-18 18:24:10,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30693 conditions, 14618 events. 8186/14618 cut-off events. For 5369/5487 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 119992 event pairs, 751 based on Foata normal form. 0/13998 useless extension candidates. Maximal degree in co-relation 30623. Up to 4128 conditions per place. [2022-11-18 18:24:10,539 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 85 selfloop transitions, 20 changer transitions 0/203 dead transitions. [2022-11-18 18:24:10,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 203 transitions, 703 flow [2022-11-18 18:24:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:24:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 18:24:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1227 transitions. [2022-11-18 18:24:10,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8827338129496403 [2022-11-18 18:24:10,544 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1227 transitions. [2022-11-18 18:24:10,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1227 transitions. [2022-11-18 18:24:10,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:10,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1227 transitions. [2022-11-18 18:24:10,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.7) internal successors, (1227), 10 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:10,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:10,558 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:10,559 INFO L175 Difference]: Start difference. First operand has 146 places, 121 transitions, 323 flow. Second operand 10 states and 1227 transitions. [2022-11-18 18:24:10,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 203 transitions, 703 flow [2022-11-18 18:24:10,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 203 transitions, 685 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-18 18:24:10,634 INFO L231 Difference]: Finished difference. Result has 147 places, 139 transitions, 448 flow [2022-11-18 18:24:10,635 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=448, PETRI_PLACES=147, PETRI_TRANSITIONS=139} [2022-11-18 18:24:10,636 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 1 predicate places. [2022-11-18 18:24:10,636 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 139 transitions, 448 flow [2022-11-18 18:24:10,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:10,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:10,637 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:10,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:24:10,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1342033701, now seen corresponding path program 1 times [2022-11-18 18:24:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:10,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309235690] [2022-11-18 18:24:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:11,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309235690] [2022-11-18 18:24:11,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309235690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:11,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:11,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:24:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482479935] [2022-11-18 18:24:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:11,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:24:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:24:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:24:11,007 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-11-18 18:24:11,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 139 transitions, 448 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:11,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:11,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-11-18 18:24:11,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:14,140 INFO L130 PetriNetUnfolder]: 7606/13930 cut-off events. [2022-11-18 18:24:14,141 INFO L131 PetriNetUnfolder]: For 14940/15031 co-relation queries the response was YES. [2022-11-18 18:24:14,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38037 conditions, 13930 events. 7606/13930 cut-off events. For 14940/15031 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 118057 event pairs, 406 based on Foata normal form. 236/13828 useless extension candidates. Maximal degree in co-relation 37966. Up to 2710 conditions per place. [2022-11-18 18:24:14,289 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 110 selfloop transitions, 38 changer transitions 0/246 dead transitions. [2022-11-18 18:24:14,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 246 transitions, 1164 flow [2022-11-18 18:24:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:24:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 18:24:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1600 transitions. [2022-11-18 18:24:14,485 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8854454897620365 [2022-11-18 18:24:14,485 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1600 transitions. [2022-11-18 18:24:14,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1600 transitions. [2022-11-18 18:24:14,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:14,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1600 transitions. [2022-11-18 18:24:14,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 123.07692307692308) internal successors, (1600), 13 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:14,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:14,494 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:14,494 INFO L175 Difference]: Start difference. First operand has 147 places, 139 transitions, 448 flow. Second operand 13 states and 1600 transitions. [2022-11-18 18:24:14,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 246 transitions, 1164 flow [2022-11-18 18:24:14,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 246 transitions, 1162 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:24:14,682 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 739 flow [2022-11-18 18:24:14,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=739, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2022-11-18 18:24:14,683 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 18 predicate places. [2022-11-18 18:24:14,684 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 739 flow [2022-11-18 18:24:14,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:14,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:14,685 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:14,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:24:14,685 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -493329496, now seen corresponding path program 1 times [2022-11-18 18:24:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:14,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118854674] [2022-11-18 18:24:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118854674] [2022-11-18 18:24:15,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118854674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:15,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:15,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:24:15,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5527862] [2022-11-18 18:24:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:15,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:24:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:15,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:24:15,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:24:15,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-11-18 18:24:15,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 739 flow. Second operand has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:15,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:15,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-11-18 18:24:15,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:17,948 INFO L130 PetriNetUnfolder]: 7233/13205 cut-off events. [2022-11-18 18:24:17,948 INFO L131 PetriNetUnfolder]: For 35689/35875 co-relation queries the response was YES. [2022-11-18 18:24:18,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44890 conditions, 13205 events. 7233/13205 cut-off events. For 35689/35875 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 111567 event pairs, 454 based on Foata normal form. 131/12990 useless extension candidates. Maximal degree in co-relation 44811. Up to 2634 conditions per place. [2022-11-18 18:24:18,052 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 107 selfloop transitions, 56 changer transitions 30/291 dead transitions. [2022-11-18 18:24:18,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 291 transitions, 1811 flow [2022-11-18 18:24:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:24:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 18:24:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1972 transitions. [2022-11-18 18:24:18,058 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8866906474820144 [2022-11-18 18:24:18,058 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1972 transitions. [2022-11-18 18:24:18,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1972 transitions. [2022-11-18 18:24:18,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:18,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1972 transitions. [2022-11-18 18:24:18,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 123.25) internal successors, (1972), 16 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:18,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:18,069 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:18,070 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 739 flow. Second operand 16 states and 1972 transitions. [2022-11-18 18:24:18,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 291 transitions, 1811 flow [2022-11-18 18:24:19,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 291 transitions, 1708 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-11-18 18:24:19,436 INFO L231 Difference]: Finished difference. Result has 179 places, 183 transitions, 1083 flow [2022-11-18 18:24:19,437 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1083, PETRI_PLACES=179, PETRI_TRANSITIONS=183} [2022-11-18 18:24:19,437 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 33 predicate places. [2022-11-18 18:24:19,438 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 183 transitions, 1083 flow [2022-11-18 18:24:19,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:19,439 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:19,439 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:19,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:24:19,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1379531059, now seen corresponding path program 1 times [2022-11-18 18:24:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:19,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864357495] [2022-11-18 18:24:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:20,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864357495] [2022-11-18 18:24:20,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864357495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:20,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:20,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 18:24:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764975175] [2022-11-18 18:24:20,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:20,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 18:24:20,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:20,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 18:24:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:24:20,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 139 [2022-11-18 18:24:20,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 183 transitions, 1083 flow. Second operand has 11 states, 11 states have (on average 102.9090909090909) internal successors, (1132), 11 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:20,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:20,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 139 [2022-11-18 18:24:20,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:23,153 INFO L130 PetriNetUnfolder]: 2513/7998 cut-off events. [2022-11-18 18:24:23,153 INFO L131 PetriNetUnfolder]: For 37848/40286 co-relation queries the response was YES. [2022-11-18 18:24:23,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29828 conditions, 7998 events. 2513/7998 cut-off events. For 37848/40286 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 93444 event pairs, 133 based on Foata normal form. 20/7544 useless extension candidates. Maximal degree in co-relation 29732. Up to 1776 conditions per place. [2022-11-18 18:24:23,269 INFO L137 encePairwiseOnDemand]: 123/139 looper letters, 68 selfloop transitions, 24 changer transitions 29/266 dead transitions. [2022-11-18 18:24:23,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 266 transitions, 1690 flow [2022-11-18 18:24:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:24:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 18:24:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1721 transitions. [2022-11-18 18:24:23,274 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7738309352517986 [2022-11-18 18:24:23,275 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1721 transitions. [2022-11-18 18:24:23,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1721 transitions. [2022-11-18 18:24:23,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:23,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1721 transitions. [2022-11-18 18:24:23,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 107.5625) internal successors, (1721), 16 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:23,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:23,286 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:23,286 INFO L175 Difference]: Start difference. First operand has 179 places, 183 transitions, 1083 flow. Second operand 16 states and 1721 transitions. [2022-11-18 18:24:23,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 266 transitions, 1690 flow [2022-11-18 18:24:25,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 266 transitions, 1377 flow, removed 114 selfloop flow, removed 11 redundant places. [2022-11-18 18:24:25,105 INFO L231 Difference]: Finished difference. Result has 193 places, 200 transitions, 963 flow [2022-11-18 18:24:25,106 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=963, PETRI_PLACES=193, PETRI_TRANSITIONS=200} [2022-11-18 18:24:25,107 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 47 predicate places. [2022-11-18 18:24:25,107 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 200 transitions, 963 flow [2022-11-18 18:24:25,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 102.9090909090909) internal successors, (1132), 11 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:25,108 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:25,108 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:25,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:24:25,109 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:25,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2099610671, now seen corresponding path program 2 times [2022-11-18 18:24:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:25,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85176861] [2022-11-18 18:24:25,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:25,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:25,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85176861] [2022-11-18 18:24:25,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85176861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:25,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:25,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 18:24:25,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418579909] [2022-11-18 18:24:25,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:25,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:24:25,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:24:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:24:25,608 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-11-18 18:24:25,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 200 transitions, 963 flow. Second operand has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:25,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:25,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-11-18 18:24:25,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:30,542 INFO L130 PetriNetUnfolder]: 13103/25390 cut-off events. [2022-11-18 18:24:30,542 INFO L131 PetriNetUnfolder]: For 35920/37004 co-relation queries the response was YES. [2022-11-18 18:24:30,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78438 conditions, 25390 events. 13103/25390 cut-off events. For 35920/37004 co-relation queries the response was YES. Maximal size of possible extension queue 1526. Compared 251200 event pairs, 409 based on Foata normal form. 238/25286 useless extension candidates. Maximal degree in co-relation 78403. Up to 2828 conditions per place. [2022-11-18 18:24:30,805 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 139 selfloop transitions, 61 changer transitions 49/353 dead transitions. [2022-11-18 18:24:30,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 353 transitions, 2202 flow [2022-11-18 18:24:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 18:24:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 18:24:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2293 transitions. [2022-11-18 18:24:30,812 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8682317304051496 [2022-11-18 18:24:30,812 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2293 transitions. [2022-11-18 18:24:30,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2293 transitions. [2022-11-18 18:24:30,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:30,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2293 transitions. [2022-11-18 18:24:30,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 120.6842105263158) internal successors, (2293), 19 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:30,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 139.0) internal successors, (2780), 20 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:30,826 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 139.0) internal successors, (2780), 20 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:30,826 INFO L175 Difference]: Start difference. First operand has 193 places, 200 transitions, 963 flow. Second operand 19 states and 2293 transitions. [2022-11-18 18:24:30,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 353 transitions, 2202 flow [2022-11-18 18:24:33,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 353 transitions, 2137 flow, removed 28 selfloop flow, removed 10 redundant places. [2022-11-18 18:24:33,272 INFO L231 Difference]: Finished difference. Result has 202 places, 195 transitions, 1033 flow [2022-11-18 18:24:33,272 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1033, PETRI_PLACES=202, PETRI_TRANSITIONS=195} [2022-11-18 18:24:33,273 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 56 predicate places. [2022-11-18 18:24:33,273 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 195 transitions, 1033 flow [2022-11-18 18:24:33,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:33,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:33,275 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:33,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:24:33,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:33,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:33,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1864666923, now seen corresponding path program 1 times [2022-11-18 18:24:33,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:33,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599900576] [2022-11-18 18:24:33,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:33,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:33,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:33,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599900576] [2022-11-18 18:24:33,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599900576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:33,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:33,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:24:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748448433] [2022-11-18 18:24:33,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:33,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:24:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:33,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:24:33,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:24:33,657 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 139 [2022-11-18 18:24:33,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 195 transitions, 1033 flow. Second operand has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:33,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:33,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 139 [2022-11-18 18:24:33,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:36,522 INFO L130 PetriNetUnfolder]: 4982/16392 cut-off events. [2022-11-18 18:24:36,522 INFO L131 PetriNetUnfolder]: For 36718/38338 co-relation queries the response was YES. [2022-11-18 18:24:36,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51404 conditions, 16392 events. 4982/16392 cut-off events. For 36718/38338 co-relation queries the response was YES. Maximal size of possible extension queue 1951. Compared 223717 event pairs, 317 based on Foata normal form. 1/15288 useless extension candidates. Maximal degree in co-relation 51307. Up to 1618 conditions per place. [2022-11-18 18:24:36,678 INFO L137 encePairwiseOnDemand]: 129/139 looper letters, 55 selfloop transitions, 9 changer transitions 32/246 dead transitions. [2022-11-18 18:24:36,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 246 transitions, 1506 flow [2022-11-18 18:24:36,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:24:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:24:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1023 transitions. [2022-11-18 18:24:36,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8177458033573142 [2022-11-18 18:24:36,681 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1023 transitions. [2022-11-18 18:24:36,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1023 transitions. [2022-11-18 18:24:36,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:36,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1023 transitions. [2022-11-18 18:24:36,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:36,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:36,688 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:36,688 INFO L175 Difference]: Start difference. First operand has 202 places, 195 transitions, 1033 flow. Second operand 9 states and 1023 transitions. [2022-11-18 18:24:36,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 246 transitions, 1506 flow [2022-11-18 18:24:38,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 246 transitions, 1339 flow, removed 36 selfloop flow, removed 17 redundant places. [2022-11-18 18:24:38,646 INFO L231 Difference]: Finished difference. Result has 195 places, 195 transitions, 929 flow [2022-11-18 18:24:38,647 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=929, PETRI_PLACES=195, PETRI_TRANSITIONS=195} [2022-11-18 18:24:38,647 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 49 predicate places. [2022-11-18 18:24:38,648 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 195 transitions, 929 flow [2022-11-18 18:24:38,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:38,648 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:38,648 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:38,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:24:38,649 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:38,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:38,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1689628529, now seen corresponding path program 2 times [2022-11-18 18:24:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:38,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868186039] [2022-11-18 18:24:38,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:39,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:39,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868186039] [2022-11-18 18:24:39,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868186039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:39,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:39,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:24:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467516686] [2022-11-18 18:24:39,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:39,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:24:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:24:39,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:24:39,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 139 [2022-11-18 18:24:39,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 929 flow. Second operand has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:39,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:39,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 139 [2022-11-18 18:24:39,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:41,079 INFO L130 PetriNetUnfolder]: 4509/14430 cut-off events. [2022-11-18 18:24:41,079 INFO L131 PetriNetUnfolder]: For 21790/22678 co-relation queries the response was YES. [2022-11-18 18:24:41,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40783 conditions, 14430 events. 4509/14430 cut-off events. For 21790/22678 co-relation queries the response was YES. Maximal size of possible extension queue 1973. Compared 195538 event pairs, 129 based on Foata normal form. 1/13441 useless extension candidates. Maximal degree in co-relation 40751. Up to 1641 conditions per place. [2022-11-18 18:24:41,290 INFO L137 encePairwiseOnDemand]: 130/139 looper letters, 64 selfloop transitions, 14 changer transitions 6/235 dead transitions. [2022-11-18 18:24:41,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 235 transitions, 1299 flow [2022-11-18 18:24:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:24:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:24:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1015 transitions. [2022-11-18 18:24:41,297 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8113509192645884 [2022-11-18 18:24:41,297 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1015 transitions. [2022-11-18 18:24:41,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1015 transitions. [2022-11-18 18:24:41,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:41,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1015 transitions. [2022-11-18 18:24:41,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:41,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:41,306 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:41,306 INFO L175 Difference]: Start difference. First operand has 195 places, 195 transitions, 929 flow. Second operand 9 states and 1015 transitions. [2022-11-18 18:24:41,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 235 transitions, 1299 flow [2022-11-18 18:24:43,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 235 transitions, 1275 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-18 18:24:43,107 INFO L231 Difference]: Finished difference. Result has 199 places, 200 transitions, 997 flow [2022-11-18 18:24:43,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=997, PETRI_PLACES=199, PETRI_TRANSITIONS=200} [2022-11-18 18:24:43,110 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 53 predicate places. [2022-11-18 18:24:43,110 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 200 transitions, 997 flow [2022-11-18 18:24:43,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:43,111 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:43,111 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:43,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:24:43,112 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:43,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash 312930481, now seen corresponding path program 3 times [2022-11-18 18:24:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:43,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122428194] [2022-11-18 18:24:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:43,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122428194] [2022-11-18 18:24:44,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122428194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:44,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:44,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 18:24:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74419003] [2022-11-18 18:24:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:44,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 18:24:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 18:24:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:24:44,859 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 139 [2022-11-18 18:24:44,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 200 transitions, 997 flow. Second operand has 12 states, 12 states have (on average 102.83333333333333) internal successors, (1234), 12 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:44,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:44,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 139 [2022-11-18 18:24:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:48,506 INFO L130 PetriNetUnfolder]: 7778/25883 cut-off events. [2022-11-18 18:24:48,507 INFO L131 PetriNetUnfolder]: For 39334/39920 co-relation queries the response was YES. [2022-11-18 18:24:48,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71306 conditions, 25883 events. 7778/25883 cut-off events. For 39334/39920 co-relation queries the response was YES. Maximal size of possible extension queue 3142. Compared 387792 event pairs, 169 based on Foata normal form. 4/24298 useless extension candidates. Maximal degree in co-relation 71272. Up to 2710 conditions per place. [2022-11-18 18:24:49,004 INFO L137 encePairwiseOnDemand]: 123/139 looper letters, 61 selfloop transitions, 32 changer transitions 5/244 dead transitions. [2022-11-18 18:24:49,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 244 transitions, 1411 flow [2022-11-18 18:24:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:24:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 18:24:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1381 transitions. [2022-11-18 18:24:49,008 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7642501383508578 [2022-11-18 18:24:49,008 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1381 transitions. [2022-11-18 18:24:49,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1381 transitions. [2022-11-18 18:24:49,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:49,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1381 transitions. [2022-11-18 18:24:49,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.23076923076923) internal successors, (1381), 13 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:49,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:49,018 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:49,018 INFO L175 Difference]: Start difference. First operand has 199 places, 200 transitions, 997 flow. Second operand 13 states and 1381 transitions. [2022-11-18 18:24:49,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 244 transitions, 1411 flow [2022-11-18 18:24:54,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 244 transitions, 1401 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-18 18:24:54,260 INFO L231 Difference]: Finished difference. Result has 212 places, 214 transitions, 1190 flow [2022-11-18 18:24:54,260 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1190, PETRI_PLACES=212, PETRI_TRANSITIONS=214} [2022-11-18 18:24:54,261 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 66 predicate places. [2022-11-18 18:24:54,261 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 214 transitions, 1190 flow [2022-11-18 18:24:54,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 102.83333333333333) internal successors, (1234), 12 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:54,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:24:54,262 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:54,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:24:54,262 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:24:54,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1898905969, now seen corresponding path program 4 times [2022-11-18 18:24:54,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:54,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005101553] [2022-11-18 18:24:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:54,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:54,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005101553] [2022-11-18 18:24:54,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005101553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:54,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:54,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:24:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088662092] [2022-11-18 18:24:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:54,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:24:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:54,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:24:54,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:24:54,559 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 139 [2022-11-18 18:24:54,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 214 transitions, 1190 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:54,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:24:54,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 139 [2022-11-18 18:24:54,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:24:59,359 INFO L130 PetriNetUnfolder]: 10568/34224 cut-off events. [2022-11-18 18:24:59,359 INFO L131 PetriNetUnfolder]: For 57363/58745 co-relation queries the response was YES. [2022-11-18 18:24:59,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97417 conditions, 34224 events. 10568/34224 cut-off events. For 57363/58745 co-relation queries the response was YES. Maximal size of possible extension queue 4820. Compared 536223 event pairs, 169 based on Foata normal form. 6/31905 useless extension candidates. Maximal degree in co-relation 97378. Up to 3633 conditions per place. [2022-11-18 18:24:59,732 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 68 selfloop transitions, 26 changer transitions 22/268 dead transitions. [2022-11-18 18:24:59,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 268 transitions, 1797 flow [2022-11-18 18:24:59,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:24:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 18:24:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 908 transitions. [2022-11-18 18:24:59,735 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8165467625899281 [2022-11-18 18:24:59,735 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 908 transitions. [2022-11-18 18:24:59,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 908 transitions. [2022-11-18 18:24:59,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:24:59,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 908 transitions. [2022-11-18 18:24:59,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:59,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 139.0) internal successors, (1251), 9 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:59,742 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 139.0) internal successors, (1251), 9 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:59,742 INFO L175 Difference]: Start difference. First operand has 212 places, 214 transitions, 1190 flow. Second operand 8 states and 908 transitions. [2022-11-18 18:24:59,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 268 transitions, 1797 flow [2022-11-18 18:25:11,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 268 transitions, 1762 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-11-18 18:25:11,264 INFO L231 Difference]: Finished difference. Result has 214 places, 217 transitions, 1311 flow [2022-11-18 18:25:11,264 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1311, PETRI_PLACES=214, PETRI_TRANSITIONS=217} [2022-11-18 18:25:11,265 INFO L288 CegarLoopForPetriNet]: 146 programPoint places, 68 predicate places. [2022-11-18 18:25:11,265 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 217 transitions, 1311 flow [2022-11-18 18:25:11,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:25:11,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:25:11,266 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:11,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:25:11,266 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:25:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1848821065, now seen corresponding path program 5 times [2022-11-18 18:25:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:11,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222617192] [2022-11-18 18:25:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:25:11,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:25:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:25:11,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:25:11,452 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:25:11,454 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 18:25:11,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 18:25:11,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 18:25:11,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 18:25:11,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 18:25:11,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 18:25:11,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 18:25:11,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:25:11,458 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:11,466 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 18:25:11,466 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:25:11,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:25:11 BasicIcfg [2022-11-18 18:25:11,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:25:11,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:25:11,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:25:11,677 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:25:11,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:23:58" (3/4) ... [2022-11-18 18:25:11,679 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 18:25:11,804 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 18:25:11,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:25:11,805 INFO L158 Benchmark]: Toolchain (without parser) took 74778.98ms. Allocated memory was 90.2MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 53.0MB in the beginning and 8.7GB in the end (delta: -8.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-18 18:25:11,805 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 90.2MB. Free memory was 59.1MB in the beginning and 59.1MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:25:11,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 791.66ms. Allocated memory was 90.2MB in the beginning and 134.2MB in the end (delta: 44.0MB). Free memory was 52.8MB in the beginning and 94.9MB in the end (delta: -42.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 18:25:11,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.52ms. Allocated memory is still 134.2MB. Free memory was 94.9MB in the beginning and 92.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:25:11,806 INFO L158 Benchmark]: Boogie Preprocessor took 63.42ms. Allocated memory is still 134.2MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:25:11,807 INFO L158 Benchmark]: RCFGBuilder took 980.40ms. Allocated memory is still 134.2MB. Free memory was 90.7MB in the beginning and 52.1MB in the end (delta: 38.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-18 18:25:11,807 INFO L158 Benchmark]: TraceAbstraction took 72731.72ms. Allocated memory was 134.2MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 51.5MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-18 18:25:11,808 INFO L158 Benchmark]: Witness Printer took 127.70ms. Allocated memory is still 10.5GB. Free memory was 8.8GB in the beginning and 8.7GB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-18 18:25:11,810 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.27ms. Allocated memory is still 90.2MB. Free memory was 59.1MB in the beginning and 59.1MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 791.66ms. Allocated memory was 90.2MB in the beginning and 134.2MB in the end (delta: 44.0MB). Free memory was 52.8MB in the beginning and 94.9MB in the end (delta: -42.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.52ms. Allocated memory is still 134.2MB. Free memory was 94.9MB in the beginning and 92.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.42ms. Allocated memory is still 134.2MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 980.40ms. Allocated memory is still 134.2MB. Free memory was 90.7MB in the beginning and 52.1MB in the end (delta: 38.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 72731.72ms. Allocated memory was 134.2MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 51.5MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 127.70ms. Allocated memory is still 10.5GB. Free memory was 8.8GB in the beginning and 8.7GB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L740] 0 _Bool a$w_buff1_used; VAL [a$w_buff1_used=0] [L749] 0 _Bool weak$$choice0; VAL [a$w_buff1_used=0, weak$$choice0=0] [L750] 0 _Bool weak$$choice2; VAL [a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L724] 0 int a$mem_tmp; VAL [__unbuffered_p0_EAX=0, a$mem_tmp=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L735] 0 _Bool a$read_delayed; VAL [__unbuffered_p0_EAX=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L722] 0 int a = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L734] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L737] 0 int a$w_buff0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L739] 0 int a$w_buff1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L723] 0 _Bool a$flush_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L736] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L742] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L741] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L738] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L726] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L725] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L728] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L727] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L729] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L744] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t433; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t433, ((void *)0), P0, ((void *)0))=-3, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] FCALL, FORK 0 pthread_create(&t434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t434, ((void *)0), P1, ((void *)0))=-2, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t435; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] FCALL, FORK 0 pthread_create(&t435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t435, ((void *)0), P2, ((void *)0))=-1, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L810] 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) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 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 [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L874] 0 pthread_t t436; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] FCALL, FORK 0 pthread_create(&t436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t436, ((void *)0), P3, ((void *)0))=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L846] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L770] 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) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 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 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L853] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 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) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 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 [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L890] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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: 871]: 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: 869]: 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: 875]: 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: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 176 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 72.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 64.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1202 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1202 mSDsluCounter, 995 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 814 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2210 IncrementalHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 181 mSDtfsCounter, 2210 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1311occurred in iteration=12, InterpolantAutomatonStates: 134, 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.8s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1255 NumberOfCodeBlocks, 1255 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1135 ConstructedInterpolants, 0 QuantifiedInterpolants, 6018 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 18:25:11,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f331b888-f5f7-4cd1-b26c-48bef8f4f03a/bin/uautomizer-TMbwUNV5ro/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