./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R --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 ef808fc1470b7509ff56eb59d7d443a24f9bd367b94a6fd316176ae1cba1f1f6 --- 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-38b53e6 [2022-11-25 17:41:46,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:41:46,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:41:46,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:41:46,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:41:46,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:41:46,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:41:46,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:41:46,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:41:46,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:41:46,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:41:46,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:41:46,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:41:46,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:41:46,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:41:46,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:41:46,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:41:46,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:41:46,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:41:46,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:41:46,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:41:46,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:41:46,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:41:46,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:41:46,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:41:46,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:41:46,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:41:46,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:41:46,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:41:46,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:41:46,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:41:46,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:41:46,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:41:46,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:41:46,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:41:46,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:41:46,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:41:46,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:41:46,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:41:46,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:41:46,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:41:46,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:41:46,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:41:46,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:41:46,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:41:46,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:41:46,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:41:46,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:41:46,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:41:46,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:41:46,365 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:41:46,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:41:46,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:41:46,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:41:46,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:41:46,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:41:46,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:41:46,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:41:46,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:41:46,367 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:41:46,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:41:46,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:41:46,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:41:46,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:41:46,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:41:46,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:41:46,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:41:46,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:41:46,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:41:46,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:41:46,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:41:46,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:41:46,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:41:46,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:41:46,371 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:41:46,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:41:46,371 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_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/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_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R 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 -> ef808fc1470b7509ff56eb59d7d443a24f9bd367b94a6fd316176ae1cba1f1f6 [2022-11-25 17:41:46,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:41:46,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:41:46,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:41:46,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:41:46,743 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:41:46,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i [2022-11-25 17:41:49,867 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:41:50,183 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:41:50,184 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i [2022-11-25 17:41:50,212 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/data/5aebf5543/8adf75e3c8eb4aff825f0cf837978c3d/FLAG9add39eee [2022-11-25 17:41:50,507 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/data/5aebf5543/8adf75e3c8eb4aff825f0cf837978c3d [2022-11-25 17:41:50,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:41:50,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:41:50,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:41:50,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:41:50,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:41:50,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:41:50" (1/1) ... [2022-11-25 17:41:50,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562e23cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:50, skipping insertion in model container [2022-11-25 17:41:50,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:41:50" (1/1) ... [2022-11-25 17:41:50,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:41:50,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:41:50,753 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_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i[993,1006] [2022-11-25 17:41:50,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:41:51,114 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:41:51,133 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_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i[993,1006] [2022-11-25 17:41:51,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:41:51,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:41:51,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:41:51,255 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:41:51,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51 WrapperNode [2022-11-25 17:41:51,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:41:51,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:41:51,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:41:51,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:41:51,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,339 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-11-25 17:41:51,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:41:51,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:41:51,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:41:51,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:41:51,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,393 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:41:51,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:41:51,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:41:51,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:41:51,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (1/1) ... [2022-11-25 17:41:51,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:41:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:41:51,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:41:51,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:41:51,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:41:51,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:41:51,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:41:51,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:41:51,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:41:51,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:41:51,497 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:41:51,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:41:51,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:41:51,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:41:51,498 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:41:51,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:41:51,499 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:41:51,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:41:51,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:41:51,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:41:51,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:41:51,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:41:51,503 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:41:51,710 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:41:51,712 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:41:52,296 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:41:52,576 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:41:52,576 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:41:52,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:41:52 BoogieIcfgContainer [2022-11-25 17:41:52,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:41:52,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:41:52,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:41:52,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:41:52,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:41:50" (1/3) ... [2022-11-25 17:41:52,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d92b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:41:52, skipping insertion in model container [2022-11-25 17:41:52,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:41:51" (2/3) ... [2022-11-25 17:41:52,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d92b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:41:52, skipping insertion in model container [2022-11-25 17:41:52,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:41:52" (3/3) ... [2022-11-25 17:41:52,588 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2022-11-25 17:41:52,597 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:41:52,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:41:52,608 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:41:52,609 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:41:52,695 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:41:52,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-25 17:41:52,803 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-25 17:41:52,803 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:41:52,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-11-25 17:41:52,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-11-25 17:41:52,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 129 transitions, 270 flow [2022-11-25 17:41:52,828 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:41:52,862 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 129 transitions, 270 flow [2022-11-25 17:41:52,867 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 129 transitions, 270 flow [2022-11-25 17:41:52,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 129 transitions, 270 flow [2022-11-25 17:41:52,943 INFO L130 PetriNetUnfolder]: 1/129 cut-off events. [2022-11-25 17:41:52,943 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:41:52,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 1/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 49 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-11-25 17:41:52,950 INFO L119 LiptonReduction]: Number of co-enabled transitions 1832 [2022-11-25 17:42:08,362 INFO L134 LiptonReduction]: Checked pairs total: 4687 [2022-11-25 17:42:08,363 INFO L136 LiptonReduction]: Total number of compositions: 112 [2022-11-25 17:42:08,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:42:08,386 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;@10b4e6ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:42:08,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 17:42:08,393 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-11-25 17:42:08,393 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:42:08,393 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:08,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:08,394 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 2 more)] === [2022-11-25 17:42:08,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash -857279889, now seen corresponding path program 1 times [2022-11-25 17:42:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:08,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072420436] [2022-11-25 17:42:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:08,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:08,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-11-25 17:42:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:08,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072420436] [2022-11-25 17:42:08,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072420436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:08,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:08,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:42:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881352004] [2022-11-25 17:42:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:08,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:42:08,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:08,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:42:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:42:08,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 261 [2022-11-25 17:42:08,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:08,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:08,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 261 [2022-11-25 17:42:08,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:09,460 INFO L130 PetriNetUnfolder]: 1667/2360 cut-off events. [2022-11-25 17:42:09,460 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-11-25 17:42:09,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 2360 events. 1667/2360 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10237 event pairs, 1667 based on Foata normal form. 0/2350 useless extension candidates. Maximal degree in co-relation 4792. Up to 2341 conditions per place. [2022-11-25 17:42:09,478 INFO L137 encePairwiseOnDemand]: 260/261 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2022-11-25 17:42:09,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 100 flow [2022-11-25 17:42:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:42:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:42:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2022-11-25 17:42:09,504 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5670498084291188 [2022-11-25 17:42:09,505 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2022-11-25 17:42:09,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2022-11-25 17:42:09,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:09,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2022-11-25 17:42:09,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:09,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:09,525 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:09,527 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states and 296 transitions. [2022-11-25 17:42:09,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 100 flow [2022-11-25 17:42:09,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:42:09,536 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 54 flow [2022-11-25 17:42:09,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-11-25 17:42:09,542 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-11-25 17:42:09,542 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 54 flow [2022-11-25 17:42:09,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:09,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:09,543 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:09,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:42:09,544 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 2 more)] === [2022-11-25 17:42:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 787747580, now seen corresponding path program 1 times [2022-11-25 17:42:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:09,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023973340] [2022-11-25 17:42:09,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:09,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:09,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023973340] [2022-11-25 17:42:09,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023973340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:09,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:09,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:42:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327305913] [2022-11-25 17:42:09,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:09,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:42:09,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:09,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:42:09,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:42:09,807 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 261 [2022-11-25 17:42:09,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:09,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:09,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 261 [2022-11-25 17:42:09,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:10,482 INFO L130 PetriNetUnfolder]: 2185/3054 cut-off events. [2022-11-25 17:42:10,482 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:42:10,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6237 conditions, 3054 events. 2185/3054 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13237 event pairs, 721 based on Foata normal form. 32/3082 useless extension candidates. Maximal degree in co-relation 6234. Up to 2745 conditions per place. [2022-11-25 17:42:10,500 INFO L137 encePairwiseOnDemand]: 257/261 looper letters, 36 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-11-25 17:42:10,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 172 flow [2022-11-25 17:42:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:42:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:42:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-25 17:42:10,504 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5644955300127714 [2022-11-25 17:42:10,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-25 17:42:10,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-25 17:42:10,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:10,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-25 17:42:10,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:10,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:10,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:10,510 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 54 flow. Second operand 3 states and 442 transitions. [2022-11-25 17:42:10,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 172 flow [2022-11-25 17:42:10,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:42:10,512 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 73 flow [2022-11-25 17:42:10,512 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-11-25 17:42:10,513 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-11-25 17:42:10,513 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 73 flow [2022-11-25 17:42:10,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:10,514 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:10,514 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:10,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:42:10,514 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 2 more)] === [2022-11-25 17:42:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1349629742, now seen corresponding path program 1 times [2022-11-25 17:42:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536254191] [2022-11-25 17:42:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:11,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:11,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536254191] [2022-11-25 17:42:11,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536254191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:11,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:11,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:42:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532715245] [2022-11-25 17:42:11,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:11,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:42:11,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:42:11,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:42:11,108 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 261 [2022-11-25 17:42:11,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:11,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:11,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 261 [2022-11-25 17:42:11,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:11,726 INFO L130 PetriNetUnfolder]: 1826/2747 cut-off events. [2022-11-25 17:42:11,726 INFO L131 PetriNetUnfolder]: For 359/360 co-relation queries the response was YES. [2022-11-25 17:42:11,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5958 conditions, 2747 events. 1826/2747 cut-off events. For 359/360 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13436 event pairs, 364 based on Foata normal form. 40/2786 useless extension candidates. Maximal degree in co-relation 5953. Up to 2100 conditions per place. [2022-11-25 17:42:11,744 INFO L137 encePairwiseOnDemand]: 258/261 looper letters, 32 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-11-25 17:42:11,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 172 flow [2022-11-25 17:42:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:42:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:42:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-11-25 17:42:11,746 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5593869731800766 [2022-11-25 17:42:11,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-11-25 17:42:11,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-11-25 17:42:11,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:11,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-11-25 17:42:11,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:11,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:11,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:11,753 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 73 flow. Second operand 3 states and 438 transitions. [2022-11-25 17:42:11,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 172 flow [2022-11-25 17:42:11,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:42:11,757 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 78 flow [2022-11-25 17:42:11,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-11-25 17:42:11,759 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-11-25 17:42:11,759 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 78 flow [2022-11-25 17:42:11,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:11,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:11,760 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:42:11,761 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 2 more)] === [2022-11-25 17:42:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1602379802, now seen corresponding path program 1 times [2022-11-25 17:42:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:11,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955601745] [2022-11-25 17:42:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955601745] [2022-11-25 17:42:12,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955601745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:12,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:12,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:42:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854490219] [2022-11-25 17:42:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:12,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:42:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:42:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:42:12,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 261 [2022-11-25 17:42:12,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:12,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:12,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 261 [2022-11-25 17:42:12,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:12,799 INFO L130 PetriNetUnfolder]: 1815/2591 cut-off events. [2022-11-25 17:42:12,799 INFO L131 PetriNetUnfolder]: For 698/698 co-relation queries the response was YES. [2022-11-25 17:42:12,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6061 conditions, 2591 events. 1815/2591 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11440 event pairs, 707 based on Foata normal form. 24/2612 useless extension candidates. Maximal degree in co-relation 6055. Up to 1993 conditions per place. [2022-11-25 17:42:12,817 INFO L137 encePairwiseOnDemand]: 258/261 looper letters, 36 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-11-25 17:42:12,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 197 flow [2022-11-25 17:42:12,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:42:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:42:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-11-25 17:42:12,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5734355044699873 [2022-11-25 17:42:12,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-11-25 17:42:12,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-11-25 17:42:12,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:12,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-11-25 17:42:12,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:12,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:12,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:12,826 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 78 flow. Second operand 3 states and 449 transitions. [2022-11-25 17:42:12,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 197 flow [2022-11-25 17:42:12,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:42:12,828 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 82 flow [2022-11-25 17:42:12,828 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-11-25 17:42:12,829 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-11-25 17:42:12,829 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 82 flow [2022-11-25 17:42:12,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:12,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:12,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:12,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:42:12,831 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 2 more)] === [2022-11-25 17:42:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:12,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1286386154, now seen corresponding path program 1 times [2022-11-25 17:42:12,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:12,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526747716] [2022-11-25 17:42:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:12,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:12,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:12,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526747716] [2022-11-25 17:42:12,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526747716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:12,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:12,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:42:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357313191] [2022-11-25 17:42:12,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:12,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:42:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:42:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:42:12,919 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 261 [2022-11-25 17:42:12,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:12,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:12,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 261 [2022-11-25 17:42:12,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:13,750 INFO L130 PetriNetUnfolder]: 2471/3548 cut-off events. [2022-11-25 17:42:13,750 INFO L131 PetriNetUnfolder]: For 1168/1168 co-relation queries the response was YES. [2022-11-25 17:42:13,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8479 conditions, 3548 events. 2471/3548 cut-off events. For 1168/1168 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17075 event pairs, 1399 based on Foata normal form. 72/3610 useless extension candidates. Maximal degree in co-relation 8472. Up to 2197 conditions per place. [2022-11-25 17:42:13,771 INFO L137 encePairwiseOnDemand]: 258/261 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-11-25 17:42:13,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 201 flow [2022-11-25 17:42:13,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:42:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:42:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-25 17:42:13,774 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5644955300127714 [2022-11-25 17:42:13,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-25 17:42:13,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-25 17:42:13,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:13,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-25 17:42:13,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:13,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:13,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:13,779 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 82 flow. Second operand 3 states and 442 transitions. [2022-11-25 17:42:13,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 201 flow [2022-11-25 17:42:13,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:42:13,781 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 89 flow [2022-11-25 17:42:13,781 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2022-11-25 17:42:13,782 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-11-25 17:42:13,782 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 89 flow [2022-11-25 17:42:13,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:13,783 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:13,783 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:13,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:42:13,783 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 2 more)] === [2022-11-25 17:42:13,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1362920252, now seen corresponding path program 1 times [2022-11-25 17:42:13,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:13,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959849165] [2022-11-25 17:42:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:13,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:16,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959849165] [2022-11-25 17:42:16,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959849165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:16,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:16,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:42:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204553024] [2022-11-25 17:42:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:16,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:42:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:42:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:42:16,310 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 261 [2022-11-25 17:42:16,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 89 flow. Second operand has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:16,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:16,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 261 [2022-11-25 17:42:16,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:17,242 INFO L130 PetriNetUnfolder]: 2548/3644 cut-off events. [2022-11-25 17:42:17,242 INFO L131 PetriNetUnfolder]: For 1746/1795 co-relation queries the response was YES. [2022-11-25 17:42:17,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8830 conditions, 3644 events. 2548/3644 cut-off events. For 1746/1795 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16973 event pairs, 634 based on Foata normal form. 22/3663 useless extension candidates. Maximal degree in co-relation 8822. Up to 3201 conditions per place. [2022-11-25 17:42:17,267 INFO L137 encePairwiseOnDemand]: 257/261 looper letters, 32 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-11-25 17:42:17,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 194 flow [2022-11-25 17:42:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:42:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:42:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-11-25 17:42:17,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-11-25 17:42:17,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-11-25 17:42:17,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-11-25 17:42:17,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:17,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-11-25 17:42:17,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:17,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:17,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:17,274 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 89 flow. Second operand 3 states and 406 transitions. [2022-11-25 17:42:17,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 194 flow [2022-11-25 17:42:17,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 186 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-25 17:42:17,281 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 103 flow [2022-11-25 17:42:17,282 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-11-25 17:42:17,285 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-11-25 17:42:17,285 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 103 flow [2022-11-25 17:42:17,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:17,287 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:17,287 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:17,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:42:17,287 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 2 more)] === [2022-11-25 17:42:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash 699142187, now seen corresponding path program 1 times [2022-11-25 17:42:17,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:17,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697599304] [2022-11-25 17:42:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:17,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:17,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697599304] [2022-11-25 17:42:17,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697599304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:17,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:17,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:42:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819574605] [2022-11-25 17:42:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:17,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:42:17,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:42:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:42:17,643 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 261 [2022-11-25 17:42:17,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:17,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:17,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 261 [2022-11-25 17:42:17,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:18,502 INFO L130 PetriNetUnfolder]: 3065/4367 cut-off events. [2022-11-25 17:42:18,502 INFO L131 PetriNetUnfolder]: For 2212/2270 co-relation queries the response was YES. [2022-11-25 17:42:18,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10810 conditions, 4367 events. 3065/4367 cut-off events. For 2212/2270 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20956 event pairs, 2186 based on Foata normal form. 43/4407 useless extension candidates. Maximal degree in co-relation 10801. Up to 3793 conditions per place. [2022-11-25 17:42:18,540 INFO L137 encePairwiseOnDemand]: 252/261 looper letters, 29 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2022-11-25 17:42:18,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 214 flow [2022-11-25 17:42:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:42:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:42:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2022-11-25 17:42:18,542 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-11-25 17:42:18,543 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2022-11-25 17:42:18,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2022-11-25 17:42:18,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:18,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2022-11-25 17:42:18,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:18,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:18,548 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:18,548 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 103 flow. Second operand 4 states and 551 transitions. [2022-11-25 17:42:18,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 214 flow [2022-11-25 17:42:18,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:42:18,551 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 155 flow [2022-11-25 17:42:18,552 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-11-25 17:42:18,552 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-11-25 17:42:18,553 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 155 flow [2022-11-25 17:42:18,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:18,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:18,553 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:18,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:42:18,554 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 2 more)] === [2022-11-25 17:42:18,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash 699036167, now seen corresponding path program 2 times [2022-11-25 17:42:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:18,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815651884] [2022-11-25 17:42:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:19,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815651884] [2022-11-25 17:42:19,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815651884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:19,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:19,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:42:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298832498] [2022-11-25 17:42:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:19,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:42:19,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:19,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:42:19,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:42:19,203 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 261 [2022-11-25 17:42:19,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:19,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:19,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 261 [2022-11-25 17:42:19,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:20,224 INFO L130 PetriNetUnfolder]: 3172/4525 cut-off events. [2022-11-25 17:42:20,224 INFO L131 PetriNetUnfolder]: For 3634/3691 co-relation queries the response was YES. [2022-11-25 17:42:20,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13325 conditions, 4525 events. 3172/4525 cut-off events. For 3634/3691 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 21942 event pairs, 2186 based on Foata normal form. 43/4565 useless extension candidates. Maximal degree in co-relation 13315. Up to 3831 conditions per place. [2022-11-25 17:42:20,254 INFO L137 encePairwiseOnDemand]: 253/261 looper letters, 30 selfloop transitions, 12 changer transitions 0/44 dead transitions. [2022-11-25 17:42:20,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 278 flow [2022-11-25 17:42:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:42:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:42:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2022-11-25 17:42:20,257 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-11-25 17:42:20,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2022-11-25 17:42:20,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2022-11-25 17:42:20,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:20,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2022-11-25 17:42:20,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:20,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:20,261 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:20,262 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 155 flow. Second operand 4 states and 551 transitions. [2022-11-25 17:42:20,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 278 flow [2022-11-25 17:42:20,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 266 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:42:20,270 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 207 flow [2022-11-25 17:42:20,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-11-25 17:42:20,273 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-11-25 17:42:20,273 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 207 flow [2022-11-25 17:42:20,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:20,274 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:20,274 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:20,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:42:20,274 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 2 more)] === [2022-11-25 17:42:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -920034057, now seen corresponding path program 1 times [2022-11-25 17:42:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679627155] [2022-11-25 17:42:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:20,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:20,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679627155] [2022-11-25 17:42:20,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679627155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:20,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:20,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:42:20,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851274579] [2022-11-25 17:42:20,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:20,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:42:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:20,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:42:20,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:42:20,602 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 261 [2022-11-25 17:42:20,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:20,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:20,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 261 [2022-11-25 17:42:20,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:21,470 INFO L130 PetriNetUnfolder]: 2739/4041 cut-off events. [2022-11-25 17:42:21,470 INFO L131 PetriNetUnfolder]: For 6116/6530 co-relation queries the response was YES. [2022-11-25 17:42:21,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13227 conditions, 4041 events. 2739/4041 cut-off events. For 6116/6530 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 21232 event pairs, 494 based on Foata normal form. 692/4718 useless extension candidates. Maximal degree in co-relation 13216. Up to 2811 conditions per place. [2022-11-25 17:42:21,500 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 51 selfloop transitions, 5 changer transitions 33/93 dead transitions. [2022-11-25 17:42:21,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 93 transitions, 651 flow [2022-11-25 17:42:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:42:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:42:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2022-11-25 17:42:21,504 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5478927203065134 [2022-11-25 17:42:21,504 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2022-11-25 17:42:21,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2022-11-25 17:42:21,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:21,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2022-11-25 17:42:21,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:21,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:21,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:21,512 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 207 flow. Second operand 5 states and 715 transitions. [2022-11-25 17:42:21,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 93 transitions, 651 flow [2022-11-25 17:42:21,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 93 transitions, 623 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:42:21,517 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 241 flow [2022-11-25 17:42:21,517 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-25 17:42:21,518 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-11-25 17:42:21,518 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 241 flow [2022-11-25 17:42:21,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:21,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:21,519 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:21,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:42:21,519 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:42:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1543615934, now seen corresponding path program 1 times [2022-11-25 17:42:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:21,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615674566] [2022-11-25 17:42:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:21,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:21,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615674566] [2022-11-25 17:42:21,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615674566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:21,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:21,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:42:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708438272] [2022-11-25 17:42:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:21,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:42:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:42:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:42:21,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 261 [2022-11-25 17:42:21,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 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-11-25 17:42:21,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:21,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 261 [2022-11-25 17:42:21,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:22,467 INFO L130 PetriNetUnfolder]: 1692/2608 cut-off events. [2022-11-25 17:42:22,468 INFO L131 PetriNetUnfolder]: For 5130/5397 co-relation queries the response was YES. [2022-11-25 17:42:22,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10328 conditions, 2608 events. 1692/2608 cut-off events. For 5130/5397 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13449 event pairs, 200 based on Foata normal form. 488/3081 useless extension candidates. Maximal degree in co-relation 10314. Up to 1114 conditions per place. [2022-11-25 17:42:22,486 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 68 selfloop transitions, 9 changer transitions 33/114 dead transitions. [2022-11-25 17:42:22,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 114 transitions, 851 flow [2022-11-25 17:42:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:42:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:42:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions. [2022-11-25 17:42:22,490 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5491698595146871 [2022-11-25 17:42:22,490 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 860 transitions. [2022-11-25 17:42:22,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions. [2022-11-25 17:42:22,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:22,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions. [2022-11-25 17:42:22,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:22,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:22,497 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:22,498 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 241 flow. Second operand 6 states and 860 transitions. [2022-11-25 17:42:22,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 114 transitions, 851 flow [2022-11-25 17:42:22,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 114 transitions, 842 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 17:42:22,511 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 308 flow [2022-11-25 17:42:22,512 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-11-25 17:42:22,512 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-11-25 17:42:22,513 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 308 flow [2022-11-25 17:42:22,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 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-11-25 17:42:22,513 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:22,513 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:22,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:42:22,514 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:42:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1101607934, now seen corresponding path program 1 times [2022-11-25 17:42:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:22,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744171032] [2022-11-25 17:42:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:22,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:22,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744171032] [2022-11-25 17:42:22,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744171032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:22,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:22,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:42:22,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954517116] [2022-11-25 17:42:22,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:22,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:42:22,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:42:22,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:42:22,855 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 261 [2022-11-25 17:42:22,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:22,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:22,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 261 [2022-11-25 17:42:22,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:23,351 INFO L130 PetriNetUnfolder]: 1041/1639 cut-off events. [2022-11-25 17:42:23,352 INFO L131 PetriNetUnfolder]: For 4041/4198 co-relation queries the response was YES. [2022-11-25 17:42:23,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7239 conditions, 1639 events. 1041/1639 cut-off events. For 4041/4198 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7947 event pairs, 139 based on Foata normal form. 255/1879 useless extension candidates. Maximal degree in co-relation 7223. Up to 647 conditions per place. [2022-11-25 17:42:23,364 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 74 selfloop transitions, 13 changer transitions 28/119 dead transitions. [2022-11-25 17:42:23,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 119 transitions, 980 flow [2022-11-25 17:42:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:42:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:42:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1003 transitions. [2022-11-25 17:42:23,368 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5489874110563766 [2022-11-25 17:42:23,368 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1003 transitions. [2022-11-25 17:42:23,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1003 transitions. [2022-11-25 17:42:23,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:23,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1003 transitions. [2022-11-25 17:42:23,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.28571428571428) internal successors, (1003), 7 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:23,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:23,376 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:23,377 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 308 flow. Second operand 7 states and 1003 transitions. [2022-11-25 17:42:23,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 119 transitions, 980 flow [2022-11-25 17:42:23,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 119 transitions, 914 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-11-25 17:42:23,398 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 339 flow [2022-11-25 17:42:23,399 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2022-11-25 17:42:23,399 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-11-25 17:42:23,399 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 339 flow [2022-11-25 17:42:23,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:23,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:23,400 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:23,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:42:23,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:42:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1262981394, now seen corresponding path program 1 times [2022-11-25 17:42:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:23,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119202865] [2022-11-25 17:42:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:24,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119202865] [2022-11-25 17:42:24,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119202865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:24,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:24,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:42:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800846318] [2022-11-25 17:42:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:24,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:42:24,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:24,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:42:24,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:42:24,366 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 261 [2022-11-25 17:42:24,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:24,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:24,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 261 [2022-11-25 17:42:24,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:24,899 INFO L130 PetriNetUnfolder]: 1360/2159 cut-off events. [2022-11-25 17:42:24,900 INFO L131 PetriNetUnfolder]: For 6003/6011 co-relation queries the response was YES. [2022-11-25 17:42:24,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9568 conditions, 2159 events. 1360/2159 cut-off events. For 6003/6011 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10920 event pairs, 367 based on Foata normal form. 10/2168 useless extension candidates. Maximal degree in co-relation 9551. Up to 1221 conditions per place. [2022-11-25 17:42:24,915 INFO L137 encePairwiseOnDemand]: 252/261 looper letters, 57 selfloop transitions, 10 changer transitions 16/85 dead transitions. [2022-11-25 17:42:24,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 816 flow [2022-11-25 17:42:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:42:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:42:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2022-11-25 17:42:24,918 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5310344827586206 [2022-11-25 17:42:24,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2022-11-25 17:42:24,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2022-11-25 17:42:24,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:24,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2022-11-25 17:42:24,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:24,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:24,926 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:24,926 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 339 flow. Second operand 5 states and 693 transitions. [2022-11-25 17:42:24,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 816 flow [2022-11-25 17:42:24,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 676 flow, removed 47 selfloop flow, removed 5 redundant places. [2022-11-25 17:42:24,951 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 307 flow [2022-11-25 17:42:24,952 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2022-11-25 17:42:24,953 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-11-25 17:42:24,953 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 307 flow [2022-11-25 17:42:24,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:24,953 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:24,954 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:24,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:42:24,954 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:42:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash -763043151, now seen corresponding path program 1 times [2022-11-25 17:42:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:24,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683486634] [2022-11-25 17:42:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:25,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683486634] [2022-11-25 17:42:25,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683486634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:25,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:25,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:42:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301673919] [2022-11-25 17:42:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:25,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:42:25,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:25,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:42:25,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:42:25,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 261 [2022-11-25 17:42:25,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:25,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:42:25,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 261 [2022-11-25 17:42:25,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:42:25,848 INFO L130 PetriNetUnfolder]: 1173/1852 cut-off events. [2022-11-25 17:42:25,848 INFO L131 PetriNetUnfolder]: For 4014/4092 co-relation queries the response was YES. [2022-11-25 17:42:25,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7605 conditions, 1852 events. 1173/1852 cut-off events. For 4014/4092 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9522 event pairs, 164 based on Foata normal form. 110/1948 useless extension candidates. Maximal degree in co-relation 7589. Up to 700 conditions per place. [2022-11-25 17:42:25,859 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 61 selfloop transitions, 17 changer transitions 26/106 dead transitions. [2022-11-25 17:42:25,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 106 transitions, 917 flow [2022-11-25 17:42:25,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:42:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:42:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1124 transitions. [2022-11-25 17:42:25,863 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5383141762452107 [2022-11-25 17:42:25,863 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1124 transitions. [2022-11-25 17:42:25,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1124 transitions. [2022-11-25 17:42:25,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:25,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1124 transitions. [2022-11-25 17:42:25,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.5) internal successors, (1124), 8 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:25,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:25,871 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:25,871 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 307 flow. Second operand 8 states and 1124 transitions. [2022-11-25 17:42:25,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 106 transitions, 917 flow [2022-11-25 17:42:25,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 756 flow, removed 39 selfloop flow, removed 7 redundant places. [2022-11-25 17:42:25,901 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 274 flow [2022-11-25 17:42:25,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2022-11-25 17:42:25,902 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2022-11-25 17:42:25,903 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 274 flow [2022-11-25 17:42:25,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:25,903 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:42:25,904 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:25,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:42:25,904 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:42:25,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1867389120, now seen corresponding path program 1 times [2022-11-25 17:42:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:25,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707017000] [2022-11-25 17:42:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:26,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:26,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:26,132 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:42:26,133 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-25 17:42:26,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-11-25 17:42:26,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-25 17:42:26,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-25 17:42:26,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-11-25 17:42:26,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:42:26,137 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:26,146 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:42:26,146 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:42:26,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:42:26 BasicIcfg [2022-11-25 17:42:26,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:42:26,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:42:26,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:42:26,286 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:42:26,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:41:52" (3/4) ... [2022-11-25 17:42:26,288 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:42:26,385 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:42:26,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:42:26,386 INFO L158 Benchmark]: Toolchain (without parser) took 35874.22ms. Allocated memory was 157.3MB in the beginning and 723.5MB in the end (delta: 566.2MB). Free memory was 121.7MB in the beginning and 439.5MB in the end (delta: -317.8MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. [2022-11-25 17:42:26,386 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 91.7MB in the end (delta: 79.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:42:26,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.21ms. Allocated memory is still 157.3MB. Free memory was 121.4MB in the beginning and 93.6MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:42:26,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.48ms. Allocated memory is still 157.3MB. Free memory was 93.2MB in the beginning and 90.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:42:26,391 INFO L158 Benchmark]: Boogie Preprocessor took 58.32ms. Allocated memory is still 157.3MB. Free memory was 90.5MB in the beginning and 88.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:42:26,391 INFO L158 Benchmark]: RCFGBuilder took 1179.61ms. Allocated memory is still 157.3MB. Free memory was 88.1MB in the beginning and 71.3MB in the end (delta: 16.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2022-11-25 17:42:26,393 INFO L158 Benchmark]: TraceAbstraction took 33704.01ms. Allocated memory was 157.3MB in the beginning and 723.5MB in the end (delta: 566.2MB). Free memory was 70.8MB in the beginning and 458.3MB in the end (delta: -387.6MB). Peak memory consumption was 178.6MB. Max. memory is 16.1GB. [2022-11-25 17:42:26,394 INFO L158 Benchmark]: Witness Printer took 100.16ms. Allocated memory is still 723.5MB. Free memory was 458.3MB in the beginning and 439.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:42:26,395 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.25ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 91.7MB in the end (delta: 79.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 743.21ms. Allocated memory is still 157.3MB. Free memory was 121.4MB in the beginning and 93.6MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.48ms. Allocated memory is still 157.3MB. Free memory was 93.2MB in the beginning and 90.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.32ms. Allocated memory is still 157.3MB. Free memory was 90.5MB in the beginning and 88.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1179.61ms. Allocated memory is still 157.3MB. Free memory was 88.1MB in the beginning and 71.3MB in the end (delta: 16.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33704.01ms. Allocated memory was 157.3MB in the beginning and 723.5MB in the end (delta: 566.2MB). Free memory was 70.8MB in the beginning and 458.3MB in the end (delta: -387.6MB). Peak memory consumption was 178.6MB. Max. memory is 16.1GB. * Witness Printer took 100.16ms. Allocated memory is still 723.5MB. Free memory was 458.3MB in the beginning and 439.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.5s, 141 PlacesBefore, 36 PlacesAfterwards, 129 TransitionsBefore, 24 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 8 FixpointIterations, 63 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 112 TotalNumberOfCompositions, 4687 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2095, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1240, independent: 1185, independent conditional: 0, independent unconditional: 1185, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1240, independent: 1150, independent conditional: 0, independent unconditional: 1150, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1013, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 939, dependent conditional: 0, dependent unconditional: 939, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2095, independent: 713, independent conditional: 0, independent unconditional: 713, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 1240, unknown conditional: 0, unknown unconditional: 1240] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2161, ((void *)0), P0, ((void *)0))=-4, t2161={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t2162; [L854] FCALL, FORK 0 pthread_create(&t2162, ((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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2162, ((void *)0), P1, ((void *)0))=-3, t2161={6:0}, t2162={7:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t2163; [L782] 1 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 x = 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t2163, ((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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2163, ((void *)0), P2, ((void *)0))=-2, t2161={6:0}, t2162={7:0}, t2163={8:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t2164; [L806] 3 __unbuffered_p2_EAX = x 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2164, ((void *)0), P3, ((void *)0))=-1, t2161={6:0}, t2162={7:0}, t2163={8:0}, t2164={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 4 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2161={6:0}, t2162={7:0}, t2163={8:0}, t2164={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 x == 2 && y == 2 [L884] EXPR 0 \read(y) [L884] EXPR 0 x == 2 && y == 2 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0: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=2, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 852]: 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: 856]: 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: 858]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 180 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 583 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1253 IncrementalHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 41 mSDtfsCounter, 1253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=11, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 1437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:42:26,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9cec56-7e30-4be5-a55b-b7c5d72c78c0/bin/uautomizer-ZsLfNo2U6R/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