./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039.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_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/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_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/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_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/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 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- 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 18:08:18,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:08:18,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:08:18,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:08:18,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:08:18,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:08:18,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:08:18,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:08:18,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:08:18,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:08:18,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:08:18,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:08:18,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:08:18,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:08:18,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:08:18,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:08:18,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:08:18,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:08:18,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:08:18,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:08:18,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:08:18,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:08:18,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:08:18,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:08:18,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:08:18,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:08:18,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:08:18,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:08:18,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:08:18,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:08:18,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:08:18,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:08:18,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:08:18,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:08:18,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:08:18,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:08:18,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:08:18,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:08:18,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:08:18,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:08:18,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:08:18,228 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:08:18,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:08:18,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:08:18,278 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:08:18,279 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:08:18,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:08:18,280 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:08:18,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:08:18,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:08:18,282 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:08:18,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:08:18,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:08:18,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:08:18,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:08:18,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:08:18,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:08:18,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:08:18,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:08:18,288 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:08:18,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:08:18,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:08:18,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:08:18,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:08:18,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:08:18,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:08:18,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:08:18,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:08:18,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:08:18,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:08:18,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:08:18,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:08:18,293 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:08:18,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:08:18,293 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:08:18,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:08:18,294 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_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/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_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/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 -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2022-11-25 18:08:18,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:08:18,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:08:18,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:08:18,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:08:18,657 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:08:18,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-11-25 18:08:22,411 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:08:22,754 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:08:22,755 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-11-25 18:08:22,774 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/data/1425a7baf/6b6f5b9a128b4293ba72b58b8074e4cd/FLAGee2d8dd6b [2022-11-25 18:08:22,793 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/data/1425a7baf/6b6f5b9a128b4293ba72b58b8074e4cd [2022-11-25 18:08:22,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:08:22,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:08:22,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:08:22,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:08:22,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:08:22,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:08:22" (1/1) ... [2022-11-25 18:08:22,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4162de98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:22, skipping insertion in model container [2022-11-25 18:08:22,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:08:22" (1/1) ... [2022-11-25 18:08:22,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:08:22,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:08:23,108 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_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-11-25 18:08:23,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:08:23,487 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:08:23,507 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_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-11-25 18:08:23,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:08:23,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:08:23,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:08:23,696 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:08:23,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23 WrapperNode [2022-11-25 18:08:23,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:08:23,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:08:23,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:08:23,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:08:23,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,806 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-25 18:08:23,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:08:23,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:08:23,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:08:23,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:08:23,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,880 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:08:23,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:08:23,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:08:23,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:08:23,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (1/1) ... [2022-11-25 18:08:23,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:08:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:08:23,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:08:23,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:08:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:08:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:08:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:08:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:08:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:08:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:08:24,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:08:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:08:24,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:08:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:08:24,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:08:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 18:08:24,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 18:08:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:08:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:08:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:08:24,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:08:24,016 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 18:08:24,276 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:08:24,293 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:08:24,818 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:08:25,021 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:08:25,021 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:08:25,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:08:25 BoogieIcfgContainer [2022-11-25 18:08:25,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:08:25,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:08:25,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:08:25,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:08:25,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:08:22" (1/3) ... [2022-11-25 18:08:25,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256172ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:08:25, skipping insertion in model container [2022-11-25 18:08:25,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:08:23" (2/3) ... [2022-11-25 18:08:25,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256172ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:08:25, skipping insertion in model container [2022-11-25 18:08:25,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:08:25" (3/3) ... [2022-11-25 18:08:25,050 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2022-11-25 18:08:25,074 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:08:25,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:08:25,089 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:08:25,090 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:08:25,195 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:08:25,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-11-25 18:08:25,365 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-11-25 18:08:25,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:08:25,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-25 18:08:25,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-11-25 18:08:25,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-11-25 18:08:25,384 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:08:25,403 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2022-11-25 18:08:25,407 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2022-11-25 18:08:25,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2022-11-25 18:08:25,444 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-11-25 18:08:25,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:08:25,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-25 18:08:25,449 INFO L119 LiptonReduction]: Number of co-enabled transitions 3518 [2022-11-25 18:08:32,039 INFO L134 LiptonReduction]: Checked pairs total: 9433 [2022-11-25 18:08:32,039 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-25 18:08:32,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:08:32,063 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;@560e95da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:08:32,064 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 18:08:32,067 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-11-25 18:08:32,067 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:08:32,067 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:32,068 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 18:08:32,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 577052, now seen corresponding path program 1 times [2022-11-25 18:08:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:32,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657203044] [2022-11-25 18:08:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:32,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:32,600 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 18:08:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:32,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657203044] [2022-11-25 18:08:32,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657203044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:32,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:32,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:08:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259340379] [2022-11-25 18:08:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:32,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:08:32,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:32,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:08:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:08:32,666 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 258 [2022-11-25 18:08:32,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 18:08:32,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:32,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 258 [2022-11-25 18:08:32,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:34,655 INFO L130 PetriNetUnfolder]: 7063/9701 cut-off events. [2022-11-25 18:08:34,655 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-25 18:08:34,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19413 conditions, 9701 events. 7063/9701 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 49468 event pairs, 2679 based on Foata normal form. 0/9311 useless extension candidates. Maximal degree in co-relation 19401. Up to 7615 conditions per place. [2022-11-25 18:08:34,735 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2022-11-25 18:08:34,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 223 flow [2022-11-25 18:08:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:08:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:08:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2022-11-25 18:08:34,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5478036175710594 [2022-11-25 18:08:34,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2022-11-25 18:08:34,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2022-11-25 18:08:34,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:34,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2022-11-25 18:08:34,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 18:08:34,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 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 18:08:34,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 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 18:08:34,785 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 424 transitions. [2022-11-25 18:08:34,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 223 flow [2022-11-25 18:08:34,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 18:08:34,793 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2022-11-25 18:08:34,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-11-25 18:08:34,800 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-11-25 18:08:34,800 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2022-11-25 18:08:34,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 18:08:34,801 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:34,801 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:08:34,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:08:34,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1852707673, now seen corresponding path program 1 times [2022-11-25 18:08:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:34,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949948056] [2022-11-25 18:08:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:35,234 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 18:08:35,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:35,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949948056] [2022-11-25 18:08:35,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949948056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:35,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:35,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:08:35,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143395071] [2022-11-25 18:08:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:35,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:08:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:35,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:08:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:08:35,251 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 258 [2022-11-25 18:08:35,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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 18:08:35,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:35,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 258 [2022-11-25 18:08:35,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:37,189 INFO L130 PetriNetUnfolder]: 8205/11647 cut-off events. [2022-11-25 18:08:37,189 INFO L131 PetriNetUnfolder]: For 747/747 co-relation queries the response was YES. [2022-11-25 18:08:37,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23807 conditions, 11647 events. 8205/11647 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 65646 event pairs, 1931 based on Foata normal form. 480/12126 useless extension candidates. Maximal degree in co-relation 23797. Up to 9163 conditions per place. [2022-11-25 18:08:37,261 INFO L137 encePairwiseOnDemand]: 253/258 looper letters, 41 selfloop transitions, 3 changer transitions 27/73 dead transitions. [2022-11-25 18:08:37,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 310 flow [2022-11-25 18:08:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:08:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:08:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2022-11-25 18:08:37,265 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5217054263565891 [2022-11-25 18:08:37,265 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2022-11-25 18:08:37,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2022-11-25 18:08:37,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:37,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2022-11-25 18:08:37,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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 18:08:37,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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 18:08:37,273 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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 18:08:37,274 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 5 states and 673 transitions. [2022-11-25 18:08:37,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 310 flow [2022-11-25 18:08:37,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 73 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:08:37,284 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 93 flow [2022-11-25 18:08:37,284 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-11-25 18:08:37,286 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2022-11-25 18:08:37,286 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 93 flow [2022-11-25 18:08:37,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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 18:08:37,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:37,288 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:08:37,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:08:37,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:37,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1599339173, now seen corresponding path program 1 times [2022-11-25 18:08:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:37,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902328129] [2022-11-25 18:08:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:37,571 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 18:08:37,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:37,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902328129] [2022-11-25 18:08:37,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902328129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:37,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:37,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:08:37,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600080270] [2022-11-25 18:08:37,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:37,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:08:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:37,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:08:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:08:37,605 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 258 [2022-11-25 18:08:37,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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 18:08:37,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:37,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 258 [2022-11-25 18:08:37,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:41,105 INFO L130 PetriNetUnfolder]: 16331/22182 cut-off events. [2022-11-25 18:08:41,106 INFO L131 PetriNetUnfolder]: For 7216/7216 co-relation queries the response was YES. [2022-11-25 18:08:41,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50553 conditions, 22182 events. 16331/22182 cut-off events. For 7216/7216 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 112830 event pairs, 3144 based on Foata normal form. 990/23172 useless extension candidates. Maximal degree in co-relation 50540. Up to 10528 conditions per place. [2022-11-25 18:08:41,231 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 55 selfloop transitions, 8 changer transitions 44/107 dead transitions. [2022-11-25 18:08:41,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 107 transitions, 505 flow [2022-11-25 18:08:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:08:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:08:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 897 transitions. [2022-11-25 18:08:41,236 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49667774086378735 [2022-11-25 18:08:41,236 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 897 transitions. [2022-11-25 18:08:41,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 897 transitions. [2022-11-25 18:08:41,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:41,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 897 transitions. [2022-11-25 18:08:41,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 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 18:08:41,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:08:41,245 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:08:41,245 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 93 flow. Second operand 7 states and 897 transitions. [2022-11-25 18:08:41,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 107 transitions, 505 flow [2022-11-25 18:08:41,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 107 transitions, 496 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 18:08:41,364 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 174 flow [2022-11-25 18:08:41,364 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-11-25 18:08:41,366 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2022-11-25 18:08:41,366 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 174 flow [2022-11-25 18:08:41,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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 18:08:41,367 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:41,367 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:08:41,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:08:41,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1541992608, now seen corresponding path program 1 times [2022-11-25 18:08:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:41,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140555365] [2022-11-25 18:08:41,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:41,569 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 18:08:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:41,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140555365] [2022-11-25 18:08:41,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140555365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:41,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:41,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:08:41,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309222797] [2022-11-25 18:08:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:41,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:08:41,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:08:41,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:08:41,582 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 18:08:41,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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 18:08:41,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:41,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 18:08:41,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:43,628 INFO L130 PetriNetUnfolder]: 8546/12391 cut-off events. [2022-11-25 18:08:43,628 INFO L131 PetriNetUnfolder]: For 13938/14488 co-relation queries the response was YES. [2022-11-25 18:08:43,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33289 conditions, 12391 events. 8546/12391 cut-off events. For 13938/14488 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 73425 event pairs, 1802 based on Foata normal form. 826/12774 useless extension candidates. Maximal degree in co-relation 33270. Up to 6152 conditions per place. [2022-11-25 18:08:43,714 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 64 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2022-11-25 18:08:43,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 462 flow [2022-11-25 18:08:43,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:08:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:08:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2022-11-25 18:08:43,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5184108527131783 [2022-11-25 18:08:43,717 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2022-11-25 18:08:43,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2022-11-25 18:08:43,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:43,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2022-11-25 18:08:43,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 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 18:08:43,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 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 18:08:43,723 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 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 18:08:43,723 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 174 flow. Second operand 4 states and 535 transitions. [2022-11-25 18:08:43,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 462 flow [2022-11-25 18:08:43,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 446 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 18:08:43,795 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 210 flow [2022-11-25 18:08:43,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-11-25 18:08:43,796 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2022-11-25 18:08:43,796 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 210 flow [2022-11-25 18:08:43,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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 18:08:43,797 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:43,797 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 18:08:43,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:08:43,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -360516082, now seen corresponding path program 1 times [2022-11-25 18:08:43,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:43,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283603969] [2022-11-25 18:08:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:43,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:43,972 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 18:08:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:43,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283603969] [2022-11-25 18:08:43,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283603969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:43,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:43,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:08:43,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209317421] [2022-11-25 18:08:43,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:43,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:08:43,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:43,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:08:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:08:43,988 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 258 [2022-11-25 18:08:43,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 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 18:08:43,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:43,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 258 [2022-11-25 18:08:43,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:46,530 INFO L130 PetriNetUnfolder]: 12505/18163 cut-off events. [2022-11-25 18:08:46,531 INFO L131 PetriNetUnfolder]: For 20355/20893 co-relation queries the response was YES. [2022-11-25 18:08:46,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56422 conditions, 18163 events. 12505/18163 cut-off events. For 20355/20893 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 113033 event pairs, 5074 based on Foata normal form. 348/17865 useless extension candidates. Maximal degree in co-relation 56402. Up to 8715 conditions per place. [2022-11-25 18:08:46,765 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 55 selfloop transitions, 6 changer transitions 23/88 dead transitions. [2022-11-25 18:08:46,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 556 flow [2022-11-25 18:08:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:08:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:08:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2022-11-25 18:08:46,768 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5201550387596899 [2022-11-25 18:08:46,768 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2022-11-25 18:08:46,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2022-11-25 18:08:46,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:46,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2022-11-25 18:08:46,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 18:08:46,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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 18:08:46,776 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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 18:08:46,776 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 210 flow. Second operand 5 states and 671 transitions. [2022-11-25 18:08:46,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 556 flow [2022-11-25 18:08:46,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 547 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-25 18:08:46,790 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 228 flow [2022-11-25 18:08:46,791 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2022-11-25 18:08:46,795 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-11-25 18:08:46,795 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 228 flow [2022-11-25 18:08:46,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 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 18:08:46,796 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:46,796 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 18:08:46,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:08:46,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1403860814, now seen corresponding path program 1 times [2022-11-25 18:08:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:46,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216891596] [2022-11-25 18:08:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:47,114 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 18:08:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:47,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216891596] [2022-11-25 18:08:47,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216891596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:47,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:47,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:08:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064630697] [2022-11-25 18:08:47,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:47,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:08:47,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:47,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:08:47,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:08:47,136 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 18:08:47,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 18:08:47,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:47,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 18:08:47,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:48,679 INFO L130 PetriNetUnfolder]: 8095/12121 cut-off events. [2022-11-25 18:08:48,680 INFO L131 PetriNetUnfolder]: For 13061/13635 co-relation queries the response was YES. [2022-11-25 18:08:48,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36523 conditions, 12121 events. 8095/12121 cut-off events. For 13061/13635 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 77555 event pairs, 1818 based on Foata normal form. 752/12379 useless extension candidates. Maximal degree in co-relation 36500. Up to 4472 conditions per place. [2022-11-25 18:08:48,735 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 82 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2022-11-25 18:08:48,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 100 transitions, 643 flow [2022-11-25 18:08:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:08:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:08:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-25 18:08:48,745 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5209302325581395 [2022-11-25 18:08:48,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-25 18:08:48,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-25 18:08:48,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:48,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-25 18:08:48,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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 18:08:48,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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 18:08:48,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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 18:08:48,753 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 228 flow. Second operand 5 states and 672 transitions. [2022-11-25 18:08:48,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 100 transitions, 643 flow [2022-11-25 18:08:48,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 619 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 18:08:48,796 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 283 flow [2022-11-25 18:08:48,797 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-11-25 18:08:48,800 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2022-11-25 18:08:48,800 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 283 flow [2022-11-25 18:08:48,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 18:08:48,801 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:48,801 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] [2022-11-25 18:08:48,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:08:48,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash -18262944, now seen corresponding path program 1 times [2022-11-25 18:08:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:48,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646506821] [2022-11-25 18:08:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:48,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:49,283 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 18:08:49,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646506821] [2022-11-25 18:08:49,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646506821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:49,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:49,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:08:49,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448614607] [2022-11-25 18:08:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:49,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:08:49,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:08:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:08:49,327 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2022-11-25 18:08:49,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 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 18:08:49,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:49,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2022-11-25 18:08:49,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:52,378 INFO L130 PetriNetUnfolder]: 16194/23719 cut-off events. [2022-11-25 18:08:52,378 INFO L131 PetriNetUnfolder]: For 54136/54136 co-relation queries the response was YES. [2022-11-25 18:08:52,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84616 conditions, 23719 events. 16194/23719 cut-off events. For 54136/54136 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 148475 event pairs, 765 based on Foata normal form. 169/23888 useless extension candidates. Maximal degree in co-relation 84592. Up to 10876 conditions per place. [2022-11-25 18:08:52,469 INFO L137 encePairwiseOnDemand]: 248/258 looper letters, 95 selfloop transitions, 19 changer transitions 48/162 dead transitions. [2022-11-25 18:08:52,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 162 transitions, 1257 flow [2022-11-25 18:08:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:08:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:08:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions. [2022-11-25 18:08:52,474 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49224806201550386 [2022-11-25 18:08:52,474 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions. [2022-11-25 18:08:52,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions. [2022-11-25 18:08:52,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:52,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions. [2022-11-25 18:08:52,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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 18:08:52,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:08:52,482 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:08:52,482 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 283 flow. Second operand 7 states and 889 transitions. [2022-11-25 18:08:52,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 162 transitions, 1257 flow [2022-11-25 18:08:52,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 162 transitions, 1209 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-11-25 18:08:52,554 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 445 flow [2022-11-25 18:08:52,554 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2022-11-25 18:08:52,555 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2022-11-25 18:08:52,555 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 445 flow [2022-11-25 18:08:52,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 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 18:08:52,556 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:52,556 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] [2022-11-25 18:08:52,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:08:52,557 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 524577928, now seen corresponding path program 2 times [2022-11-25 18:08:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:52,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022737135] [2022-11-25 18:08:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:52,863 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 18:08:52,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022737135] [2022-11-25 18:08:52,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022737135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:52,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:52,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:08:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635507061] [2022-11-25 18:08:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:52,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:08:52,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:52,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:08:52,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:08:52,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 18:08:52,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 445 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 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 18:08:52,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:52,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 18:08:52,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:54,188 INFO L130 PetriNetUnfolder]: 4109/6560 cut-off events. [2022-11-25 18:08:54,188 INFO L131 PetriNetUnfolder]: For 16416/16620 co-relation queries the response was YES. [2022-11-25 18:08:54,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24250 conditions, 6560 events. 4109/6560 cut-off events. For 16416/16620 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 39905 event pairs, 827 based on Foata normal form. 430/6913 useless extension candidates. Maximal degree in co-relation 24220. Up to 2151 conditions per place. [2022-11-25 18:08:54,232 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 113 selfloop transitions, 14 changer transitions 2/142 dead transitions. [2022-11-25 18:08:54,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 142 transitions, 1221 flow [2022-11-25 18:08:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:08:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:08:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 805 transitions. [2022-11-25 18:08:54,239 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5200258397932817 [2022-11-25 18:08:54,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 805 transitions. [2022-11-25 18:08:54,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 805 transitions. [2022-11-25 18:08:54,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:54,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 805 transitions. [2022-11-25 18:08:54,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 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 18:08:54,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 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 18:08:54,247 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 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 18:08:54,248 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 445 flow. Second operand 6 states and 805 transitions. [2022-11-25 18:08:54,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 142 transitions, 1221 flow [2022-11-25 18:08:54,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 142 transitions, 1165 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-11-25 18:08:54,480 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 490 flow [2022-11-25 18:08:54,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2022-11-25 18:08:54,483 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2022-11-25 18:08:54,484 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 490 flow [2022-11-25 18:08:54,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 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 18:08:54,484 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:54,485 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, 1, 1] [2022-11-25 18:08:54,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:08:54,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:54,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1604488127, now seen corresponding path program 1 times [2022-11-25 18:08:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:54,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520313938] [2022-11-25 18:08:54,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:54,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:55,585 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 18:08:55,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:55,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520313938] [2022-11-25 18:08:55,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520313938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:55,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:55,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:08:55,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802687537] [2022-11-25 18:08:55,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:55,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:08:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:55,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:08:55,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:08:55,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 258 [2022-11-25 18:08:55,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 490 flow. Second operand has 8 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 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 18:08:55,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:55,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 258 [2022-11-25 18:08:55,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:57,632 INFO L130 PetriNetUnfolder]: 6817/11099 cut-off events. [2022-11-25 18:08:57,632 INFO L131 PetriNetUnfolder]: For 31600/31885 co-relation queries the response was YES. [2022-11-25 18:08:57,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44213 conditions, 11099 events. 6817/11099 cut-off events. For 31600/31885 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 77135 event pairs, 907 based on Foata normal form. 101/11130 useless extension candidates. Maximal degree in co-relation 44183. Up to 4177 conditions per place. [2022-11-25 18:08:57,697 INFO L137 encePairwiseOnDemand]: 250/258 looper letters, 121 selfloop transitions, 7 changer transitions 63/204 dead transitions. [2022-11-25 18:08:57,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 204 transitions, 1888 flow [2022-11-25 18:08:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:08:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:08:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1038 transitions. [2022-11-25 18:08:57,702 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.502906976744186 [2022-11-25 18:08:57,702 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1038 transitions. [2022-11-25 18:08:57,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1038 transitions. [2022-11-25 18:08:57,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:57,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1038 transitions. [2022-11-25 18:08:57,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.75) internal successors, (1038), 8 states have internal predecessors, (1038), 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 18:08:57,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 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 18:08:57,711 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 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 18:08:57,712 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 490 flow. Second operand 8 states and 1038 transitions. [2022-11-25 18:08:57,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 204 transitions, 1888 flow [2022-11-25 18:08:58,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 204 transitions, 1748 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-11-25 18:08:58,041 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 522 flow [2022-11-25 18:08:58,042 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=522, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2022-11-25 18:08:58,043 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2022-11-25 18:08:58,043 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 522 flow [2022-11-25 18:08:58,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 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 18:08:58,047 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:08:58,048 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, 1, 1] [2022-11-25 18:08:58,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:08:58,050 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:08:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -955456249, now seen corresponding path program 2 times [2022-11-25 18:08:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:08:58,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393633838] [2022-11-25 18:08:58,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:58,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:08:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:58,480 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 18:08:58,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:08:58,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393633838] [2022-11-25 18:08:58,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393633838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:08:58,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:08:58,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:08:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590340475] [2022-11-25 18:08:58,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:08:58,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:08:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:08:58,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:08:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:08:58,500 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 18:08:58,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 522 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 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 18:08:58,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:08:58,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 18:08:58,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:08:59,810 INFO L130 PetriNetUnfolder]: 5116/8317 cut-off events. [2022-11-25 18:08:59,811 INFO L131 PetriNetUnfolder]: For 20552/20715 co-relation queries the response was YES. [2022-11-25 18:08:59,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32532 conditions, 8317 events. 5116/8317 cut-off events. For 20552/20715 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 55233 event pairs, 814 based on Foata normal form. 177/8401 useless extension candidates. Maximal degree in co-relation 32505. Up to 2722 conditions per place. [2022-11-25 18:08:59,860 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 94 selfloop transitions, 18 changer transitions 14/136 dead transitions. [2022-11-25 18:08:59,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 136 transitions, 1200 flow [2022-11-25 18:08:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:08:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:08:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2022-11-25 18:08:59,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5038759689922481 [2022-11-25 18:08:59,865 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2022-11-25 18:08:59,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2022-11-25 18:08:59,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:08:59,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2022-11-25 18:08:59,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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 18:08:59,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:08:59,873 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:08:59,873 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 522 flow. Second operand 7 states and 910 transitions. [2022-11-25 18:08:59,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 136 transitions, 1200 flow [2022-11-25 18:09:00,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 136 transitions, 1158 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-11-25 18:09:00,348 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 491 flow [2022-11-25 18:09:00,348 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=491, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2022-11-25 18:09:00,349 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2022-11-25 18:09:00,349 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 491 flow [2022-11-25 18:09:00,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 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 18:09:00,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:09:00,350 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:00,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:09:00,351 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:09:00,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash -27937909, now seen corresponding path program 1 times [2022-11-25 18:09:00,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:00,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179388708] [2022-11-25 18:09:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:00,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:00,713 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 18:09:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:00,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179388708] [2022-11-25 18:09:00,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179388708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:00,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:00,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:09:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611452100] [2022-11-25 18:09:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:00,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:09:00,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:09:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:09:00,754 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2022-11-25 18:09:00,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 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 18:09:00,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:09:00,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2022-11-25 18:09:00,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:09:01,943 INFO L130 PetriNetUnfolder]: 4818/7462 cut-off events. [2022-11-25 18:09:01,943 INFO L131 PetriNetUnfolder]: For 26265/26265 co-relation queries the response was YES. [2022-11-25 18:09:01,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33236 conditions, 7462 events. 4818/7462 cut-off events. For 26265/26265 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 41486 event pairs, 1294 based on Foata normal form. 1/7463 useless extension candidates. Maximal degree in co-relation 33203. Up to 3782 conditions per place. [2022-11-25 18:09:01,971 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 72 selfloop transitions, 12 changer transitions 76/160 dead transitions. [2022-11-25 18:09:01,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 160 transitions, 1499 flow [2022-11-25 18:09:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:09:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:09:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2022-11-25 18:09:01,975 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.482281284606866 [2022-11-25 18:09:01,975 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2022-11-25 18:09:01,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2022-11-25 18:09:01,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:09:01,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2022-11-25 18:09:01,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:09:01,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:09:01,984 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:09:01,984 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 491 flow. Second operand 7 states and 871 transitions. [2022-11-25 18:09:01,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 160 transitions, 1499 flow [2022-11-25 18:09:02,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 160 transitions, 1323 flow, removed 39 selfloop flow, removed 8 redundant places. [2022-11-25 18:09:02,161 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 404 flow [2022-11-25 18:09:02,162 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2022-11-25 18:09:02,162 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2022-11-25 18:09:02,163 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 56 transitions, 404 flow [2022-11-25 18:09:02,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 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 18:09:02,163 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:09:02,163 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:02,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:09:02,164 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:09:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1581118491, now seen corresponding path program 2 times [2022-11-25 18:09:02,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:02,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247100487] [2022-11-25 18:09:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:03,454 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 18:09:03,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:03,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247100487] [2022-11-25 18:09:03,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247100487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:03,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:03,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:09:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084079666] [2022-11-25 18:09:03,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:03,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:09:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:03,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:09:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:09:03,551 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 258 [2022-11-25 18:09:03,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 56 transitions, 404 flow. Second operand has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 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 18:09:03,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:09:03,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 258 [2022-11-25 18:09:03,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:09:04,149 INFO L130 PetriNetUnfolder]: 1226/2010 cut-off events. [2022-11-25 18:09:04,150 INFO L131 PetriNetUnfolder]: For 5673/5719 co-relation queries the response was YES. [2022-11-25 18:09:04,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8109 conditions, 2010 events. 1226/2010 cut-off events. For 5673/5719 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10311 event pairs, 243 based on Foata normal form. 39/2040 useless extension candidates. Maximal degree in co-relation 8086. Up to 1064 conditions per place. [2022-11-25 18:09:04,156 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 70 selfloop transitions, 5 changer transitions 42/125 dead transitions. [2022-11-25 18:09:04,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1081 flow [2022-11-25 18:09:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:09:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:09:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1005 transitions. [2022-11-25 18:09:04,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48691860465116277 [2022-11-25 18:09:04,160 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1005 transitions. [2022-11-25 18:09:04,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1005 transitions. [2022-11-25 18:09:04,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:09:04,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1005 transitions. [2022-11-25 18:09:04,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.625) internal successors, (1005), 8 states have internal predecessors, (1005), 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 18:09:04,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 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 18:09:04,167 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 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 18:09:04,167 INFO L175 Difference]: Start difference. First operand has 78 places, 56 transitions, 404 flow. Second operand 8 states and 1005 transitions. [2022-11-25 18:09:04,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1081 flow [2022-11-25 18:09:04,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 893 flow, removed 19 selfloop flow, removed 13 redundant places. [2022-11-25 18:09:04,202 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 343 flow [2022-11-25 18:09:04,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=343, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2022-11-25 18:09:04,203 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2022-11-25 18:09:04,203 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 343 flow [2022-11-25 18:09:04,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 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 18:09:04,204 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:09:04,204 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:04,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:09:04,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:09:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1237692017, now seen corresponding path program 3 times [2022-11-25 18:09:04,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:04,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849340612] [2022-11-25 18:09:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:04,527 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 18:09:04,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:04,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849340612] [2022-11-25 18:09:04,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849340612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:04,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:04,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:09:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646705261] [2022-11-25 18:09:04,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:04,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:09:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:09:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:09:04,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2022-11-25 18:09:04,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 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 18:09:04,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:09:04,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2022-11-25 18:09:04,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:09:05,153 INFO L130 PetriNetUnfolder]: 1453/2334 cut-off events. [2022-11-25 18:09:05,153 INFO L131 PetriNetUnfolder]: For 5469/5469 co-relation queries the response was YES. [2022-11-25 18:09:05,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8108 conditions, 2334 events. 1453/2334 cut-off events. For 5469/5469 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11181 event pairs, 255 based on Foata normal form. 1/2335 useless extension candidates. Maximal degree in co-relation 8089. Up to 883 conditions per place. [2022-11-25 18:09:05,161 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 52 selfloop transitions, 5 changer transitions 71/128 dead transitions. [2022-11-25 18:09:05,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 918 flow [2022-11-25 18:09:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:09:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:09:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2022-11-25 18:09:05,164 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2022-11-25 18:09:05,164 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2022-11-25 18:09:05,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2022-11-25 18:09:05,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:09:05,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2022-11-25 18:09:05,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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 18:09:05,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:09:05,170 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 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 18:09:05,171 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 343 flow. Second operand 7 states and 854 transitions. [2022-11-25 18:09:05,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 918 flow [2022-11-25 18:09:05,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 128 transitions, 862 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-11-25 18:09:05,179 INFO L231 Difference]: Finished difference. Result has 71 places, 43 transitions, 203 flow [2022-11-25 18:09:05,180 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=71, PETRI_TRANSITIONS=43} [2022-11-25 18:09:05,180 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2022-11-25 18:09:05,180 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 43 transitions, 203 flow [2022-11-25 18:09:05,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 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 18:09:05,181 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:09:05,181 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:05,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:09:05,181 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:09:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:05,182 INFO L85 PathProgramCache]: Analyzing trace with hash 31695997, now seen corresponding path program 4 times [2022-11-25 18:09:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:05,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228254794] [2022-11-25 18:09:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:05,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:09:05,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:09:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:09:05,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:09:05,350 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:09:05,351 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 18:09:05,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 18:09:05,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 18:09:05,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 18:09:05,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 18:09:05,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 18:09:05,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 18:09:05,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:09:05,355 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:05,362 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:09:05,363 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:09:05,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:09:05 BasicIcfg [2022-11-25 18:09:05,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:09:05,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:09:05,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:09:05,514 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:09:05,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:08:25" (3/4) ... [2022-11-25 18:09:05,517 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:09:05,654 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:09:05,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:09:05,655 INFO L158 Benchmark]: Toolchain (without parser) took 42857.27ms. Allocated memory was 199.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 158.0MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-25 18:09:05,656 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 140.5MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:09:05,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 896.26ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 129.8MB in the end (delta: 28.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 18:09:05,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.37ms. Allocated memory is still 199.2MB. Free memory was 129.8MB in the beginning and 127.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:09:05,657 INFO L158 Benchmark]: Boogie Preprocessor took 86.15ms. Allocated memory is still 199.2MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:09:05,657 INFO L158 Benchmark]: RCFGBuilder took 1126.56ms. Allocated memory is still 199.2MB. Free memory was 125.0MB in the beginning and 150.8MB in the end (delta: -25.7MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-11-25 18:09:05,660 INFO L158 Benchmark]: TraceAbstraction took 40481.97ms. Allocated memory was 199.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 149.6MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-25 18:09:05,661 INFO L158 Benchmark]: Witness Printer took 141.13ms. Allocated memory is still 3.2GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 18:09:05,662 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.41ms. Allocated memory is still 140.5MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 896.26ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 129.8MB in the end (delta: 28.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.37ms. Allocated memory is still 199.2MB. Free memory was 129.8MB in the beginning and 127.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.15ms. Allocated memory is still 199.2MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1126.56ms. Allocated memory is still 199.2MB. Free memory was 125.0MB in the beginning and 150.8MB in the end (delta: -25.7MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 40481.97ms. Allocated memory was 199.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 149.6MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 141.13ms. Allocated memory is still 3.2GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 147 PlacesBefore, 44 PlacesAfterwards, 136 TransitionsBefore, 32 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 9433 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4740, independent: 4512, independent conditional: 0, independent unconditional: 4512, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2462, independent: 2382, independent conditional: 0, independent unconditional: 2382, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2462, independent: 2350, independent conditional: 0, independent unconditional: 2350, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 112, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 906, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 855, dependent conditional: 0, dependent unconditional: 855, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4740, independent: 2130, independent conditional: 0, independent unconditional: 2130, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 2462, unknown conditional: 0, unknown unconditional: 2462] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 268, Positive conditional cache size: 0, Positive unconditional cache size: 268, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=-2, t1025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=-1, t1025={5:0}, t1026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=1, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 874]: 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: 872]: 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: 878]: 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, 178 locations, 7 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: 40.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1157 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1058 mSDsluCounter, 413 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2364 IncrementalHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 39 mSDtfsCounter, 2364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=9, InterpolantAutomatonStates: 79, 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.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 1803 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 18:09:05,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_725b5228-36fb-4fa3-a5d1-f43b5b7d9d72/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