./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/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_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/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_a33a109e-584e-4c43-bbca-f02399275c8d/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 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 --- 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:28:21,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:28:21,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:28:21,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:28:21,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:28:21,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:28:21,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:28:21,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:28:21,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:28:21,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:28:21,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:28:21,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:28:21,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:28:21,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:28:21,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:28:21,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:28:21,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:28:21,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:28:21,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:28:21,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:28:21,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:28:21,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:28:21,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:28:21,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:28:21,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:28:21,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:28:21,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:28:21,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:28:21,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:28:21,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:28:21,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:28:21,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:28:21,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:28:21,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:28:21,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:28:21,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:28:21,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:28:21,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:28:21,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:28:21,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:28:21,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:28:21,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:28:21,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:28:21,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:28:21,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:28:21,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:28:21,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:28:21,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:28:21,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:28:21,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:28:21,433 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:28:21,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:28:21,435 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:28:21,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:28:21,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:28:21,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:28:21,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:28:21,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:28:21,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:28:21,436 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:28:21,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:28:21,437 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:28:21,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:28:21,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:28:21,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:28:21,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:28:21,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:28:21,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:28:21,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:28:21,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:28:21,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:28:21,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:28:21,441 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:28:21,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:28:21,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:28:21,442 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_a33a109e-584e-4c43-bbca-f02399275c8d/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_a33a109e-584e-4c43-bbca-f02399275c8d/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 -> 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 [2022-10-17 10:28:21,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:28:21,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:28:21,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:28:21,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:28:21,786 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:28:21,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-10-17 10:28:21,846 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/data/2d999aa6c/eaf474ebec4a40c08c611b4a91a5d0df/FLAG7bacf3877 [2022-10-17 10:28:22,391 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:28:22,396 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-10-17 10:28:22,416 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/data/2d999aa6c/eaf474ebec4a40c08c611b4a91a5d0df/FLAG7bacf3877 [2022-10-17 10:28:22,659 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/data/2d999aa6c/eaf474ebec4a40c08c611b4a91a5d0df [2022-10-17 10:28:22,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:28:22,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:28:22,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:28:22,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:28:22,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:28:22,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:28:22" (1/1) ... [2022-10-17 10:28:22,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571fbb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:22, skipping insertion in model container [2022-10-17 10:28:22,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:28:22" (1/1) ... [2022-10-17 10:28:22,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:28:22,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:28:23,014 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_a33a109e-584e-4c43-bbca-f02399275c8d/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-10-17 10:28:23,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:28:23,291 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:28:23,308 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_a33a109e-584e-4c43-bbca-f02399275c8d/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-10-17 10:28:23,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:28:23,432 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:28:23,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23 WrapperNode [2022-10-17 10:28:23,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:28:23,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:28:23,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:28:23,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:28:23,442 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:28:23" (1/1) ... [2022-10-17 10:28:23,476 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:28:23" (1/1) ... [2022-10-17 10:28:23,517 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-10-17 10:28:23,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:28:23,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:28:23,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:28:23,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:28:23,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,572 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:28:23,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:28:23,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:28:23,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:28:23,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (1/1) ... [2022-10-17 10:28:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:28:23,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:28:23,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:28:23,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:28:23,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:28:23,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:28:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:28:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:28:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:28:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 10:28:23,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 10:28:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 10:28:23,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 10:28:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:28:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:28:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:28:23,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:28:23,687 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:28:23,830 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:28:23,832 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:28:24,480 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:28:24,986 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:28:24,986 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:28:24,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:28:24 BoogieIcfgContainer [2022-10-17 10:28:24,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:28:24,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:28:24,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:28:24,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:28:24,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:28:22" (1/3) ... [2022-10-17 10:28:24,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254e408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:28:24, skipping insertion in model container [2022-10-17 10:28:24,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:28:23" (2/3) ... [2022-10-17 10:28:24,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254e408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:28:24, skipping insertion in model container [2022-10-17 10:28:24,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:28:24" (3/3) ... [2022-10-17 10:28:24,998 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-10-17 10:28:25,010 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:28:25,020 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:28:25,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:28:25,020 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:28:25,093 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 10:28:25,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-10-17 10:28:25,185 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-10-17 10:28:25,186 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:28:25,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-10-17 10:28:25,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-10-17 10:28:25,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-10-17 10:28:25,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:28:25,210 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;@31931d42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:28:25,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-10-17 10:28:25,223 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-10-17 10:28:25,223 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:28:25,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:28:25,224 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] [2022-10-17 10:28:25,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 10:28:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:28:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash -551059526, now seen corresponding path program 1 times [2022-10-17 10:28:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:28:25,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031870340] [2022-10-17 10:28:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:28:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:28:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:28:25,894 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:28:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:28:25,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031870340] [2022-10-17 10:28:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031870340] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:28:25,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:28:25,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:28:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778764774] [2022-10-17 10:28:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:28:25,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:28:25,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:28:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:28:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:28:25,952 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2022-10-17 10:28:25,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:28:25,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:28:25,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2022-10-17 10:28:25,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:28:26,116 INFO L130 PetriNetUnfolder]: 18/149 cut-off events. [2022-10-17 10:28:26,116 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-10-17 10:28:26,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 149 events. 18/149 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 348 event pairs, 2 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 153. Up to 31 conditions per place. [2022-10-17 10:28:26,121 INFO L137 encePairwiseOnDemand]: 91/96 looper letters, 10 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-10-17 10:28:26,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 221 flow [2022-10-17 10:28:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:28:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:28:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2022-10-17 10:28:26,142 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9340277777777778 [2022-10-17 10:28:26,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2022-10-17 10:28:26,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2022-10-17 10:28:26,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:28:26,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2022-10-17 10:28:26,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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:28:26,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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:28:26,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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:28:26,168 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 194 flow. Second operand 3 states and 269 transitions. [2022-10-17 10:28:26,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 221 flow [2022-10-17 10:28:26,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:28:26,182 INFO L231 Difference]: Finished difference. Result has 97 places, 90 transitions, 188 flow [2022-10-17 10:28:26,184 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2022-10-17 10:28:26,188 INFO L287 CegarLoopForPetriNet]: 99 programPoint places, -2 predicate places. [2022-10-17 10:28:26,189 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 188 flow [2022-10-17 10:28:26,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:28:26,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:28:26,191 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] [2022-10-17 10:28:26,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:28:26,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 10:28:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:28:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash -271742079, now seen corresponding path program 1 times [2022-10-17 10:28:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:28:26,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703642414] [2022-10-17 10:28:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:28:26,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:28:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:28:26,601 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:28:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:28:26,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703642414] [2022-10-17 10:28:26,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703642414] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:28:26,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:28:26,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:28:26,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623845927] [2022-10-17 10:28:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:28:26,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:28:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:28:26,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:28:26,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:28:26,608 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2022-10-17 10:28:26,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 90 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 73.71428571428571) internal successors, (516), 7 states have internal predecessors, (516), 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:28:26,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:28:26,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2022-10-17 10:28:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:28:27,357 INFO L130 PetriNetUnfolder]: 370/1161 cut-off events. [2022-10-17 10:28:27,357 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-10-17 10:28:27,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 1161 events. 370/1161 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7756 event pairs, 67 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 1846. Up to 221 conditions per place. [2022-10-17 10:28:27,370 INFO L137 encePairwiseOnDemand]: 88/96 looper letters, 27 selfloop transitions, 4 changer transitions 64/156 dead transitions. [2022-10-17 10:28:27,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 156 transitions, 506 flow [2022-10-17 10:28:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:28:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:28:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1025 transitions. [2022-10-17 10:28:27,376 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8213141025641025 [2022-10-17 10:28:27,377 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1025 transitions. [2022-10-17 10:28:27,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1025 transitions. [2022-10-17 10:28:27,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:28:27,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1025 transitions. [2022-10-17 10:28:27,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 78.84615384615384) internal successors, (1025), 13 states have internal predecessors, (1025), 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:28:27,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 96.0) internal successors, (1344), 14 states have internal predecessors, (1344), 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:28:27,389 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 96.0) internal successors, (1344), 14 states have internal predecessors, (1344), 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:28:27,389 INFO L175 Difference]: Start difference. First operand has 97 places, 90 transitions, 188 flow. Second operand 13 states and 1025 transitions. [2022-10-17 10:28:27,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 156 transitions, 506 flow [2022-10-17 10:28:27,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 156 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:28:27,396 INFO L231 Difference]: Finished difference. Result has 119 places, 82 transitions, 222 flow [2022-10-17 10:28:27,397 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=222, PETRI_PLACES=119, PETRI_TRANSITIONS=82} [2022-10-17 10:28:27,398 INFO L287 CegarLoopForPetriNet]: 99 programPoint places, 20 predicate places. [2022-10-17 10:28:27,398 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 82 transitions, 222 flow [2022-10-17 10:28:27,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.71428571428571) internal successors, (516), 7 states have internal predecessors, (516), 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:28:27,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:28:27,399 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] [2022-10-17 10:28:27,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:28:27,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 10:28:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:28:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1330857853, now seen corresponding path program 1 times [2022-10-17 10:28:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:28:27,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976956868] [2022-10-17 10:28:27,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:28:27,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:28:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:28:27,812 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:28:27,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:28:27,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976956868] [2022-10-17 10:28:27,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976956868] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:28:27,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:28:27,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:28:27,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907023553] [2022-10-17 10:28:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:28:27,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:28:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:28:27,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:28:27,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:28:27,820 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2022-10-17 10:28:27,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 82 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 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:28:27,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:28:27,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2022-10-17 10:28:27,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:28:28,273 INFO L130 PetriNetUnfolder]: 297/797 cut-off events. [2022-10-17 10:28:28,274 INFO L131 PetriNetUnfolder]: For 588/601 co-relation queries the response was YES. [2022-10-17 10:28:28,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 797 events. 297/797 cut-off events. For 588/601 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4619 event pairs, 25 based on Foata normal form. 3/773 useless extension candidates. Maximal degree in co-relation 1651. Up to 151 conditions per place. [2022-10-17 10:28:28,280 INFO L137 encePairwiseOnDemand]: 87/96 looper letters, 27 selfloop transitions, 5 changer transitions 45/141 dead transitions. [2022-10-17 10:28:28,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 141 transitions, 580 flow [2022-10-17 10:28:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:28:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:28:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 821 transitions. [2022-10-17 10:28:28,284 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8552083333333333 [2022-10-17 10:28:28,284 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 821 transitions. [2022-10-17 10:28:28,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 821 transitions. [2022-10-17 10:28:28,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:28:28,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 821 transitions. [2022-10-17 10:28:28,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.1) internal successors, (821), 10 states have internal predecessors, (821), 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:28:28,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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:28:28,292 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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:28:28,292 INFO L175 Difference]: Start difference. First operand has 119 places, 82 transitions, 222 flow. Second operand 10 states and 821 transitions. [2022-10-17 10:28:28,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 141 transitions, 580 flow [2022-10-17 10:28:28,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 141 transitions, 566 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-10-17 10:28:28,301 INFO L231 Difference]: Finished difference. Result has 111 places, 83 transitions, 250 flow [2022-10-17 10:28:28,301 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=250, PETRI_PLACES=111, PETRI_TRANSITIONS=83} [2022-10-17 10:28:28,302 INFO L287 CegarLoopForPetriNet]: 99 programPoint places, 12 predicate places. [2022-10-17 10:28:28,302 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 83 transitions, 250 flow [2022-10-17 10:28:28,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 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:28:28,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:28:28,303 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] [2022-10-17 10:28:28,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:28:28,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 10:28:28,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:28:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash 961313022, now seen corresponding path program 1 times [2022-10-17 10:28:28,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:28:28,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839268209] [2022-10-17 10:28:28,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:28:28,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:28:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:28:28,665 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:28:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:28:28,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839268209] [2022-10-17 10:28:28,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839268209] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:28:28,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:28:28,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:28:28,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11362370] [2022-10-17 10:28:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:28:28,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:28:28,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:28:28,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:28:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:28:28,670 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2022-10-17 10:28:28,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 83 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 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:28:28,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:28:28,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2022-10-17 10:28:28,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:28:28,946 INFO L130 PetriNetUnfolder]: 61/276 cut-off events. [2022-10-17 10:28:28,946 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2022-10-17 10:28:28,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 276 events. 61/276 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1088 event pairs, 9 based on Foata normal form. 13/284 useless extension candidates. Maximal degree in co-relation 668. Up to 48 conditions per place. [2022-10-17 10:28:28,949 INFO L137 encePairwiseOnDemand]: 88/96 looper letters, 17 selfloop transitions, 7 changer transitions 22/110 dead transitions. [2022-10-17 10:28:28,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 110 transitions, 477 flow [2022-10-17 10:28:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:28:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:28:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2022-10-17 10:28:28,952 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8270833333333333 [2022-10-17 10:28:28,953 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 794 transitions. [2022-10-17 10:28:28,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 794 transitions. [2022-10-17 10:28:28,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:28:28,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 794 transitions. [2022-10-17 10:28:28,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.4) internal successors, (794), 10 states have internal predecessors, (794), 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:28:28,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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:28:28,963 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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:28:28,963 INFO L175 Difference]: Start difference. First operand has 111 places, 83 transitions, 250 flow. Second operand 10 states and 794 transitions. [2022-10-17 10:28:28,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 110 transitions, 477 flow [2022-10-17 10:28:28,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 110 transitions, 402 flow, removed 32 selfloop flow, removed 12 redundant places. [2022-10-17 10:28:28,971 INFO L231 Difference]: Finished difference. Result has 108 places, 83 transitions, 244 flow [2022-10-17 10:28:28,971 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=108, PETRI_TRANSITIONS=83} [2022-10-17 10:28:28,973 INFO L287 CegarLoopForPetriNet]: 99 programPoint places, 9 predicate places. [2022-10-17 10:28:28,973 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 244 flow [2022-10-17 10:28:28,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 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:28:28,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:28:28,978 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] [2022-10-17 10:28:28,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:28:28,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 10:28:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:28:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash -595973065, now seen corresponding path program 1 times [2022-10-17 10:28:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:28:28,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155080927] [2022-10-17 10:28:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:28:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:28:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:28:30,384 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:28:30,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:28:30,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155080927] [2022-10-17 10:28:30,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155080927] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:28:30,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:28:30,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:28:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802420936] [2022-10-17 10:28:30,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:28:30,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:28:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:28:30,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:28:30,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:28:30,388 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 96 [2022-10-17 10:28:30,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 83 transitions, 244 flow. Second operand has 10 states, 10 states have (on average 68.5) internal successors, (685), 10 states have internal predecessors, (685), 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:28:30,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:28:30,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 96 [2022-10-17 10:28:30,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:28:30,794 INFO L130 PetriNetUnfolder]: 19/186 cut-off events. [2022-10-17 10:28:30,795 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-10-17 10:28:30,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 186 events. 19/186 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 515 event pairs, 1 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 343. Up to 21 conditions per place. [2022-10-17 10:28:30,796 INFO L137 encePairwiseOnDemand]: 81/96 looper letters, 20 selfloop transitions, 14 changer transitions 16/106 dead transitions. [2022-10-17 10:28:30,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 414 flow [2022-10-17 10:28:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:28:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:28:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 908 transitions. [2022-10-17 10:28:30,800 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7275641025641025 [2022-10-17 10:28:30,800 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 908 transitions. [2022-10-17 10:28:30,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 908 transitions. [2022-10-17 10:28:30,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:28:30,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 908 transitions. [2022-10-17 10:28:30,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 69.84615384615384) internal successors, (908), 13 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:28:30,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 96.0) internal successors, (1344), 14 states have internal predecessors, (1344), 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:28:30,807 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 96.0) internal successors, (1344), 14 states have internal predecessors, (1344), 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:28:30,807 INFO L175 Difference]: Start difference. First operand has 108 places, 83 transitions, 244 flow. Second operand 13 states and 908 transitions. [2022-10-17 10:28:30,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 106 transitions, 414 flow [2022-10-17 10:28:30,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 368 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-10-17 10:28:30,812 INFO L231 Difference]: Finished difference. Result has 110 places, 87 transitions, 268 flow [2022-10-17 10:28:30,812 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=268, PETRI_PLACES=110, PETRI_TRANSITIONS=87} [2022-10-17 10:28:30,813 INFO L287 CegarLoopForPetriNet]: 99 programPoint places, 11 predicate places. [2022-10-17 10:28:30,813 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 87 transitions, 268 flow [2022-10-17 10:28:30,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.5) internal successors, (685), 10 states have internal predecessors, (685), 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:28:30,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:28:30,814 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] [2022-10-17 10:28:30,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:28:30,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 10:28:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:28:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1405098129, now seen corresponding path program 2 times [2022-10-17 10:28:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:28:30,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984453095] [2022-10-17 10:28:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:28:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:28:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:28:30,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:28:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:28:30,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:28:30,988 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:28:30,990 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-10-17 10:28:30,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-10-17 10:28:30,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-10-17 10:28:30,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-10-17 10:28:30,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-10-17 10:28:30,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:28:30,993 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-10-17 10:28:30,999 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 10:28:31,000 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:28:31,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:28:31 BasicIcfg [2022-10-17 10:28:31,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:28:31,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:28:31,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:28:31,176 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:28:31,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:28:24" (3/4) ... [2022-10-17 10:28:31,178 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:28:31,320 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:28:31,321 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:28:31,322 INFO L158 Benchmark]: Toolchain (without parser) took 8656.86ms. Allocated memory was 144.7MB in the beginning and 241.2MB in the end (delta: 96.5MB). Free memory was 105.7MB in the beginning and 152.0MB in the end (delta: -46.3MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2022-10-17 10:28:31,322 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 144.7MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:28:31,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.76ms. Allocated memory is still 144.7MB. Free memory was 105.6MB in the beginning and 106.3MB in the end (delta: -722.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 10:28:31,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.59ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 104.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:28:31,323 INFO L158 Benchmark]: Boogie Preprocessor took 59.74ms. Allocated memory is still 144.7MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:28:31,323 INFO L158 Benchmark]: RCFGBuilder took 1409.42ms. Allocated memory is still 144.7MB. Free memory was 101.4MB in the beginning and 72.9MB in the end (delta: 28.5MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2022-10-17 10:28:31,323 INFO L158 Benchmark]: TraceAbstraction took 6183.53ms. Allocated memory was 144.7MB in the beginning and 241.2MB in the end (delta: 96.5MB). Free memory was 72.9MB in the beginning and 175.1MB in the end (delta: -102.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:28:31,324 INFO L158 Benchmark]: Witness Printer took 145.07ms. Allocated memory is still 241.2MB. Free memory was 175.1MB in the beginning and 152.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-10-17 10:28:31,326 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.30ms. Allocated memory is still 144.7MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.76ms. Allocated memory is still 144.7MB. Free memory was 105.6MB in the beginning and 106.3MB in the end (delta: -722.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.59ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 104.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.74ms. Allocated memory is still 144.7MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1409.42ms. Allocated memory is still 144.7MB. Free memory was 101.4MB in the beginning and 72.9MB in the end (delta: 28.5MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6183.53ms. Allocated memory was 144.7MB in the beginning and 241.2MB in the end (delta: 96.5MB). Free memory was 72.9MB in the beginning and 175.1MB in the end (delta: -102.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 145.07ms. Allocated memory is still 241.2MB. Free memory was 175.1MB in the beginning and 152.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] 0 pthread_t t1705; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1705, ((void *)0), P0, ((void *)0))=-1, t1705={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t1706; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1706, ((void *)0), P1, ((void *)0))=0, t1705={5:0}, t1706={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L777] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L778] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L779] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L781] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L782] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 811]: 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 5 procedures, 115 locations, 5 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: 5.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 349 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 481 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 47 mSDtfsCounter, 481 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=5, InterpolantAutomatonStates: 49, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 1609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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:28:31,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a109e-584e-4c43-bbca-f02399275c8d/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