./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8 --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 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 --- 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-2329fc7 [2022-12-13 16:59:29,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:59:29,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:59:29,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:59:29,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:59:29,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:59:29,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:59:29,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:59:29,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:59:29,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:59:29,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:59:29,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:59:29,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:59:29,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:59:29,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:59:29,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:59:29,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:59:29,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:59:29,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:59:29,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:59:29,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:59:29,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:59:29,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:59:29,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:59:29,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:59:29,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:59:29,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:59:29,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:59:29,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:59:29,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:59:29,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:59:29,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:59:29,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:59:29,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:59:29,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:59:29,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:59:29,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:59:29,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:59:29,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:59:29,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:59:29,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:59:29,425 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:59:29,446 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:59:29,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:59:29,447 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:59:29,447 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:59:29,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:59:29,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:59:29,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:59:29,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:59:29,449 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:59:29,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:59:29,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:59:29,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:59:29,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:59:29,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:59:29,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:59:29,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:59:29,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:59:29,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:59:29,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:59:29,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:59:29,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:59:29,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:59:29,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:59:29,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:59:29,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:59:29,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:59:29,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:59:29,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:59:29,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:59:29,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:59:29,453 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:59:29,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:59:29,454 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:59:29,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:59:29,454 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:59:29,454 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/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_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8 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 -> 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 [2022-12-13 16:59:29,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:59:29,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:59:29,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:59:29,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:59:29,688 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:59:29,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i [2022-12-13 16:59:32,282 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:59:32,482 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:59:32,482 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i [2022-12-13 16:59:32,491 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/data/cbf4fe3ca/69489cc0c35d4ef4aa4afd76774b0395/FLAG95ad9c4ff [2022-12-13 16:59:32,505 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/data/cbf4fe3ca/69489cc0c35d4ef4aa4afd76774b0395 [2022-12-13 16:59:32,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:59:32,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:59:32,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:59:32,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:59:32,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:59:32,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33783496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32, skipping insertion in model container [2022-12-13 16:59:32,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:59:32,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:59:32,685 WARN L237 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_9539dba0-e1e6-4763-8c42-db967ac241bb/sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i[994,1007] [2022-12-13 16:59:32,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:59:32,830 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:59:32,838 WARN L237 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_9539dba0-e1e6-4763-8c42-db967ac241bb/sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i[994,1007] [2022-12-13 16:59:32,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:59:32,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:59:32,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:59:32,896 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:59:32,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32 WrapperNode [2022-12-13 16:59:32,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:59:32,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:59:32,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:59:32,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:59:32,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,931 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-13 16:59:32,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:59:32,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:59:32,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:59:32,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:59:32,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,951 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:59:32,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:59:32,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:59:32,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:59:32,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (1/1) ... [2022-12-13 16:59:32,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:59:32,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:59:32,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:59:32,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:59:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 16:59:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:59:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:59:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:59:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:59:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:59:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:59:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:59:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:59:33,030 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:59:33,142 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:59:33,143 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:59:33,472 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:59:33,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:59:33,677 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:59:33,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:59:33 BoogieIcfgContainer [2022-12-13 16:59:33,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:59:33,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:59:33,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:59:33,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:59:33,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:59:32" (1/3) ... [2022-12-13 16:59:33,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4253eb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:59:33, skipping insertion in model container [2022-12-13 16:59:33,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:59:32" (2/3) ... [2022-12-13 16:59:33,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4253eb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:59:33, skipping insertion in model container [2022-12-13 16:59:33,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:59:33" (3/3) ... [2022-12-13 16:59:33,687 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2022-12-13 16:59:33,695 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 16:59:33,704 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:59:33,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:59:33,704 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:59:33,753 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:59:33,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-12-13 16:59:33,814 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-13 16:59:33,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:59:33,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 16:59:33,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 131 transitions, 277 flow [2022-12-13 16:59:33,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 114 transitions, 237 flow [2022-12-13 16:59:33,824 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:59:33,832 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 114 transitions, 237 flow [2022-12-13 16:59:33,834 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 114 transitions, 237 flow [2022-12-13 16:59:33,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 114 transitions, 237 flow [2022-12-13 16:59:33,853 INFO L130 PetriNetUnfolder]: 1/114 cut-off events. [2022-12-13 16:59:33,853 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:59:33,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 1/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 38 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-13 16:59:33,854 INFO L119 LiptonReduction]: Number of co-enabled transitions 1228 [2022-12-13 16:59:40,275 INFO L134 LiptonReduction]: Checked pairs total: 2941 [2022-12-13 16:59:40,275 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-12-13 16:59:40,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:59:40,290 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;@41028a14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:59:40,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 16:59:40,297 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 16:59:40,298 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:59:40,298 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:40,298 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:40,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:40,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1902154207, now seen corresponding path program 1 times [2022-12-13 16:59:40,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:40,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204659299] [2022-12-13 16:59:40,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:59:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:59:40,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:59:40,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204659299] [2022-12-13 16:59:40,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204659299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:59:40,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:59:40,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:59:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675646066] [2022-12-13 16:59:40,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:59:40,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:59:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:59:40,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:59:40,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:59:40,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 229 [2022-12-13 16:59:40,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 47 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-12-13 16:59:40,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:59:40,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 229 [2022-12-13 16:59:40,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:59:40,942 INFO L130 PetriNetUnfolder]: 545/890 cut-off events. [2022-12-13 16:59:40,943 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 16:59:40,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 890 events. 545/890 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3927 event pairs, 125 based on Foata normal form. 8/898 useless extension candidates. Maximal degree in co-relation 1760. Up to 775 conditions per place. [2022-12-13 16:59:40,950 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-13 16:59:40,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 137 flow [2022-12-13 16:59:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:59:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:59:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-12-13 16:59:40,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5560407569141194 [2022-12-13 16:59:40,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-12-13 16:59:40,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-12-13 16:59:40,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:59:40,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-12-13 16:59:40,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-12-13 16:59:40,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-12-13 16:59:40,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-12-13 16:59:40,974 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states and 382 transitions. [2022-12-13 16:59:40,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 137 flow [2022-12-13 16:59:40,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:59:40,977 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2022-12-13 16:59:40,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-13 16:59:40,981 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-13 16:59:40,982 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2022-12-13 16:59:40,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-12-13 16:59:40,982 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:40,982 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:40,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:59:40,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1162763320, now seen corresponding path program 1 times [2022-12-13 16:59:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:40,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550150317] [2022-12-13 16:59:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:59:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:59:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:59:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550150317] [2022-12-13 16:59:41,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550150317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:59:41,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:59:41,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:59:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577946085] [2022-12-13 16:59:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:59:41,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:59:41,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:59:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:59:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:59:41,122 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 229 [2022-12-13 16:59:41,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-12-13 16:59:41,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:59:41,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 229 [2022-12-13 16:59:41,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:59:41,334 INFO L130 PetriNetUnfolder]: 570/892 cut-off events. [2022-12-13 16:59:41,334 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-12-13 16:59:41,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 892 events. 570/892 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3645 event pairs, 184 based on Foata normal form. 24/915 useless extension candidates. Maximal degree in co-relation 1957. Up to 621 conditions per place. [2022-12-13 16:59:41,340 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-13 16:59:41,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 139 flow [2022-12-13 16:59:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:59:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:59:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-12-13 16:59:41,343 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5560407569141194 [2022-12-13 16:59:41,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-12-13 16:59:41,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-12-13 16:59:41,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:59:41,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-12-13 16:59:41,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-12-13 16:59:41,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-12-13 16:59:41,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-12-13 16:59:41,352 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 3 states and 382 transitions. [2022-12-13 16:59:41,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 139 flow [2022-12-13 16:59:41,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:59:41,354 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 68 flow [2022-12-13 16:59:41,354 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 16:59:41,354 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-13 16:59:41,354 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 68 flow [2022-12-13 16:59:41,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-12-13 16:59:41,355 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:41,355 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:41,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:59:41,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1388660914, now seen corresponding path program 1 times [2022-12-13 16:59:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:41,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529866676] [2022-12-13 16:59:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:59:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:59:41,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:59:41,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529866676] [2022-12-13 16:59:41,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529866676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:59:41,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:59:41,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:59:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038259083] [2022-12-13 16:59:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:59:41,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:59:41,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:59:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:59:41,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:59:41,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 229 [2022-12-13 16:59:41,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-12-13 16:59:41,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:59:41,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 229 [2022-12-13 16:59:41,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:59:41,690 INFO L130 PetriNetUnfolder]: 477/776 cut-off events. [2022-12-13 16:59:41,691 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-13 16:59:41,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 776 events. 477/776 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3340 event pairs, 133 based on Foata normal form. 12/787 useless extension candidates. Maximal degree in co-relation 1742. Up to 555 conditions per place. [2022-12-13 16:59:41,696 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-13 16:59:41,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 158 flow [2022-12-13 16:59:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:59:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:59:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2022-12-13 16:59:41,698 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5676855895196506 [2022-12-13 16:59:41,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2022-12-13 16:59:41,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2022-12-13 16:59:41,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:59:41,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2022-12-13 16:59:41,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-12-13 16:59:41,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-12-13 16:59:41,701 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-12-13 16:59:41,701 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 68 flow. Second operand 3 states and 390 transitions. [2022-12-13 16:59:41,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 158 flow [2022-12-13 16:59:41,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:59:41,704 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 72 flow [2022-12-13 16:59:41,704 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-13 16:59:41,704 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-13 16:59:41,705 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 72 flow [2022-12-13 16:59:41,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-12-13 16:59:41,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:41,705 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:41,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:59:41,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash -98764050, now seen corresponding path program 1 times [2022-12-13 16:59:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:41,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847570565] [2022-12-13 16:59:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:41,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:59:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:59:42,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:59:42,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847570565] [2022-12-13 16:59:42,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847570565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:59:42,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:59:42,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:59:42,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585915910] [2022-12-13 16:59:42,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:59:42,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:59:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:59:42,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:59:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:59:42,731 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 229 [2022-12-13 16:59:42,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 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-12-13 16:59:42,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:59:42,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 229 [2022-12-13 16:59:42,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:59:43,002 INFO L130 PetriNetUnfolder]: 530/865 cut-off events. [2022-12-13 16:59:43,003 INFO L131 PetriNetUnfolder]: For 373/373 co-relation queries the response was YES. [2022-12-13 16:59:43,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 865 events. 530/865 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3904 event pairs, 75 based on Foata normal form. 9/870 useless extension candidates. Maximal degree in co-relation 2083. Up to 520 conditions per place. [2022-12-13 16:59:43,006 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 33 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2022-12-13 16:59:43,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 213 flow [2022-12-13 16:59:43,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:59:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:59:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2022-12-13 16:59:43,009 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5207423580786026 [2022-12-13 16:59:43,009 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2022-12-13 16:59:43,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2022-12-13 16:59:43,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:59:43,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2022-12-13 16:59:43,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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-12-13 16:59:43,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 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-12-13 16:59:43,013 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 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-12-13 16:59:43,013 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 72 flow. Second operand 4 states and 477 transitions. [2022-12-13 16:59:43,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 213 flow [2022-12-13 16:59:43,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:59:43,015 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 106 flow [2022-12-13 16:59:43,015 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-13 16:59:43,016 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-12-13 16:59:43,016 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 106 flow [2022-12-13 16:59:43,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 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-12-13 16:59:43,017 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:43,017 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:43,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:59:43,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1105905960, now seen corresponding path program 2 times [2022-12-13 16:59:43,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:43,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689338448] [2022-12-13 16:59:43,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:43,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:59:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:59:43,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:59:43,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689338448] [2022-12-13 16:59:43,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689338448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:59:43,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:59:43,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:59:43,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331936807] [2022-12-13 16:59:43,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:59:43,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:59:43,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:59:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:59:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:59:43,771 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 229 [2022-12-13 16:59:43,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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-12-13 16:59:43,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:59:43,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 229 [2022-12-13 16:59:43,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:59:44,022 INFO L130 PetriNetUnfolder]: 518/842 cut-off events. [2022-12-13 16:59:44,023 INFO L131 PetriNetUnfolder]: For 537/537 co-relation queries the response was YES. [2022-12-13 16:59:44,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 842 events. 518/842 cut-off events. For 537/537 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3804 event pairs, 90 based on Foata normal form. 9/848 useless extension candidates. Maximal degree in co-relation 2257. Up to 511 conditions per place. [2022-12-13 16:59:44,026 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 33 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-13 16:59:44,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 229 flow [2022-12-13 16:59:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:59:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:59:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-12-13 16:59:44,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5141921397379913 [2022-12-13 16:59:44,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2022-12-13 16:59:44,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2022-12-13 16:59:44,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:59:44,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2022-12-13 16:59:44,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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-12-13 16:59:44,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 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-12-13 16:59:44,031 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 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-12-13 16:59:44,031 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 106 flow. Second operand 4 states and 471 transitions. [2022-12-13 16:59:44,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 229 flow [2022-12-13 16:59:44,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:59:44,032 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 122 flow [2022-12-13 16:59:44,033 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 16:59:44,033 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-13 16:59:44,033 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 122 flow [2022-12-13 16:59:44,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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-12-13 16:59:44,034 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:44,034 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:44,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:59:44,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1233335953, now seen corresponding path program 1 times [2022-12-13 16:59:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:44,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160465303] [2022-12-13 16:59:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:44,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:59:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:59:44,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:59:44,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160465303] [2022-12-13 16:59:44,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160465303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:59:44,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:59:44,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:59:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115227030] [2022-12-13 16:59:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:59:44,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:59:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:59:44,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:59:44,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:59:44,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 229 [2022-12-13 16:59:44,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-12-13 16:59:44,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:59:44,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 229 [2022-12-13 16:59:44,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:59:44,419 INFO L130 PetriNetUnfolder]: 422/739 cut-off events. [2022-12-13 16:59:44,419 INFO L131 PetriNetUnfolder]: For 764/764 co-relation queries the response was YES. [2022-12-13 16:59:44,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 739 events. 422/739 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3537 event pairs, 70 based on Foata normal form. 71/804 useless extension candidates. Maximal degree in co-relation 2117. Up to 430 conditions per place. [2022-12-13 16:59:44,422 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 54 selfloop transitions, 7 changer transitions 4/68 dead transitions. [2022-12-13 16:59:44,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 437 flow [2022-12-13 16:59:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:59:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:59:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2022-12-13 16:59:44,423 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.548471615720524 [2022-12-13 16:59:44,423 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2022-12-13 16:59:44,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2022-12-13 16:59:44,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:59:44,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2022-12-13 16:59:44,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 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-12-13 16:59:44,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 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-12-13 16:59:44,426 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 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-12-13 16:59:44,426 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 122 flow. Second operand 5 states and 628 transitions. [2022-12-13 16:59:44,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 437 flow [2022-12-13 16:59:44,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 68 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:59:44,428 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 172 flow [2022-12-13 16:59:44,428 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-12-13 16:59:44,428 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2022-12-13 16:59:44,429 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 172 flow [2022-12-13 16:59:44,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-12-13 16:59:44,429 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:44,429 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:44,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:59:44,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1873264706, now seen corresponding path program 1 times [2022-12-13 16:59:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:44,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913297184] [2022-12-13 16:59:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:59:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:59:44,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:59:44,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913297184] [2022-12-13 16:59:44,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913297184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:59:44,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:59:44,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:59:44,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647821510] [2022-12-13 16:59:44,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:59:44,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:59:44,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:59:44,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:59:44,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:59:44,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 229 [2022-12-13 16:59:44,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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-12-13 16:59:44,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:59:44,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 229 [2022-12-13 16:59:44,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:59:44,848 INFO L130 PetriNetUnfolder]: 315/588 cut-off events. [2022-12-13 16:59:44,848 INFO L131 PetriNetUnfolder]: For 794/794 co-relation queries the response was YES. [2022-12-13 16:59:44,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 588 events. 315/588 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2838 event pairs, 39 based on Foata normal form. 42/624 useless extension candidates. Maximal degree in co-relation 2056. Up to 207 conditions per place. [2022-12-13 16:59:44,852 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 62 selfloop transitions, 13 changer transitions 11/89 dead transitions. [2022-12-13 16:59:44,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 622 flow [2022-12-13 16:59:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:59:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:59:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2022-12-13 16:59:44,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5433562071116657 [2022-12-13 16:59:44,854 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2022-12-13 16:59:44,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2022-12-13 16:59:44,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:59:44,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2022-12-13 16:59:44,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 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-12-13 16:59:44,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 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-12-13 16:59:44,858 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 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-12-13 16:59:44,858 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 172 flow. Second operand 7 states and 871 transitions. [2022-12-13 16:59:44,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 622 flow [2022-12-13 16:59:44,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:59:44,860 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 256 flow [2022-12-13 16:59:44,860 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2022-12-13 16:59:44,861 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2022-12-13 16:59:44,861 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 256 flow [2022-12-13 16:59:44,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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-12-13 16:59:44,861 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:44,861 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:44,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:59:44,861 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:44,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2053894093, now seen corresponding path program 1 times [2022-12-13 16:59:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:44,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851439974] [2022-12-13 16:59:44,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:59:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:59:45,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:59:45,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851439974] [2022-12-13 16:59:45,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851439974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:59:45,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:59:45,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:59:45,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426714803] [2022-12-13 16:59:45,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:59:45,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:59:45,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:59:45,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:59:45,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:59:45,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 229 [2022-12-13 16:59:45,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:59:45,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:59:45,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 229 [2022-12-13 16:59:45,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:59:45,292 INFO L130 PetriNetUnfolder]: 283/534 cut-off events. [2022-12-13 16:59:45,292 INFO L131 PetriNetUnfolder]: For 1146/1146 co-relation queries the response was YES. [2022-12-13 16:59:45,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 534 events. 283/534 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2586 event pairs, 36 based on Foata normal form. 11/539 useless extension candidates. Maximal degree in co-relation 2067. Up to 183 conditions per place. [2022-12-13 16:59:45,297 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 59 selfloop transitions, 17 changer transitions 10/89 dead transitions. [2022-12-13 16:59:45,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 680 flow [2022-12-13 16:59:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:59:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 16:59:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2022-12-13 16:59:45,300 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5342066957787481 [2022-12-13 16:59:45,300 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2022-12-13 16:59:45,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2022-12-13 16:59:45,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:59:45,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2022-12-13 16:59:45,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:59:45,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 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-12-13 16:59:45,306 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 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-12-13 16:59:45,306 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 256 flow. Second operand 9 states and 1101 transitions. [2022-12-13 16:59:45,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 680 flow [2022-12-13 16:59:45,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 611 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-13 16:59:45,314 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 264 flow [2022-12-13 16:59:45,314 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2022-12-13 16:59:45,315 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2022-12-13 16:59:45,315 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 264 flow [2022-12-13 16:59:45,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:59:45,316 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:59:45,316 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:45,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:59:45,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 16:59:45,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:59:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash 525967768, now seen corresponding path program 1 times [2022-12-13 16:59:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:59:45,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140711452] [2022-12-13 16:59:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:59:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:59:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:59:45,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:59:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:59:45,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:59:45,455 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:59:45,455 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 16:59:45,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 16:59:45,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 16:59:45,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 16:59:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:59:45,457 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:59:45,462 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:59:45,462 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:59:45,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:59:45 BasicIcfg [2022-12-13 16:59:45,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:59:45,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:59:45,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:59:45,521 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:59:45,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:59:33" (3/4) ... [2022-12-13 16:59:45,522 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:59:45,591 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:59:45,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:59:45,592 INFO L158 Benchmark]: Toolchain (without parser) took 13083.46ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 82.0MB in the beginning and 179.0MB in the end (delta: -97.0MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-12-13 16:59:45,592 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 117.4MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:59:45,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.32ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 54.1MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 16:59:45,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.90ms. Allocated memory is still 117.4MB. Free memory was 54.1MB in the beginning and 51.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:59:45,593 INFO L158 Benchmark]: Boogie Preprocessor took 23.16ms. Allocated memory is still 117.4MB. Free memory was 51.6MB in the beginning and 49.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:59:45,593 INFO L158 Benchmark]: RCFGBuilder took 724.13ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 49.2MB in the beginning and 95.1MB in the end (delta: -45.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-12-13 16:59:45,594 INFO L158 Benchmark]: TraceAbstraction took 11838.41ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 94.8MB in the beginning and 192.6MB in the end (delta: -97.8MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. [2022-12-13 16:59:45,594 INFO L158 Benchmark]: Witness Printer took 71.18ms. Allocated memory is still 249.6MB. Free memory was 192.6MB in the beginning and 179.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 16:59:45,596 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.11ms. Allocated memory is still 117.4MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.32ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 54.1MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.90ms. Allocated memory is still 117.4MB. Free memory was 54.1MB in the beginning and 51.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.16ms. Allocated memory is still 117.4MB. Free memory was 51.6MB in the beginning and 49.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 724.13ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 49.2MB in the beginning and 95.1MB in the end (delta: -45.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11838.41ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 94.8MB in the beginning and 192.6MB in the end (delta: -97.8MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. * Witness Printer took 71.18ms. Allocated memory is still 249.6MB. Free memory was 192.6MB in the beginning and 179.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 123 PlacesBefore, 29 PlacesAfterwards, 114 TransitionsBefore, 19 TransitionsAfterwards, 1228 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 2941 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1448, independent: 1301, independent conditional: 0, independent unconditional: 1301, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 659, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1448, independent: 680, independent conditional: 0, independent unconditional: 680, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 659, unknown conditional: 0, unknown unconditional: 659] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1681, ((void *)0), P0, ((void *)0))=-2, t1681={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L850] 0 pthread_t t1682; [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1682, ((void *)0), P1, ((void *)0))=-1, t1681={6:0}, t1682={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L852] 0 pthread_t t1683; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __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=0, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] 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) [L802] EXPR 2 \read(x) [L802] 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) [L802] 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) [L803] 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)) [L804] 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)) [L805] 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)) [L806] 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)) [L807] 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)) [L808] 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)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __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=49, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1683, ((void *)0), P2, ((void *)0))=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] 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) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 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 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 4 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: 11.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 19 mSDtfsCounter, 681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=8, InterpolantAutomatonStates: 38, 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.3s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 16:59:45,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9539dba0-e1e6-4763-8c42-db967ac241bb/bin/uautomizer-uyxdKDjOR8/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