./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc --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 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 --- 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-5e519f3 [2022-11-02 20:48:56,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:48:56,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:48:56,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:48:56,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:48:56,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:48:56,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:48:56,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:48:56,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:48:56,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:48:56,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:48:56,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:48:56,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:48:56,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:48:56,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:48:56,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:48:56,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:48:56,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:48:56,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:48:56,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:48:56,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:48:56,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:48:56,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:48:56,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:48:56,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:48:56,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:48:56,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:48:56,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:48:56,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:48:56,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:48:56,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:48:56,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:48:56,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:48:56,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:48:56,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:48:56,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:48:56,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:48:56,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:48:56,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:48:56,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:48:56,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:48:56,891 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:48:56,941 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:48:56,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:48:56,942 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:48:56,942 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:48:56,943 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:48:56,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:48:56,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:48:56,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:48:56,945 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:48:56,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:48:56,947 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:48:56,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:48:56,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:48:56,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:48:56,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:48:56,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:48:56,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:48:56,950 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:48:56,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:48:56,950 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:48:56,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:48:56,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:48:56,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:48:56,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:48:56,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:48:56,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:48:56,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:48:56,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:48:56,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:48:56,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:48:56,955 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:48:56,955 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:48:56,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:48:56,955 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_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/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_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc 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 -> 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 [2022-11-02 20:48:57,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:48:57,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:48:57,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:48:57,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:48:57,375 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:48:57,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-02 20:48:57,467 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/data/5d0ce1a1d/58805a9df69543a297c1b589ad990350/FLAG060af3967 [2022-11-02 20:48:58,220 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:48:58,220 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-02 20:48:58,254 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/data/5d0ce1a1d/58805a9df69543a297c1b589ad990350/FLAG060af3967 [2022-11-02 20:48:58,469 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/data/5d0ce1a1d/58805a9df69543a297c1b589ad990350 [2022-11-02 20:48:58,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:48:58,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:48:58,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:48:58,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:48:58,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:48:58,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:48:58" (1/1) ... [2022-11-02 20:48:58,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622c7201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:58, skipping insertion in model container [2022-11-02 20:48:58,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:48:58" (1/1) ... [2022-11-02 20:48:58,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:48:58,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:48:58,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-02 20:48:59,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:48:59,142 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:48:59,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-02 20:48:59,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:48:59,278 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:48:59,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59 WrapperNode [2022-11-02 20:48:59,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:48:59,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:48:59,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:48:59,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:48:59,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,382 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-11-02 20:48:59,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:48:59,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:48:59,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:48:59,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:48:59,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:48:59,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:48:59,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:48:59,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:48:59,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (1/1) ... [2022-11-02 20:48:59,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:48:59,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:59,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:48:59,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:48:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:48:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:48:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:48:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:48:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:48:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:48:59,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:48:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:48:59,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:48:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 20:48:59,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 20:48:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:48:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:48:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:48:59,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:48:59,580 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:48:59,809 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:48:59,812 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:49:00,580 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:49:01,111 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:49:01,112 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:49:01,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:01 BoogieIcfgContainer [2022-11-02 20:49:01,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:49:01,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:49:01,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:49:01,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:49:01,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:48:58" (1/3) ... [2022-11-02 20:49:01,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a44642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:01, skipping insertion in model container [2022-11-02 20:49:01,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:59" (2/3) ... [2022-11-02 20:49:01,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a44642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:01, skipping insertion in model container [2022-11-02 20:49:01,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:01" (3/3) ... [2022-11-02 20:49:01,128 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-02 20:49:01,139 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:49:01,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:49:01,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:49:01,153 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:49:01,275 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:49:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-11-02 20:49:01,405 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-02 20:49:01,405 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:49:01,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-11-02 20:49:01,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-11-02 20:49:01,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-11-02 20:49:01,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:49:01,446 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;@733a082d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:49:01,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 20:49:01,464 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-11-02 20:49:01,465 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:49:01,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:01,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:01,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:01,473 INFO L85 PathProgramCache]: Analyzing trace with hash -779901744, now seen corresponding path program 1 times [2022-11-02 20:49:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:01,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662357259] [2022-11-02 20:49:01,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:02,246 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-02 20:49:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:02,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662357259] [2022-11-02 20:49:02,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662357259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:02,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:02,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136161325] [2022-11-02 20:49:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:02,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:02,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:02,323 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 113 [2022-11-02 20:49:02,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-02 20:49:02,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:02,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 113 [2022-11-02 20:49:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:02,461 INFO L130 PetriNetUnfolder]: 10/178 cut-off events. [2022-11-02 20:49:02,461 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:49:02,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 178 events. 10/178 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 336 event pairs, 4 based on Foata normal form. 5/174 useless extension candidates. Maximal degree in co-relation 165. Up to 17 conditions per place. [2022-11-02 20:49:02,465 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 8 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2022-11-02 20:49:02,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 245 flow [2022-11-02 20:49:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:49:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-11-02 20:49:02,481 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-11-02 20:49:02,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-11-02 20:49:02,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-11-02 20:49:02,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:02,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-11-02 20:49:02,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-02 20:49:02,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-02 20:49:02,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-02 20:49:02,500 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-11-02 20:49:02,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 245 flow [2022-11-02 20:49:02,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 108 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:49:02,508 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-11-02 20:49:02,510 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-11-02 20:49:02,514 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-11-02 20:49:02,514 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-11-02 20:49:02,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-02 20:49:02,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:02,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:02,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:49:02,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 987570941, now seen corresponding path program 1 times [2022-11-02 20:49:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:02,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615474998] [2022-11-02 20:49:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:02,980 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-02 20:49:02,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:02,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615474998] [2022-11-02 20:49:02,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615474998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:02,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:02,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:49:02,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889875495] [2022-11-02 20:49:02,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:02,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:02,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:02,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:02,995 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-11-02 20:49:02,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-02 20:49:02,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:03,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-11-02 20:49:03,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:03,758 INFO L130 PetriNetUnfolder]: 282/964 cut-off events. [2022-11-02 20:49:03,758 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-02 20:49:03,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 964 events. 282/964 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6233 event pairs, 42 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1444. Up to 249 conditions per place. [2022-11-02 20:49:03,766 INFO L137 encePairwiseOnDemand]: 106/113 looper letters, 20 selfloop transitions, 3 changer transitions 48/149 dead transitions. [2022-11-02 20:49:03,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 149 transitions, 446 flow [2022-11-02 20:49:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:49:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:49:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-11-02 20:49:03,773 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8751229105211407 [2022-11-02 20:49:03,773 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-11-02 20:49:03,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-11-02 20:49:03,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:03,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-11-02 20:49:03,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 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-02 20:49:03,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-02 20:49:03,783 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-02 20:49:03,784 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 890 transitions. [2022-11-02 20:49:03,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 149 transitions, 446 flow [2022-11-02 20:49:03,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:49:03,788 INFO L231 Difference]: Finished difference. Result has 128 places, 96 transitions, 237 flow [2022-11-02 20:49:03,788 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2022-11-02 20:49:03,789 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2022-11-02 20:49:03,789 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 237 flow [2022-11-02 20:49:03,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-02 20:49:03,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:03,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:03,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:49:03,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -347203048, now seen corresponding path program 1 times [2022-11-02 20:49:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:03,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611492868] [2022-11-02 20:49:03,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:04,105 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-02 20:49:04,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:04,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611492868] [2022-11-02 20:49:04,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611492868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:04,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:04,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:49:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962913259] [2022-11-02 20:49:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:04,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:04,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:04,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:04,113 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-02 20:49:04,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-02 20:49:04,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:04,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-02 20:49:04,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:04,759 INFO L130 PetriNetUnfolder]: 568/1302 cut-off events. [2022-11-02 20:49:04,760 INFO L131 PetriNetUnfolder]: For 334/334 co-relation queries the response was YES. [2022-11-02 20:49:04,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2569 conditions, 1302 events. 568/1302 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8274 event pairs, 32 based on Foata normal form. 0/1245 useless extension candidates. Maximal degree in co-relation 2510. Up to 337 conditions per place. [2022-11-02 20:49:04,775 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 31 selfloop transitions, 7 changer transitions 33/149 dead transitions. [2022-11-02 20:49:04,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 149 transitions, 489 flow [2022-11-02 20:49:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:49:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:49:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 983 transitions. [2022-11-02 20:49:04,780 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8699115044247787 [2022-11-02 20:49:04,780 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 983 transitions. [2022-11-02 20:49:04,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 983 transitions. [2022-11-02 20:49:04,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:04,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 983 transitions. [2022-11-02 20:49:04,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.3) internal successors, (983), 10 states have internal predecessors, (983), 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-02 20:49:04,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-02 20:49:04,790 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-02 20:49:04,790 INFO L175 Difference]: Start difference. First operand has 128 places, 96 transitions, 237 flow. Second operand 10 states and 983 transitions. [2022-11-02 20:49:04,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 149 transitions, 489 flow [2022-11-02 20:49:04,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 149 transitions, 480 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-02 20:49:04,803 INFO L231 Difference]: Finished difference. Result has 121 places, 100 transitions, 290 flow [2022-11-02 20:49:04,803 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=290, PETRI_PLACES=121, PETRI_TRANSITIONS=100} [2022-11-02 20:49:04,806 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 3 predicate places. [2022-11-02 20:49:04,806 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 100 transitions, 290 flow [2022-11-02 20:49:04,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-02 20:49:04,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:04,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:04,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:49:04,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1439183109, now seen corresponding path program 1 times [2022-11-02 20:49:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:04,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023102941] [2022-11-02 20:49:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:05,193 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-02 20:49:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:05,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023102941] [2022-11-02 20:49:05,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023102941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:05,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:05,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:49:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087077331] [2022-11-02 20:49:05,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:05,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:49:05,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:49:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:05,206 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-02 20:49:05,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 100 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 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-02 20:49:05,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:05,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-02 20:49:05,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:05,705 INFO L130 PetriNetUnfolder]: 277/785 cut-off events. [2022-11-02 20:49:05,705 INFO L131 PetriNetUnfolder]: For 893/899 co-relation queries the response was YES. [2022-11-02 20:49:05,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 785 events. 277/785 cut-off events. For 893/899 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4667 event pairs, 18 based on Foata normal form. 22/794 useless extension candidates. Maximal degree in co-relation 2061. Up to 205 conditions per place. [2022-11-02 20:49:05,713 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 41 selfloop transitions, 18 changer transitions 20/157 dead transitions. [2022-11-02 20:49:05,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 157 transitions, 717 flow [2022-11-02 20:49:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:49:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:49:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1082 transitions. [2022-11-02 20:49:05,718 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704746580852776 [2022-11-02 20:49:05,718 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1082 transitions. [2022-11-02 20:49:05,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1082 transitions. [2022-11-02 20:49:05,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:05,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1082 transitions. [2022-11-02 20:49:05,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.36363636363636) internal successors, (1082), 11 states have internal predecessors, (1082), 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-02 20:49:05,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-02 20:49:05,732 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-02 20:49:05,732 INFO L175 Difference]: Start difference. First operand has 121 places, 100 transitions, 290 flow. Second operand 11 states and 1082 transitions. [2022-11-02 20:49:05,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 157 transitions, 717 flow [2022-11-02 20:49:05,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 157 transitions, 701 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-02 20:49:05,746 INFO L231 Difference]: Finished difference. Result has 129 places, 115 transitions, 467 flow [2022-11-02 20:49:05,747 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=467, PETRI_PLACES=129, PETRI_TRANSITIONS=115} [2022-11-02 20:49:05,749 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2022-11-02 20:49:05,750 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 115 transitions, 467 flow [2022-11-02 20:49:05,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 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-02 20:49:05,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:05,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:05,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:49:05,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1913570149, now seen corresponding path program 1 times [2022-11-02 20:49:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:05,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378957334] [2022-11-02 20:49:05,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:05,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:06,168 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-02 20:49:06,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:06,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378957334] [2022-11-02 20:49:06,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378957334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:06,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:06,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:49:06,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066722733] [2022-11-02 20:49:06,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:06,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:49:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:06,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:49:06,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:06,172 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-02 20:49:06,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 115 transitions, 467 flow. Second operand has 7 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 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-02 20:49:06,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:06,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-02 20:49:06,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:06,849 INFO L130 PetriNetUnfolder]: 274/1316 cut-off events. [2022-11-02 20:49:06,850 INFO L131 PetriNetUnfolder]: For 2459/2540 co-relation queries the response was YES. [2022-11-02 20:49:06,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 1316 events. 274/1316 cut-off events. For 2459/2540 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10770 event pairs, 14 based on Foata normal form. 18/1287 useless extension candidates. Maximal degree in co-relation 3649. Up to 302 conditions per place. [2022-11-02 20:49:06,867 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 45 selfloop transitions, 13 changer transitions 35/185 dead transitions. [2022-11-02 20:49:06,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 185 transitions, 919 flow [2022-11-02 20:49:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:49:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:49:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1309 transitions. [2022-11-02 20:49:06,872 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.827433628318584 [2022-11-02 20:49:06,872 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1309 transitions. [2022-11-02 20:49:06,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1309 transitions. [2022-11-02 20:49:06,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:06,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1309 transitions. [2022-11-02 20:49:06,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.5) internal successors, (1309), 14 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:06,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-02 20:49:06,885 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-02 20:49:06,885 INFO L175 Difference]: Start difference. First operand has 129 places, 115 transitions, 467 flow. Second operand 14 states and 1309 transitions. [2022-11-02 20:49:06,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 185 transitions, 919 flow [2022-11-02 20:49:06,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 185 transitions, 865 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-11-02 20:49:06,918 INFO L231 Difference]: Finished difference. Result has 152 places, 126 transitions, 567 flow [2022-11-02 20:49:06,918 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=567, PETRI_PLACES=152, PETRI_TRANSITIONS=126} [2022-11-02 20:49:06,921 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2022-11-02 20:49:06,921 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 126 transitions, 567 flow [2022-11-02 20:49:06,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 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-02 20:49:06,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:06,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:06,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:49:06,922 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:06,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1872371815, now seen corresponding path program 2 times [2022-11-02 20:49:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:06,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026563655] [2022-11-02 20:49:06,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:06,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:07,344 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-02 20:49:07,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:07,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026563655] [2022-11-02 20:49:07,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026563655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:07,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:07,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:49:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791813355] [2022-11-02 20:49:07,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:07,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:49:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:49:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:49:07,347 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-02 20:49:07,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 126 transitions, 567 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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-02 20:49:07,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:07,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-02 20:49:07,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:08,178 INFO L130 PetriNetUnfolder]: 562/1630 cut-off events. [2022-11-02 20:49:08,178 INFO L131 PetriNetUnfolder]: For 3492/3594 co-relation queries the response was YES. [2022-11-02 20:49:08,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5213 conditions, 1630 events. 562/1630 cut-off events. For 3492/3594 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13151 event pairs, 38 based on Foata normal form. 66/1652 useless extension candidates. Maximal degree in co-relation 5178. Up to 228 conditions per place. [2022-11-02 20:49:08,193 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 33 selfloop transitions, 20 changer transitions 35/173 dead transitions. [2022-11-02 20:49:08,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 173 transitions, 1013 flow [2022-11-02 20:49:08,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:49:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:49:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1346 transitions. [2022-11-02 20:49:08,197 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8508217446270544 [2022-11-02 20:49:08,198 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1346 transitions. [2022-11-02 20:49:08,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1346 transitions. [2022-11-02 20:49:08,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:08,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1346 transitions. [2022-11-02 20:49:08,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.14285714285714) internal successors, (1346), 14 states have internal predecessors, (1346), 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-02 20:49:08,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-02 20:49:08,209 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-02 20:49:08,209 INFO L175 Difference]: Start difference. First operand has 152 places, 126 transitions, 567 flow. Second operand 14 states and 1346 transitions. [2022-11-02 20:49:08,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 173 transitions, 1013 flow [2022-11-02 20:49:08,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 173 transitions, 877 flow, removed 68 selfloop flow, removed 12 redundant places. [2022-11-02 20:49:08,242 INFO L231 Difference]: Finished difference. Result has 151 places, 122 transitions, 530 flow [2022-11-02 20:49:08,243 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=530, PETRI_PLACES=151, PETRI_TRANSITIONS=122} [2022-11-02 20:49:08,246 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-11-02 20:49:08,247 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 122 transitions, 530 flow [2022-11-02 20:49:08,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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-02 20:49:08,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:08,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:08,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:49:08,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1873777632, now seen corresponding path program 1 times [2022-11-02 20:49:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:08,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267086407] [2022-11-02 20:49:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:08,638 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-02 20:49:08,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:08,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267086407] [2022-11-02 20:49:08,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267086407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:08,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:08,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:49:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529773279] [2022-11-02 20:49:08,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:08,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:49:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:08,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:49:08,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:08,648 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-02 20:49:08,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 122 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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-02 20:49:08,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:08,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-02 20:49:08,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:09,077 INFO L130 PetriNetUnfolder]: 177/1318 cut-off events. [2022-11-02 20:49:09,078 INFO L131 PetriNetUnfolder]: For 3058/3118 co-relation queries the response was YES. [2022-11-02 20:49:09,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3883 conditions, 1318 events. 177/1318 cut-off events. For 3058/3118 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13293 event pairs, 4 based on Foata normal form. 5/1255 useless extension candidates. Maximal degree in co-relation 3802. Up to 201 conditions per place. [2022-11-02 20:49:09,089 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 19 selfloop transitions, 4 changer transitions 19/136 dead transitions. [2022-11-02 20:49:09,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 136 transitions, 666 flow [2022-11-02 20:49:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:49:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:49:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2022-11-02 20:49:09,092 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8305941845764855 [2022-11-02 20:49:09,092 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 657 transitions. [2022-11-02 20:49:09,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 657 transitions. [2022-11-02 20:49:09,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:09,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 657 transitions. [2022-11-02 20:49:09,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 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-02 20:49:09,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-02 20:49:09,096 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-02 20:49:09,096 INFO L175 Difference]: Start difference. First operand has 151 places, 122 transitions, 530 flow. Second operand 7 states and 657 transitions. [2022-11-02 20:49:09,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 136 transitions, 666 flow [2022-11-02 20:49:09,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 136 transitions, 598 flow, removed 18 selfloop flow, removed 13 redundant places. [2022-11-02 20:49:09,133 INFO L231 Difference]: Finished difference. Result has 146 places, 116 transitions, 446 flow [2022-11-02 20:49:09,133 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=146, PETRI_TRANSITIONS=116} [2022-11-02 20:49:09,134 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 28 predicate places. [2022-11-02 20:49:09,134 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 116 transitions, 446 flow [2022-11-02 20:49:09,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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-02 20:49:09,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:09,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:09,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:49:09,135 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1173459440, now seen corresponding path program 2 times [2022-11-02 20:49:09,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:09,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651986685] [2022-11-02 20:49:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:09,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:09,948 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-02 20:49:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:09,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651986685] [2022-11-02 20:49:09,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651986685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:09,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:09,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:49:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053918163] [2022-11-02 20:49:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:09,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:49:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:49:09,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:49:09,956 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-11-02 20:49:09,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 116 transitions, 446 flow. Second operand has 9 states, 9 states have (on average 90.22222222222223) internal successors, (812), 9 states have internal predecessors, (812), 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-02 20:49:09,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:09,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-11-02 20:49:09,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:10,249 INFO L130 PetriNetUnfolder]: 94/723 cut-off events. [2022-11-02 20:49:10,249 INFO L131 PetriNetUnfolder]: For 769/780 co-relation queries the response was YES. [2022-11-02 20:49:10,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 723 events. 94/723 cut-off events. For 769/780 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6158 event pairs, 0 based on Foata normal form. 4/697 useless extension candidates. Maximal degree in co-relation 1749. Up to 114 conditions per place. [2022-11-02 20:49:10,254 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 17 selfloop transitions, 4 changer transitions 15/123 dead transitions. [2022-11-02 20:49:10,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 123 transitions, 532 flow [2022-11-02 20:49:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:49:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:49:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 907 transitions. [2022-11-02 20:49:10,257 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8026548672566372 [2022-11-02 20:49:10,257 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 907 transitions. [2022-11-02 20:49:10,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 907 transitions. [2022-11-02 20:49:10,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:10,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 907 transitions. [2022-11-02 20:49:10,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 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-02 20:49:10,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-02 20:49:10,263 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-02 20:49:10,264 INFO L175 Difference]: Start difference. First operand has 146 places, 116 transitions, 446 flow. Second operand 10 states and 907 transitions. [2022-11-02 20:49:10,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 123 transitions, 532 flow [2022-11-02 20:49:10,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 123 transitions, 489 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-11-02 20:49:10,273 INFO L231 Difference]: Finished difference. Result has 147 places, 108 transitions, 365 flow [2022-11-02 20:49:10,273 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=365, PETRI_PLACES=147, PETRI_TRANSITIONS=108} [2022-11-02 20:49:10,274 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 29 predicate places. [2022-11-02 20:49:10,274 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 108 transitions, 365 flow [2022-11-02 20:49:10,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.22222222222223) internal successors, (812), 9 states have internal predecessors, (812), 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-02 20:49:10,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:10,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:10,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:49:10,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -79553584, now seen corresponding path program 3 times [2022-11-02 20:49:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:10,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756669753] [2022-11-02 20:49:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,634 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-02 20:49:10,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:10,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756669753] [2022-11-02 20:49:10,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756669753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:10,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:10,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:49:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207500061] [2022-11-02 20:49:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:10,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:49:10,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:49:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:10,638 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-02 20:49:10,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 108 transitions, 365 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:10,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:10,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-02 20:49:10,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:10,873 INFO L130 PetriNetUnfolder]: 66/516 cut-off events. [2022-11-02 20:49:10,873 INFO L131 PetriNetUnfolder]: For 443/445 co-relation queries the response was YES. [2022-11-02 20:49:10,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 516 events. 66/516 cut-off events. For 443/445 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3781 event pairs, 1 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 1065. Up to 96 conditions per place. [2022-11-02 20:49:10,877 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 16 selfloop transitions, 1 changer transitions 19/118 dead transitions. [2022-11-02 20:49:10,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 118 transitions, 474 flow [2022-11-02 20:49:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:49:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:49:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 666 transitions. [2022-11-02 20:49:10,879 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8419721871049305 [2022-11-02 20:49:10,879 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 666 transitions. [2022-11-02 20:49:10,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 666 transitions. [2022-11-02 20:49:10,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:10,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 666 transitions. [2022-11-02 20:49:10,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:10,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-02 20:49:10,884 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-02 20:49:10,884 INFO L175 Difference]: Start difference. First operand has 147 places, 108 transitions, 365 flow. Second operand 7 states and 666 transitions. [2022-11-02 20:49:10,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 118 transitions, 474 flow [2022-11-02 20:49:10,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 118 transitions, 416 flow, removed 13 selfloop flow, removed 14 redundant places. [2022-11-02 20:49:10,891 INFO L231 Difference]: Finished difference. Result has 133 places, 99 transitions, 277 flow [2022-11-02 20:49:10,891 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=133, PETRI_TRANSITIONS=99} [2022-11-02 20:49:10,892 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 15 predicate places. [2022-11-02 20:49:10,892 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 99 transitions, 277 flow [2022-11-02 20:49:10,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:10,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:10,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:10,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:49:10,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:49:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -512053220, now seen corresponding path program 4 times [2022-11-02 20:49:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:10,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273590740] [2022-11-02 20:49:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:49:10,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:49:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:49:11,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:49:11,028 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:49:11,029 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-02 20:49:11,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-02 20:49:11,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-02 20:49:11,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-02 20:49:11,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-02 20:49:11,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 20:49:11,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:49:11,032 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-11-02 20:49:11,039 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:49:11,039 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:49:11,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:49:11 BasicIcfg [2022-11-02 20:49:11,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:49:11,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:49:11,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:49:11,205 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:49:11,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:01" (3/4) ... [2022-11-02 20:49:11,207 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:49:11,350 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:49:11,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:49:11,351 INFO L158 Benchmark]: Toolchain (without parser) took 12878.58ms. Allocated memory was 119.5MB in the beginning and 323.0MB in the end (delta: 203.4MB). Free memory was 77.4MB in the beginning and 275.0MB in the end (delta: -197.6MB). Peak memory consumption was 180.6MB. Max. memory is 16.1GB. [2022-11-02 20:49:11,351 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 119.5MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:49:11,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 805.95ms. Allocated memory is still 119.5MB. Free memory was 77.2MB in the beginning and 82.2MB in the end (delta: -5.0MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2022-11-02 20:49:11,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.60ms. Allocated memory is still 119.5MB. Free memory was 82.2MB in the beginning and 80.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:49:11,353 INFO L158 Benchmark]: Boogie Preprocessor took 71.46ms. Allocated memory is still 119.5MB. Free memory was 80.1MB in the beginning and 77.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:49:11,353 INFO L158 Benchmark]: RCFGBuilder took 1658.68ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 77.6MB in the beginning and 73.8MB in the end (delta: 3.8MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2022-11-02 20:49:11,354 INFO L158 Benchmark]: TraceAbstraction took 10086.08ms. Allocated memory was 161.5MB in the beginning and 323.0MB in the end (delta: 161.5MB). Free memory was 73.8MB in the beginning and 117.9MB in the end (delta: -44.1MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. [2022-11-02 20:49:11,354 INFO L158 Benchmark]: Witness Printer took 145.98ms. Allocated memory is still 323.0MB. Free memory was 117.9MB in the beginning and 275.0MB in the end (delta: -157.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-11-02 20:49:11,356 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.36ms. Allocated memory is still 119.5MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 805.95ms. Allocated memory is still 119.5MB. Free memory was 77.2MB in the beginning and 82.2MB in the end (delta: -5.0MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.60ms. Allocated memory is still 119.5MB. Free memory was 82.2MB in the beginning and 80.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.46ms. Allocated memory is still 119.5MB. Free memory was 80.1MB in the beginning and 77.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1658.68ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 77.6MB in the beginning and 73.8MB in the end (delta: 3.8MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10086.08ms. Allocated memory was 161.5MB in the beginning and 323.0MB in the end (delta: 161.5MB). Free memory was 73.8MB in the beginning and 117.9MB in the end (delta: -44.1MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. * Witness Printer took 145.98ms. Allocated memory is still 323.0MB. Free memory was 117.9MB in the beginning and 275.0MB in the end (delta: -157.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t2577; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=7, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t2578; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=8, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t2579; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=9, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L838] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 830]: 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: 832]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 813 IncrementalHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 85 mSDtfsCounter, 813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=567occurred in iteration=5, InterpolantAutomatonStates: 85, 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.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 799 NumberOfCodeBlocks, 799 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 2038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-02 20:49:11,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6109811d-2f26-4b8d-af47-67ba3add3130/bin/uautomizer-Dbtcem3rbc/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