./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ --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 ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 --- 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-dbf71c6-m [2022-10-17 10:36:01,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:36:01,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:36:01,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:36:01,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:36:01,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:36:01,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:36:01,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:36:01,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:36:01,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:36:01,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:36:01,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:36:01,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:36:01,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:36:01,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:36:01,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:36:01,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:36:01,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:36:01,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:36:01,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:36:01,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:36:01,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:36:01,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:36:01,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:36:01,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:36:01,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:36:01,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:36:01,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:36:01,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:36:01,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:36:01,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:36:01,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:36:01,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:36:01,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:36:01,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:36:01,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:36:01,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:36:01,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:36:01,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:36:01,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:36:01,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:36:01,364 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:36:01,411 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:36:01,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:36:01,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:36:01,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:36:01,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:36:01,422 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:36:01,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:36:01,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:36:01,423 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:36:01,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:36:01,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:36:01,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:36:01,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:36:01,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:36:01,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:36:01,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:36:01,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:36:01,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:36:01,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:36:01,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:36:01,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:36:01,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:36:01,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:36:01,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:36:01,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:36:01,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:36:01,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:36:01,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:36:01,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:36:01,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:36:01,428 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:36:01,428 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:36:01,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:36:01,429 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_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/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_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ 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 -> ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 [2022-10-17 10:36:01,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:36:01,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:36:01,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:36:01,684 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:36:01,685 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:36:01,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-10-17 10:36:01,753 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/data/a1083c50b/651b1b5867be4e49bc7a9243cd5e5b70/FLAG8ea54ab37 [2022-10-17 10:36:02,352 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:36:02,353 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-10-17 10:36:02,371 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/data/a1083c50b/651b1b5867be4e49bc7a9243cd5e5b70/FLAG8ea54ab37 [2022-10-17 10:36:02,581 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/data/a1083c50b/651b1b5867be4e49bc7a9243cd5e5b70 [2022-10-17 10:36:02,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:36:02,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:36:02,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:36:02,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:36:02,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:36:02,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:36:02" (1/1) ... [2022-10-17 10:36:02,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f225b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:02, skipping insertion in model container [2022-10-17 10:36:02,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:36:02" (1/1) ... [2022-10-17 10:36:02,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:36:02,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:36:02,797 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_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-10-17 10:36:02,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:36:02,997 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:36:03,010 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_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-10-17 10:36:03,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:36:03,106 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:36:03,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03 WrapperNode [2022-10-17 10:36:03,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:36:03,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:36:03,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:36:03,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:36:03,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,174 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-10-17 10:36:03,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:36:03,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:36:03,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:36:03,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:36:03,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,228 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:36:03,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:36:03,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:36:03,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:36:03,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (1/1) ... [2022-10-17 10:36:03,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:36:03,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:36:03,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:36:03,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:36:03,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:36:03,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:36:03,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:36:03,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:36:03,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:36:03,371 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 10:36:03,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 10:36:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 10:36:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 10:36:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 10:36:03,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 10:36:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:36:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:36:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:36:03,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:36:03,378 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:36:03,593 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:36:03,596 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:36:04,440 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:36:05,080 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:36:05,080 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:36:05,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:36:05 BoogieIcfgContainer [2022-10-17 10:36:05,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:36:05,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:36:05,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:36:05,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:36:05,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:36:02" (1/3) ... [2022-10-17 10:36:05,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1172420f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:36:05, skipping insertion in model container [2022-10-17 10:36:05,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:36:03" (2/3) ... [2022-10-17 10:36:05,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1172420f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:36:05, skipping insertion in model container [2022-10-17 10:36:05,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:36:05" (3/3) ... [2022-10-17 10:36:05,096 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-10-17 10:36:05,106 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:36:05,117 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:36:05,118 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:36:05,118 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:36:05,222 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 10:36:05,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-10-17 10:36:05,377 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-10-17 10:36:05,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:36:05,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-10-17 10:36:05,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-10-17 10:36:05,391 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-10-17 10:36:05,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:36:05,428 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;@1a8d004c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:36:05,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 10:36:05,447 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-10-17 10:36:05,447 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:36:05,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:05,448 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] [2022-10-17 10:36:05,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1923181394, now seen corresponding path program 1 times [2022-10-17 10:36:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:05,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69138790] [2022-10-17 10:36:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:05,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:06,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69138790] [2022-10-17 10:36:06,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69138790] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:06,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:06,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:36:06,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861636140] [2022-10-17 10:36:06,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:06,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:36:06,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:06,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:36:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:36:06,214 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2022-10-17 10:36:06,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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-10-17 10:36:06,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:06,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2022-10-17 10:36:06,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:06,553 INFO L130 PetriNetUnfolder]: 58/276 cut-off events. [2022-10-17 10:36:06,553 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-10-17 10:36:06,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 276 events. 58/276 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1086 event pairs, 10 based on Foata normal form. 17/274 useless extension candidates. Maximal degree in co-relation 353. Up to 79 conditions per place. [2022-10-17 10:36:06,562 INFO L137 encePairwiseOnDemand]: 110/115 looper letters, 14 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2022-10-17 10:36:06,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 114 transitions, 275 flow [2022-10-17 10:36:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:36:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:36:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-10-17 10:36:06,588 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087 [2022-10-17 10:36:06,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2022-10-17 10:36:06,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2022-10-17 10:36:06,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:06,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2022-10-17 10:36:06,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-10-17 10:36:06,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-10-17 10:36:06,619 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-10-17 10:36:06,621 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 324 transitions. [2022-10-17 10:36:06,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 114 transitions, 275 flow [2022-10-17 10:36:06,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:36:06,639 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-10-17 10:36:06,642 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-10-17 10:36:06,646 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-10-17 10:36:06,646 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-10-17 10:36:06,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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-10-17 10:36:06,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:06,647 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-10-17 10:36:06,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:36:06,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1437227612, now seen corresponding path program 1 times [2022-10-17 10:36:06,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:06,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604528121] [2022-10-17 10:36:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:06,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604528121] [2022-10-17 10:36:07,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604528121] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:07,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:07,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:36:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013885658] [2022-10-17 10:36:07,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:07,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:36:07,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:36:07,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:36:07,225 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-10-17 10:36:07,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 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-10-17 10:36:07,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:07,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-10-17 10:36:07,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:08,302 INFO L130 PetriNetUnfolder]: 834/2353 cut-off events. [2022-10-17 10:36:08,302 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-10-17 10:36:08,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3778 conditions, 2353 events. 834/2353 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17917 event pairs, 376 based on Foata normal form. 0/2269 useless extension candidates. Maximal degree in co-relation 3726. Up to 732 conditions per place. [2022-10-17 10:36:08,323 INFO L137 encePairwiseOnDemand]: 108/115 looper letters, 23 selfloop transitions, 3 changer transitions 57/161 dead transitions. [2022-10-17 10:36:08,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 161 transitions, 494 flow [2022-10-17 10:36:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:36:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:36:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 902 transitions. [2022-10-17 10:36:08,328 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8714975845410629 [2022-10-17 10:36:08,329 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 902 transitions. [2022-10-17 10:36:08,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 902 transitions. [2022-10-17 10:36:08,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:08,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 902 transitions. [2022-10-17 10:36:08,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 0 states have call successors, (0), 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-10-17 10:36:08,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 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-10-17 10:36:08,340 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 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-10-17 10:36:08,340 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 902 transitions. [2022-10-17 10:36:08,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 161 transitions, 494 flow [2022-10-17 10:36:08,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 161 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:36:08,346 INFO L231 Difference]: Finished difference. Result has 130 places, 98 transitions, 241 flow [2022-10-17 10:36:08,347 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=241, PETRI_PLACES=130, PETRI_TRANSITIONS=98} [2022-10-17 10:36:08,348 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-10-17 10:36:08,348 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 98 transitions, 241 flow [2022-10-17 10:36:08,349 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-10-17 10:36:08,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:08,349 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-10-17 10:36:08,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:36:08,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:08,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash -522757955, now seen corresponding path program 1 times [2022-10-17 10:36:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101117942] [2022-10-17 10:36:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:08,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101117942] [2022-10-17 10:36:08,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101117942] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:08,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:08,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:36:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360215801] [2022-10-17 10:36:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:08,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:36:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:36:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:36:08,854 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-10-17 10:36:08,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 98 transitions, 241 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-10-17 10:36:08,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:08,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-10-17 10:36:08,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:09,902 INFO L130 PetriNetUnfolder]: 1096/2304 cut-off events. [2022-10-17 10:36:09,903 INFO L131 PetriNetUnfolder]: For 469/469 co-relation queries the response was YES. [2022-10-17 10:36:09,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4531 conditions, 2304 events. 1096/2304 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15700 event pairs, 92 based on Foata normal form. 0/2209 useless extension candidates. Maximal degree in co-relation 4472. Up to 559 conditions per place. [2022-10-17 10:36:09,932 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 62 selfloop transitions, 15 changer transitions 10/165 dead transitions. [2022-10-17 10:36:09,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 165 transitions, 553 flow [2022-10-17 10:36:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:36:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:36:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 999 transitions. [2022-10-17 10:36:09,938 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8686956521739131 [2022-10-17 10:36:09,938 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 999 transitions. [2022-10-17 10:36:09,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 999 transitions. [2022-10-17 10:36:09,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:09,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 999 transitions. [2022-10-17 10:36:09,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.9) internal successors, (999), 10 states have internal predecessors, (999), 0 states have call successors, (0), 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-10-17 10:36:09,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-10-17 10:36:09,951 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-10-17 10:36:09,951 INFO L175 Difference]: Start difference. First operand has 130 places, 98 transitions, 241 flow. Second operand 10 states and 999 transitions. [2022-10-17 10:36:09,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 165 transitions, 553 flow [2022-10-17 10:36:09,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 165 transitions, 544 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-10-17 10:36:09,970 INFO L231 Difference]: Finished difference. Result has 123 places, 111 transitions, 341 flow [2022-10-17 10:36:09,970 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=341, PETRI_PLACES=123, PETRI_TRANSITIONS=111} [2022-10-17 10:36:09,973 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 3 predicate places. [2022-10-17 10:36:09,974 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 111 transitions, 341 flow [2022-10-17 10:36:09,975 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-10-17 10:36:09,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:09,975 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] [2022-10-17 10:36:09,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:36:09,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash 530243215, now seen corresponding path program 1 times [2022-10-17 10:36:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:09,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315308617] [2022-10-17 10:36:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:09,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:10,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315308617] [2022-10-17 10:36:10,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315308617] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:10,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:10,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:36:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679198132] [2022-10-17 10:36:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:10,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:36:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:10,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:36:10,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:36:10,384 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-10-17 10:36:10,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 111 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 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-10-17 10:36:10,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:10,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-10-17 10:36:10,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:11,418 INFO L130 PetriNetUnfolder]: 892/2772 cut-off events. [2022-10-17 10:36:11,418 INFO L131 PetriNetUnfolder]: For 1873/1971 co-relation queries the response was YES. [2022-10-17 10:36:11,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6391 conditions, 2772 events. 892/2772 cut-off events. For 1873/1971 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 24110 event pairs, 244 based on Foata normal form. 57/2684 useless extension candidates. Maximal degree in co-relation 6325. Up to 681 conditions per place. [2022-10-17 10:36:11,449 INFO L137 encePairwiseOnDemand]: 106/115 looper letters, 38 selfloop transitions, 10 changer transitions 33/169 dead transitions. [2022-10-17 10:36:11,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 169 transitions, 697 flow [2022-10-17 10:36:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:36:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:36:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-10-17 10:36:11,454 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.851207729468599 [2022-10-17 10:36:11,454 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2022-10-17 10:36:11,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2022-10-17 10:36:11,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:11,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2022-10-17 10:36:11,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 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-10-17 10:36:11,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 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-10-17 10:36:11,465 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 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-10-17 10:36:11,465 INFO L175 Difference]: Start difference. First operand has 123 places, 111 transitions, 341 flow. Second operand 9 states and 881 transitions. [2022-10-17 10:36:11,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 169 transitions, 697 flow [2022-10-17 10:36:11,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 169 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-10-17 10:36:11,484 INFO L231 Difference]: Finished difference. Result has 138 places, 119 transitions, 455 flow [2022-10-17 10:36:11,485 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=455, PETRI_PLACES=138, PETRI_TRANSITIONS=119} [2022-10-17 10:36:11,488 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 18 predicate places. [2022-10-17 10:36:11,488 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 119 transitions, 455 flow [2022-10-17 10:36:11,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 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-10-17 10:36:11,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:11,489 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] [2022-10-17 10:36:11,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:36:11,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2030612187, now seen corresponding path program 1 times [2022-10-17 10:36:11,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:11,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379672172] [2022-10-17 10:36:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:11,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379672172] [2022-10-17 10:36:11,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379672172] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:11,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:11,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:36:11,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248509473] [2022-10-17 10:36:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:11,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:36:11,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:11,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:36:11,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:36:11,809 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-10-17 10:36:11,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 119 transitions, 455 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 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-10-17 10:36:11,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:11,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-10-17 10:36:11,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:13,349 INFO L130 PetriNetUnfolder]: 1988/4122 cut-off events. [2022-10-17 10:36:13,350 INFO L131 PetriNetUnfolder]: For 6743/6964 co-relation queries the response was YES. [2022-10-17 10:36:13,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12251 conditions, 4122 events. 1988/4122 cut-off events. For 6743/6964 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 31690 event pairs, 155 based on Foata normal form. 90/4103 useless extension candidates. Maximal degree in co-relation 12178. Up to 706 conditions per place. [2022-10-17 10:36:13,390 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 73 selfloop transitions, 26 changer transitions 36/217 dead transitions. [2022-10-17 10:36:13,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 217 transitions, 1195 flow [2022-10-17 10:36:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:36:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:36:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1300 transitions. [2022-10-17 10:36:13,396 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2022-10-17 10:36:13,396 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1300 transitions. [2022-10-17 10:36:13,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1300 transitions. [2022-10-17 10:36:13,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:13,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1300 transitions. [2022-10-17 10:36:13,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.0) internal successors, (1300), 13 states have internal predecessors, (1300), 0 states have call successors, (0), 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-10-17 10:36:13,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 0 states have call successors, (0), 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-10-17 10:36:13,408 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 0 states have call successors, (0), 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-10-17 10:36:13,408 INFO L175 Difference]: Start difference. First operand has 138 places, 119 transitions, 455 flow. Second operand 13 states and 1300 transitions. [2022-10-17 10:36:13,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 217 transitions, 1195 flow [2022-10-17 10:36:13,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 217 transitions, 1185 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-10-17 10:36:13,452 INFO L231 Difference]: Finished difference. Result has 150 places, 131 transitions, 634 flow [2022-10-17 10:36:13,453 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=634, PETRI_PLACES=150, PETRI_TRANSITIONS=131} [2022-10-17 10:36:13,455 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 30 predicate places. [2022-10-17 10:36:13,455 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 131 transitions, 634 flow [2022-10-17 10:36:13,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 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-10-17 10:36:13,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:13,456 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] [2022-10-17 10:36:13,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:36:13,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash -453572812, now seen corresponding path program 1 times [2022-10-17 10:36:13,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:13,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205622327] [2022-10-17 10:36:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:13,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:13,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:13,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205622327] [2022-10-17 10:36:13,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205622327] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:13,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:13,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:36:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120240923] [2022-10-17 10:36:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:13,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:36:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:13,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:36:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:36:13,858 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-10-17 10:36:13,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 131 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 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-10-17 10:36:13,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:13,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-10-17 10:36:13,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:15,532 INFO L130 PetriNetUnfolder]: 1757/3716 cut-off events. [2022-10-17 10:36:15,532 INFO L131 PetriNetUnfolder]: For 9593/9826 co-relation queries the response was YES. [2022-10-17 10:36:15,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12640 conditions, 3716 events. 1757/3716 cut-off events. For 9593/9826 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 29734 event pairs, 148 based on Foata normal form. 47/3656 useless extension candidates. Maximal degree in co-relation 12561. Up to 567 conditions per place. [2022-10-17 10:36:15,576 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 62 selfloop transitions, 30 changer transitions 34/208 dead transitions. [2022-10-17 10:36:15,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 208 transitions, 1272 flow [2022-10-17 10:36:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-17 10:36:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-10-17 10:36:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1558 transitions. [2022-10-17 10:36:15,583 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8467391304347827 [2022-10-17 10:36:15,583 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1558 transitions. [2022-10-17 10:36:15,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1558 transitions. [2022-10-17 10:36:15,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:15,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1558 transitions. [2022-10-17 10:36:15,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 97.375) internal successors, (1558), 16 states have internal predecessors, (1558), 0 states have call successors, (0), 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-10-17 10:36:15,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 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-10-17 10:36:15,597 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 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-10-17 10:36:15,597 INFO L175 Difference]: Start difference. First operand has 150 places, 131 transitions, 634 flow. Second operand 16 states and 1558 transitions. [2022-10-17 10:36:15,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 208 transitions, 1272 flow [2022-10-17 10:36:15,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 208 transitions, 1138 flow, removed 46 selfloop flow, removed 9 redundant places. [2022-10-17 10:36:15,774 INFO L231 Difference]: Finished difference. Result has 160 places, 132 transitions, 626 flow [2022-10-17 10:36:15,774 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=626, PETRI_PLACES=160, PETRI_TRANSITIONS=132} [2022-10-17 10:36:15,775 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 40 predicate places. [2022-10-17 10:36:15,775 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 132 transitions, 626 flow [2022-10-17 10:36:15,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 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-10-17 10:36:15,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:15,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:15,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:36:15,777 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1125463742, now seen corresponding path program 1 times [2022-10-17 10:36:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:15,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333941949] [2022-10-17 10:36:15,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:15,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:16,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:16,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333941949] [2022-10-17 10:36:16,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333941949] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:16,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:16,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 10:36:17,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105614105] [2022-10-17 10:36:17,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:17,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:36:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:36:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:36:17,007 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2022-10-17 10:36:17,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 132 transitions, 626 flow. Second operand has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 11 states have internal predecessors, (980), 0 states have call successors, (0), 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-10-17 10:36:17,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:17,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2022-10-17 10:36:17,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:17,696 INFO L130 PetriNetUnfolder]: 381/2214 cut-off events. [2022-10-17 10:36:17,696 INFO L131 PetriNetUnfolder]: For 5969/6126 co-relation queries the response was YES. [2022-10-17 10:36:17,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6999 conditions, 2214 events. 381/2214 cut-off events. For 5969/6126 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 24612 event pairs, 13 based on Foata normal form. 1/2103 useless extension candidates. Maximal degree in co-relation 6910. Up to 301 conditions per place. [2022-10-17 10:36:17,726 INFO L137 encePairwiseOnDemand]: 104/115 looper letters, 29 selfloop transitions, 6 changer transitions 11/154 dead transitions. [2022-10-17 10:36:17,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 154 transitions, 792 flow [2022-10-17 10:36:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:36:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:36:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1001 transitions. [2022-10-17 10:36:17,731 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7913043478260869 [2022-10-17 10:36:17,731 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1001 transitions. [2022-10-17 10:36:17,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1001 transitions. [2022-10-17 10:36:17,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:17,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1001 transitions. [2022-10-17 10:36:17,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 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-10-17 10:36:17,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 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-10-17 10:36:17,739 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 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-10-17 10:36:17,739 INFO L175 Difference]: Start difference. First operand has 160 places, 132 transitions, 626 flow. Second operand 11 states and 1001 transitions. [2022-10-17 10:36:17,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 154 transitions, 792 flow [2022-10-17 10:36:17,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 154 transitions, 677 flow, removed 27 selfloop flow, removed 18 redundant places. [2022-10-17 10:36:17,900 INFO L231 Difference]: Finished difference. Result has 155 places, 134 transitions, 562 flow [2022-10-17 10:36:17,901 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=562, PETRI_PLACES=155, PETRI_TRANSITIONS=134} [2022-10-17 10:36:17,901 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 35 predicate places. [2022-10-17 10:36:17,902 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 134 transitions, 562 flow [2022-10-17 10:36:17,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 11 states have internal predecessors, (980), 0 states have call successors, (0), 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-10-17 10:36:17,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:17,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:17,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:36:17,903 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:17,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1351997540, now seen corresponding path program 2 times [2022-10-17 10:36:17,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:17,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745683324] [2022-10-17 10:36:17,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:17,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:19,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:19,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745683324] [2022-10-17 10:36:19,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745683324] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:19,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:19,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 10:36:19,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933777937] [2022-10-17 10:36:19,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:19,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:36:19,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:19,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:36:19,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:36:19,317 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-10-17 10:36:19,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 134 transitions, 562 flow. Second operand has 11 states, 11 states have (on average 84.54545454545455) internal successors, (930), 11 states have internal predecessors, (930), 0 states have call successors, (0), 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-10-17 10:36:19,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:19,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-10-17 10:36:19,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:20,293 INFO L130 PetriNetUnfolder]: 473/2618 cut-off events. [2022-10-17 10:36:20,293 INFO L131 PetriNetUnfolder]: For 3538/3564 co-relation queries the response was YES. [2022-10-17 10:36:20,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7021 conditions, 2618 events. 473/2618 cut-off events. For 3538/3564 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 30421 event pairs, 8 based on Foata normal form. 4/2501 useless extension candidates. Maximal degree in co-relation 6991. Up to 281 conditions per place. [2022-10-17 10:36:20,327 INFO L137 encePairwiseOnDemand]: 101/115 looper letters, 50 selfloop transitions, 21 changer transitions 15/183 dead transitions. [2022-10-17 10:36:20,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 183 transitions, 953 flow [2022-10-17 10:36:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:36:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-10-17 10:36:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1230 transitions. [2022-10-17 10:36:20,332 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7639751552795031 [2022-10-17 10:36:20,332 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1230 transitions. [2022-10-17 10:36:20,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1230 transitions. [2022-10-17 10:36:20,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:20,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1230 transitions. [2022-10-17 10:36:20,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 87.85714285714286) internal successors, (1230), 14 states have internal predecessors, (1230), 0 states have call successors, (0), 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-10-17 10:36:20,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 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-10-17 10:36:20,345 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 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-10-17 10:36:20,346 INFO L175 Difference]: Start difference. First operand has 155 places, 134 transitions, 562 flow. Second operand 14 states and 1230 transitions. [2022-10-17 10:36:20,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 183 transitions, 953 flow [2022-10-17 10:36:20,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 183 transitions, 903 flow, removed 16 selfloop flow, removed 9 redundant places. [2022-10-17 10:36:20,473 INFO L231 Difference]: Finished difference. Result has 159 places, 145 transitions, 655 flow [2022-10-17 10:36:20,474 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=655, PETRI_PLACES=159, PETRI_TRANSITIONS=145} [2022-10-17 10:36:20,476 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 39 predicate places. [2022-10-17 10:36:20,476 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 145 transitions, 655 flow [2022-10-17 10:36:20,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.54545454545455) internal successors, (930), 11 states have internal predecessors, (930), 0 states have call successors, (0), 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-10-17 10:36:20,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:20,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:20,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:36:20,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -231313458, now seen corresponding path program 3 times [2022-10-17 10:36:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:20,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330053722] [2022-10-17 10:36:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:36:20,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:36:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:36:20,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:36:20,758 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:36:20,759 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 10:36:20,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 10:36:20,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 10:36:20,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 10:36:20,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 10:36:20,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 10:36:20,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:36:20,763 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:20,770 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 10:36:20,770 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:36:20,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:36:20 BasicIcfg [2022-10-17 10:36:20,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:36:20,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:36:20,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:36:20,984 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:36:20,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:36:05" (3/4) ... [2022-10-17 10:36:20,986 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:36:21,140 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:36:21,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:36:21,141 INFO L158 Benchmark]: Toolchain (without parser) took 18556.60ms. Allocated memory was 94.4MB in the beginning and 518.0MB in the end (delta: 423.6MB). Free memory was 67.0MB in the beginning and 166.6MB in the end (delta: -99.6MB). Peak memory consumption was 327.7MB. Max. memory is 16.1GB. [2022-10-17 10:36:21,141 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:36:21,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.58ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 43.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-10-17 10:36:21,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.61ms. Allocated memory is still 94.4MB. Free memory was 43.8MB in the beginning and 41.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:36:21,143 INFO L158 Benchmark]: Boogie Preprocessor took 60.12ms. Allocated memory is still 94.4MB. Free memory was 41.2MB in the beginning and 39.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:36:21,143 INFO L158 Benchmark]: RCFGBuilder took 1847.56ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 38.8MB in the beginning and 90.5MB in the end (delta: -51.7MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-10-17 10:36:21,144 INFO L158 Benchmark]: TraceAbstraction took 15895.22ms. Allocated memory was 125.8MB in the beginning and 518.0MB in the end (delta: 392.2MB). Free memory was 89.5MB in the beginning and 201.3MB in the end (delta: -111.8MB). Peak memory consumption was 280.2MB. Max. memory is 16.1GB. [2022-10-17 10:36:21,144 INFO L158 Benchmark]: Witness Printer took 157.06ms. Allocated memory is still 518.0MB. Free memory was 201.3MB in the beginning and 166.6MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-10-17 10:36:21,146 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.58ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 43.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.61ms. Allocated memory is still 94.4MB. Free memory was 43.8MB in the beginning and 41.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.12ms. Allocated memory is still 94.4MB. Free memory was 41.2MB in the beginning and 39.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1847.56ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 38.8MB in the beginning and 90.5MB in the end (delta: -51.7MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15895.22ms. Allocated memory was 125.8MB in the beginning and 518.0MB in the end (delta: 392.2MB). Free memory was 89.5MB in the beginning and 201.3MB in the end (delta: -111.8MB). Peak memory consumption was 280.2MB. Max. memory is 16.1GB. * Witness Printer took 157.06ms. Allocated memory is still 518.0MB. Free memory was 201.3MB in the beginning and 166.6MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L722] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L723] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L724] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L725] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L726] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L727] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L728] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L729] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L730] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L731] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L732] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L733] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L734] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L735] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L736] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L737] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 pthread_t t1385; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1385, ((void *)0), P0, ((void *)0))=-2, t1385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1386; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1386, ((void *)0), P1, ((void *)0))=-1, t1385={5:0}, t1386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1387; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1387, ((void *)0), P2, ((void *)0))=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L800] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L801] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L802] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L804] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX = z [L807] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 834]: 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, 142 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: 15.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1110 IncrementalHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 82 mSDtfsCounter, 1110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=655occurred in iteration=8, 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, 4.7s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 2591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-10-17 10:36:21,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95ff27fe-d3d1-473a-bfa1-e2d2d59097e3/bin/uautomizer-J5u9QxTXDZ/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