./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:09:14,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:09:14,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:09:14,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:09:14,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:09:14,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:09:14,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:09:14,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:09:14,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:09:14,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:09:14,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:09:14,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:09:14,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:09:14,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:09:14,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:09:14,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:09:14,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:09:14,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:09:14,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:09:14,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:09:14,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:09:14,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:09:14,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:09:14,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:09:14,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:09:14,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:09:14,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:09:14,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:09:14,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:09:14,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:09:14,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:09:14,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:09:14,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:09:14,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:09:14,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:09:14,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:09:14,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:09:14,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:09:14,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:09:14,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:09:14,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:09:14,436 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:09:14,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:09:14,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:09:14,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:09:14,452 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:09:14,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:09:14,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:09:14,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:09:14,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:09:14,453 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:09:14,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:09:14,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:09:14,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:09:14,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:09:14,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:09:14,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:09:14,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:09:14,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:09:14,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:09:14,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:09:14,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:09:14,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:09:14,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:09:14,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:09:14,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:09:14,456 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:09:14,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:09:14,456 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:09:14,456 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_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2022-12-13 17:09:14,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:09:14,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:09:14,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:09:14,665 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:09:14,665 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:09:14,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2022-12-13 17:09:17,251 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:09:17,447 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:09:17,448 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2022-12-13 17:09:17,457 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/data/f07c5eed6/35a94d81a45c48c69ed9b02c816865f1/FLAGa671d2e88 [2022-12-13 17:09:17,468 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/data/f07c5eed6/35a94d81a45c48c69ed9b02c816865f1 [2022-12-13 17:09:17,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:09:17,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:09:17,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:09:17,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:09:17,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:09:17,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd6d7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17, skipping insertion in model container [2022-12-13 17:09:17,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:09:17,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:09:17,633 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_7ebb5e10-1e69-4ad1-8573-8b79000ef277/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2022-12-13 17:09:17,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:09:17,780 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:09:17,789 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_7ebb5e10-1e69-4ad1-8573-8b79000ef277/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2022-12-13 17:09:17,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:09:17,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:09:17,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:09:17,850 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:09:17,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17 WrapperNode [2022-12-13 17:09:17,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:09:17,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:09:17,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:09:17,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:09:17,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,885 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-13 17:09:17,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:09:17,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:09:17,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:09:17,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:09:17,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:09:17,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:09:17,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:09:17,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:09:17,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (1/1) ... [2022-12-13 17:09:17,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:09:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:09:17,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:09:17,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:09:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:09:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 17:09:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:09:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:09:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:09:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 17:09:17,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 17:09:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 17:09:17,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 17:09:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 17:09:17,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 17:09:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 17:09:17,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 17:09:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:09:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 17:09:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:09:17,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:09:17,973 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 17:09:18,085 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:09:18,086 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:09:18,355 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:09:18,463 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:09:18,463 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:09:18,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:09:18 BoogieIcfgContainer [2022-12-13 17:09:18,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:09:18,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:09:18,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:09:18,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:09:18,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:09:17" (1/3) ... [2022-12-13 17:09:18,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2396b41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:09:18, skipping insertion in model container [2022-12-13 17:09:18,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:09:17" (2/3) ... [2022-12-13 17:09:18,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2396b41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:09:18, skipping insertion in model container [2022-12-13 17:09:18,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:09:18" (3/3) ... [2022-12-13 17:09:18,474 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2022-12-13 17:09:18,482 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 17:09:18,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:09:18,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 17:09:18,490 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 17:09:18,539 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 17:09:18,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-12-13 17:09:18,607 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 17:09:18,608 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:09:18,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 17:09:18,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-12-13 17:09:18,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-12-13 17:09:18,618 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 17:09:18,626 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2022-12-13 17:09:18,628 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2022-12-13 17:09:18,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2022-12-13 17:09:18,649 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 17:09:18,649 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:09:18,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 17:09:18,651 INFO L119 LiptonReduction]: Number of co-enabled transitions 3276 [2022-12-13 17:09:21,747 INFO L134 LiptonReduction]: Checked pairs total: 9207 [2022-12-13 17:09:21,747 INFO L136 LiptonReduction]: Total number of compositions: 113 [2022-12-13 17:09:21,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:09:21,762 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;@54a04ae5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:09:21,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 17:09:21,765 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 17:09:21,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:09:21,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:21,766 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 17:09:21,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash 540448363, now seen corresponding path program 1 times [2022-12-13 17:09:21,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:21,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633011064] [2022-12-13 17:09:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:22,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633011064] [2022-12-13 17:09:22,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633011064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:22,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:22,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:09:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095231360] [2022-12-13 17:09:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:22,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:09:22,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:09:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:09:22,070 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 249 [2022-12-13 17:09:22,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:22,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:22,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 249 [2022-12-13 17:09:22,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:22,843 INFO L130 PetriNetUnfolder]: 5463/7934 cut-off events. [2022-12-13 17:09:22,843 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-13 17:09:22,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15534 conditions, 7934 events. 5463/7934 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47221 event pairs, 1005 based on Foata normal form. 256/7649 useless extension candidates. Maximal degree in co-relation 15522. Up to 5923 conditions per place. [2022-12-13 17:09:22,877 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2022-12-13 17:09:22,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2022-12-13 17:09:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:09:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:09:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2022-12-13 17:09:22,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5461847389558233 [2022-12-13 17:09:22,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2022-12-13 17:09:22,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2022-12-13 17:09:22,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:22,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2022-12-13 17:09:22,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:22,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:22,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:22,901 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 408 transitions. [2022-12-13 17:09:22,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2022-12-13 17:09:22,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 17:09:22,905 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-12-13 17:09:22,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, 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=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 17:09:22,909 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-12-13 17:09:22,909 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-12-13 17:09:22,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:22,910 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:22,910 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:22,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:09:22,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1859836699, now seen corresponding path program 1 times [2022-12-13 17:09:22,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:22,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028583728] [2022-12-13 17:09:22,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:22,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:23,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:23,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028583728] [2022-12-13 17:09:23,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028583728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:23,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:23,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:09:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560304495] [2022-12-13 17:09:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:23,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:09:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:23,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:09:23,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:09:23,359 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 249 [2022-12-13 17:09:23,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:23,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:23,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 249 [2022-12-13 17:09:23,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:24,251 INFO L130 PetriNetUnfolder]: 5543/7660 cut-off events. [2022-12-13 17:09:24,251 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2022-12-13 17:09:24,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16032 conditions, 7660 events. 5543/7660 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 37874 event pairs, 2427 based on Foata normal form. 320/7966 useless extension candidates. Maximal degree in co-relation 16022. Up to 6459 conditions per place. [2022-12-13 17:09:24,290 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 36 selfloop transitions, 5 changer transitions 22/66 dead transitions. [2022-12-13 17:09:24,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 66 transitions, 282 flow [2022-12-13 17:09:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:09:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:09:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2022-12-13 17:09:24,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5261044176706827 [2022-12-13 17:09:24,294 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2022-12-13 17:09:24,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2022-12-13 17:09:24,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:24,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2022-12-13 17:09:24,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:24,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:24,301 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:24,301 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 655 transitions. [2022-12-13 17:09:24,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 66 transitions, 282 flow [2022-12-13 17:09:24,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:09:24,303 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 109 flow [2022-12-13 17:09:24,304 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-12-13 17:09:24,304 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2022-12-13 17:09:24,304 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 109 flow [2022-12-13 17:09:24,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:24,305 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:24,305 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:24,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:09:24,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1090335345, now seen corresponding path program 1 times [2022-12-13 17:09:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:24,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024273474] [2022-12-13 17:09:24,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:24,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:24,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024273474] [2022-12-13 17:09:24,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024273474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:24,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:24,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:09:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183247942] [2022-12-13 17:09:24,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:24,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:09:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:09:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:09:25,058 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-12-13 17:09:25,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:25,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:25,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-12-13 17:09:25,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:26,665 INFO L130 PetriNetUnfolder]: 12458/16857 cut-off events. [2022-12-13 17:09:26,666 INFO L131 PetriNetUnfolder]: For 6332/6332 co-relation queries the response was YES. [2022-12-13 17:09:26,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42397 conditions, 16857 events. 12458/16857 cut-off events. For 6332/6332 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 82435 event pairs, 4930 based on Foata normal form. 492/17349 useless extension candidates. Maximal degree in co-relation 42384. Up to 13214 conditions per place. [2022-12-13 17:09:26,725 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 46 selfloop transitions, 10 changer transitions 28/84 dead transitions. [2022-12-13 17:09:26,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 432 flow [2022-12-13 17:09:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:09:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 17:09:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2022-12-13 17:09:26,728 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4886211512717537 [2022-12-13 17:09:26,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 730 transitions. [2022-12-13 17:09:26,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 730 transitions. [2022-12-13 17:09:26,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:26,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 730 transitions. [2022-12-13 17:09:26,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:26,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:26,732 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:26,732 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 109 flow. Second operand 6 states and 730 transitions. [2022-12-13 17:09:26,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 432 flow [2022-12-13 17:09:26,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 84 transitions, 422 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 17:09:26,833 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 207 flow [2022-12-13 17:09:26,833 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-13 17:09:26,833 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2022-12-13 17:09:26,833 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 207 flow [2022-12-13 17:09:26,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:26,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:26,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:26,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:09:26,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:26,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2020328569, now seen corresponding path program 1 times [2022-12-13 17:09:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:26,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681549765] [2022-12-13 17:09:26,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:26,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:27,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:27,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681549765] [2022-12-13 17:09:27,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681549765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:27,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:27,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:09:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791483679] [2022-12-13 17:09:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:27,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:09:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:09:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:09:27,358 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 249 [2022-12-13 17:09:27,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 207 flow. Second operand has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:27,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:27,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 249 [2022-12-13 17:09:27,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:29,021 INFO L130 PetriNetUnfolder]: 10435/14643 cut-off events. [2022-12-13 17:09:29,021 INFO L131 PetriNetUnfolder]: For 25207/25907 co-relation queries the response was YES. [2022-12-13 17:09:29,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49891 conditions, 14643 events. 10435/14643 cut-off events. For 25207/25907 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 81014 event pairs, 2545 based on Foata normal form. 656/14887 useless extension candidates. Maximal degree in co-relation 49874. Up to 9855 conditions per place. [2022-12-13 17:09:29,104 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 64 selfloop transitions, 10 changer transitions 41/121 dead transitions. [2022-12-13 17:09:29,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 121 transitions, 831 flow [2022-12-13 17:09:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:09:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:09:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 921 transitions. [2022-12-13 17:09:29,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5283993115318416 [2022-12-13 17:09:29,106 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 921 transitions. [2022-12-13 17:09:29,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 921 transitions. [2022-12-13 17:09:29,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:29,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 921 transitions. [2022-12-13 17:09:29,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.57142857142858) internal successors, (921), 7 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:29,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:29,110 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:29,110 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 207 flow. Second operand 7 states and 921 transitions. [2022-12-13 17:09:29,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 121 transitions, 831 flow [2022-12-13 17:09:29,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 121 transitions, 828 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 17:09:29,190 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 341 flow [2022-12-13 17:09:29,190 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-12-13 17:09:29,191 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2022-12-13 17:09:29,191 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 341 flow [2022-12-13 17:09:29,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:29,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:29,191 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:29,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:09:29,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1384830036, now seen corresponding path program 1 times [2022-12-13 17:09:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:29,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391900906] [2022-12-13 17:09:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:29,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:29,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391900906] [2022-12-13 17:09:29,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391900906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:29,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:29,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:09:29,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592106538] [2022-12-13 17:09:29,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:29,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:09:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:29,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:09:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:09:29,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-12-13 17:09:29,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:29,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:29,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-12-13 17:09:29,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:30,127 INFO L130 PetriNetUnfolder]: 5565/7952 cut-off events. [2022-12-13 17:09:30,128 INFO L131 PetriNetUnfolder]: For 30874/32893 co-relation queries the response was YES. [2022-12-13 17:09:30,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31338 conditions, 7952 events. 5565/7952 cut-off events. For 30874/32893 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 42194 event pairs, 1247 based on Foata normal form. 416/8037 useless extension candidates. Maximal degree in co-relation 31316. Up to 6304 conditions per place. [2022-12-13 17:09:30,167 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 58 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2022-12-13 17:09:30,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 653 flow [2022-12-13 17:09:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:09:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:09:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2022-12-13 17:09:30,169 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5234270414993306 [2022-12-13 17:09:30,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2022-12-13 17:09:30,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2022-12-13 17:09:30,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:30,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2022-12-13 17:09:30,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:30,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:30,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:30,171 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 341 flow. Second operand 3 states and 391 transitions. [2022-12-13 17:09:30,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 653 flow [2022-12-13 17:09:30,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 592 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-13 17:09:30,207 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 339 flow [2022-12-13 17:09:30,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2022-12-13 17:09:30,208 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2022-12-13 17:09:30,208 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 339 flow [2022-12-13 17:09:30,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:30,208 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:30,208 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:30,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:09:30,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash 602693826, now seen corresponding path program 1 times [2022-12-13 17:09:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:30,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58392387] [2022-12-13 17:09:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:30,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:30,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58392387] [2022-12-13 17:09:30,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58392387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:30,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:30,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:09:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412116715] [2022-12-13 17:09:30,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:30,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:09:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:30,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:09:30,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:09:30,358 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-12-13 17:09:30,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:30,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:30,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-12-13 17:09:30,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:31,128 INFO L130 PetriNetUnfolder]: 2703/4113 cut-off events. [2022-12-13 17:09:31,128 INFO L131 PetriNetUnfolder]: For 10707/11381 co-relation queries the response was YES. [2022-12-13 17:09:31,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15984 conditions, 4113 events. 2703/4113 cut-off events. For 10707/11381 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 21305 event pairs, 494 based on Foata normal form. 378/4350 useless extension candidates. Maximal degree in co-relation 15963. Up to 1704 conditions per place. [2022-12-13 17:09:31,144 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 77 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2022-12-13 17:09:31,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 805 flow [2022-12-13 17:09:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:09:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:09:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2022-12-13 17:09:31,145 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5251004016064257 [2022-12-13 17:09:31,146 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2022-12-13 17:09:31,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2022-12-13 17:09:31,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:31,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2022-12-13 17:09:31,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,148 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,148 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 339 flow. Second operand 4 states and 523 transitions. [2022-12-13 17:09:31,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 805 flow [2022-12-13 17:09:31,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 800 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:09:31,152 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 386 flow [2022-12-13 17:09:31,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2022-12-13 17:09:31,153 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2022-12-13 17:09:31,153 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 386 flow [2022-12-13 17:09:31,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,153 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:31,153 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:31,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:09:31,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash -543262322, now seen corresponding path program 1 times [2022-12-13 17:09:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:31,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193079930] [2022-12-13 17:09:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:31,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:31,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193079930] [2022-12-13 17:09:31,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193079930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:31,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:31,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:09:31,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375958665] [2022-12-13 17:09:31,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:31,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:09:31,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:31,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:09:31,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:09:31,299 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-12-13 17:09:31,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:31,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-12-13 17:09:31,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:31,725 INFO L130 PetriNetUnfolder]: 1965/2974 cut-off events. [2022-12-13 17:09:31,725 INFO L131 PetriNetUnfolder]: For 9014/9576 co-relation queries the response was YES. [2022-12-13 17:09:31,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12287 conditions, 2974 events. 1965/2974 cut-off events. For 9014/9576 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15042 event pairs, 353 based on Foata normal form. 214/3061 useless extension candidates. Maximal degree in co-relation 12264. Up to 1274 conditions per place. [2022-12-13 17:09:31,737 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 89 selfloop transitions, 13 changer transitions 0/114 dead transitions. [2022-12-13 17:09:31,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 958 flow [2022-12-13 17:09:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:09:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:09:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-12-13 17:09:31,738 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5244979919678715 [2022-12-13 17:09:31,738 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2022-12-13 17:09:31,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2022-12-13 17:09:31,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:31,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2022-12-13 17:09:31,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,741 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 386 flow. Second operand 5 states and 653 transitions. [2022-12-13 17:09:31,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 958 flow [2022-12-13 17:09:31,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 940 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 17:09:31,762 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 436 flow [2022-12-13 17:09:31,762 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=436, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-12-13 17:09:31,762 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-12-13 17:09:31,762 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 436 flow [2022-12-13 17:09:31,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:31,763 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] [2022-12-13 17:09:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:09:31,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1121333461, now seen corresponding path program 1 times [2022-12-13 17:09:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:31,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163664336] [2022-12-13 17:09:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:31,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:31,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163664336] [2022-12-13 17:09:31,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163664336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:31,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:31,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:09:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218812136] [2022-12-13 17:09:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:31,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:09:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:09:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:09:31,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-12-13 17:09:31,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 436 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:31,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:31,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-12-13 17:09:31,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:32,602 INFO L130 PetriNetUnfolder]: 2957/4577 cut-off events. [2022-12-13 17:09:32,602 INFO L131 PetriNetUnfolder]: For 12942/13313 co-relation queries the response was YES. [2022-12-13 17:09:32,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19531 conditions, 4577 events. 2957/4577 cut-off events. For 12942/13313 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24896 event pairs, 355 based on Foata normal form. 132/4613 useless extension candidates. Maximal degree in co-relation 19507. Up to 2152 conditions per place. [2022-12-13 17:09:32,625 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 81 selfloop transitions, 2 changer transitions 44/137 dead transitions. [2022-12-13 17:09:32,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 137 transitions, 1240 flow [2022-12-13 17:09:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:09:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:09:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2022-12-13 17:09:32,628 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5204819277108433 [2022-12-13 17:09:32,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2022-12-13 17:09:32,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2022-12-13 17:09:32,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:32,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2022-12-13 17:09:32,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:32,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:32,632 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:32,632 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 436 flow. Second operand 5 states and 648 transitions. [2022-12-13 17:09:32,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 137 transitions, 1240 flow [2022-12-13 17:09:32,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 137 transitions, 1150 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-13 17:09:32,684 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 423 flow [2022-12-13 17:09:32,684 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2022-12-13 17:09:32,684 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2022-12-13 17:09:32,684 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 423 flow [2022-12-13 17:09:32,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:32,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:32,685 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] [2022-12-13 17:09:32,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:09:32,685 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1271995844, now seen corresponding path program 1 times [2022-12-13 17:09:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:32,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790406309] [2022-12-13 17:09:32,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:32,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:32,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:32,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790406309] [2022-12-13 17:09:32,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790406309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:32,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:32,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:09:32,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421777905] [2022-12-13 17:09:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:32,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:09:32,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:32,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:09:32,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:09:32,856 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-12-13 17:09:32,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 423 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:32,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:32,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-12-13 17:09:32,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:33,563 INFO L130 PetriNetUnfolder]: 3843/5968 cut-off events. [2022-12-13 17:09:33,563 INFO L131 PetriNetUnfolder]: For 17989/18669 co-relation queries the response was YES. [2022-12-13 17:09:33,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25984 conditions, 5968 events. 3843/5968 cut-off events. For 17989/18669 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 34366 event pairs, 719 based on Foata normal form. 163/5946 useless extension candidates. Maximal degree in co-relation 25958. Up to 3265 conditions per place. [2022-12-13 17:09:33,581 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 80 selfloop transitions, 2 changer transitions 46/139 dead transitions. [2022-12-13 17:09:33,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 139 transitions, 1198 flow [2022-12-13 17:09:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:09:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:09:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2022-12-13 17:09:33,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.521285140562249 [2022-12-13 17:09:33,583 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2022-12-13 17:09:33,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2022-12-13 17:09:33,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:33,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2022-12-13 17:09:33,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:33,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:33,585 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:33,586 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 423 flow. Second operand 5 states and 649 transitions. [2022-12-13 17:09:33,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 139 transitions, 1198 flow [2022-12-13 17:09:33,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 139 transitions, 1188 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 17:09:33,657 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 441 flow [2022-12-13 17:09:33,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2022-12-13 17:09:33,658 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2022-12-13 17:09:33,658 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 441 flow [2022-12-13 17:09:33,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:33,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:33,659 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] [2022-12-13 17:09:33,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:09:33,659 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1341852695, now seen corresponding path program 2 times [2022-12-13 17:09:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:33,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274178254] [2022-12-13 17:09:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274178254] [2022-12-13 17:09:33,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274178254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:33,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:09:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42032794] [2022-12-13 17:09:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:09:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:09:33,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:09:33,818 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-12-13 17:09:33,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:33,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:33,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-12-13 17:09:33,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:34,429 INFO L130 PetriNetUnfolder]: 3486/5243 cut-off events. [2022-12-13 17:09:34,429 INFO L131 PetriNetUnfolder]: For 19616/20793 co-relation queries the response was YES. [2022-12-13 17:09:34,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23263 conditions, 5243 events. 3486/5243 cut-off events. For 19616/20793 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 30037 event pairs, 555 based on Foata normal form. 245/5260 useless extension candidates. Maximal degree in co-relation 23240. Up to 2373 conditions per place. [2022-12-13 17:09:34,443 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 69 selfloop transitions, 17 changer transitions 20/116 dead transitions. [2022-12-13 17:09:34,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 116 transitions, 1004 flow [2022-12-13 17:09:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:09:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 17:09:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2022-12-13 17:09:34,445 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5147255689424364 [2022-12-13 17:09:34,445 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2022-12-13 17:09:34,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2022-12-13 17:09:34,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:34,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2022-12-13 17:09:34,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:34,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:34,448 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:34,448 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 441 flow. Second operand 6 states and 769 transitions. [2022-12-13 17:09:34,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 116 transitions, 1004 flow [2022-12-13 17:09:34,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 116 transitions, 968 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 17:09:34,546 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 406 flow [2022-12-13 17:09:34,546 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2022-12-13 17:09:34,546 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2022-12-13 17:09:34,547 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 406 flow [2022-12-13 17:09:34,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:34,547 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:34,547 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] [2022-12-13 17:09:34,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:09:34,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:34,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2102741997, now seen corresponding path program 1 times [2022-12-13 17:09:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:34,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413004001] [2022-12-13 17:09:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:34,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413004001] [2022-12-13 17:09:34,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413004001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:34,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:34,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:09:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389439126] [2022-12-13 17:09:34,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:34,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:09:34,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:09:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:09:34,686 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-12-13 17:09:34,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:34,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:34,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-12-13 17:09:34,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:35,105 INFO L130 PetriNetUnfolder]: 2253/3549 cut-off events. [2022-12-13 17:09:35,105 INFO L131 PetriNetUnfolder]: For 12190/12390 co-relation queries the response was YES. [2022-12-13 17:09:35,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15847 conditions, 3549 events. 2253/3549 cut-off events. For 12190/12390 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19178 event pairs, 643 based on Foata normal form. 113/3638 useless extension candidates. Maximal degree in co-relation 15819. Up to 1401 conditions per place. [2022-12-13 17:09:35,113 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 51 selfloop transitions, 1 changer transitions 58/114 dead transitions. [2022-12-13 17:09:35,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 114 transitions, 1047 flow [2022-12-13 17:09:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:09:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:09:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2022-12-13 17:09:35,114 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5052208835341365 [2022-12-13 17:09:35,115 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2022-12-13 17:09:35,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2022-12-13 17:09:35,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:35,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2022-12-13 17:09:35,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:35,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:35,117 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:35,117 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 406 flow. Second operand 5 states and 629 transitions. [2022-12-13 17:09:35,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 114 transitions, 1047 flow [2022-12-13 17:09:35,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 114 transitions, 851 flow, removed 55 selfloop flow, removed 9 redundant places. [2022-12-13 17:09:35,163 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 262 flow [2022-12-13 17:09:35,163 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2022-12-13 17:09:35,163 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2022-12-13 17:09:35,163 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 262 flow [2022-12-13 17:09:35,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:35,164 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:35,164 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] [2022-12-13 17:09:35,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:09:35,164 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1030244361, now seen corresponding path program 2 times [2022-12-13 17:09:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:35,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956506941] [2022-12-13 17:09:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:36,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:36,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956506941] [2022-12-13 17:09:36,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956506941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:36,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:36,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:09:36,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454416567] [2022-12-13 17:09:36,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:36,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:09:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:09:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:09:36,230 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 249 [2022-12-13 17:09:36,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 262 flow. Second operand has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:36,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:36,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 249 [2022-12-13 17:09:36,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:36,747 INFO L130 PetriNetUnfolder]: 1568/2469 cut-off events. [2022-12-13 17:09:36,747 INFO L131 PetriNetUnfolder]: For 4239/4239 co-relation queries the response was YES. [2022-12-13 17:09:36,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9426 conditions, 2469 events. 1568/2469 cut-off events. For 4239/4239 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11775 event pairs, 325 based on Foata normal form. 1/2470 useless extension candidates. Maximal degree in co-relation 9407. Up to 1472 conditions per place. [2022-12-13 17:09:36,753 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 63 selfloop transitions, 9 changer transitions 20/92 dead transitions. [2022-12-13 17:09:36,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 653 flow [2022-12-13 17:09:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:09:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:09:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2022-12-13 17:09:36,755 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46471600688468157 [2022-12-13 17:09:36,755 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2022-12-13 17:09:36,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2022-12-13 17:09:36,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:36,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2022-12-13 17:09:36,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:36,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:36,758 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:36,758 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 262 flow. Second operand 7 states and 810 transitions. [2022-12-13 17:09:36,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 653 flow [2022-12-13 17:09:36,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 623 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-13 17:09:36,777 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 285 flow [2022-12-13 17:09:36,777 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2022-12-13 17:09:36,777 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2022-12-13 17:09:36,778 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 285 flow [2022-12-13 17:09:36,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:36,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:36,778 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] [2022-12-13 17:09:36,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:09:36,778 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:36,778 INFO L85 PathProgramCache]: Analyzing trace with hash -65208609, now seen corresponding path program 3 times [2022-12-13 17:09:36,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:36,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642860083] [2022-12-13 17:09:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:09:38,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:38,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642860083] [2022-12-13 17:09:38,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642860083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:38,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:09:38,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 17:09:38,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668386666] [2022-12-13 17:09:38,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:38,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:09:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:38,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:09:38,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:09:38,348 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-12-13 17:09:38,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 285 flow. Second operand has 11 states, 11 states have (on average 118.27272727272727) internal successors, (1301), 11 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:38,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:09:38,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-12-13 17:09:38,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:09:38,881 INFO L130 PetriNetUnfolder]: 1578/2532 cut-off events. [2022-12-13 17:09:38,881 INFO L131 PetriNetUnfolder]: For 4907/4979 co-relation queries the response was YES. [2022-12-13 17:09:38,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9940 conditions, 2532 events. 1578/2532 cut-off events. For 4907/4979 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12633 event pairs, 380 based on Foata normal form. 38/2532 useless extension candidates. Maximal degree in co-relation 9923. Up to 1366 conditions per place. [2022-12-13 17:09:38,887 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 57 selfloop transitions, 5 changer transitions 22/87 dead transitions. [2022-12-13 17:09:38,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 633 flow [2022-12-13 17:09:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:09:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 17:09:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions. [2022-12-13 17:09:38,889 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 17:09:38,889 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions. [2022-12-13 17:09:38,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions. [2022-12-13 17:09:38,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:09:38,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions. [2022-12-13 17:09:38,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:38,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:38,892 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:38,892 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 285 flow. Second operand 6 states and 747 transitions. [2022-12-13 17:09:38,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 633 flow [2022-12-13 17:09:38,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 618 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 17:09:38,915 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 290 flow [2022-12-13 17:09:38,915 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2022-12-13 17:09:38,916 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2022-12-13 17:09:38,916 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 290 flow [2022-12-13 17:09:38,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 118.27272727272727) internal successors, (1301), 11 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:09:38,916 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:09:38,917 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] [2022-12-13 17:09:38,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:09:38,917 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:09:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:38,917 INFO L85 PathProgramCache]: Analyzing trace with hash 509989585, now seen corresponding path program 4 times [2022-12-13 17:09:38,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:38,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292771021] [2022-12-13 17:09:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:38,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:09:38,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:09:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:09:39,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:09:39,003 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:09:39,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 17:09:39,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 17:09:39,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 17:09:39,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 17:09:39,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 17:09:39,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 17:09:39,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 17:09:39,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:09:39,006 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:39,010 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 17:09:39,010 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:09:39,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:09:39 BasicIcfg [2022-12-13 17:09:39,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:09:39,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:09:39,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:09:39,057 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:09:39,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:09:18" (3/4) ... [2022-12-13 17:09:39,059 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:09:39,112 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:09:39,112 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:09:39,112 INFO L158 Benchmark]: Toolchain (without parser) took 21641.68ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 147.2MB in the beginning and 445.4MB in the end (delta: -298.2MB). Peak memory consumption was 632.5MB. Max. memory is 16.1GB. [2022-12-13 17:09:39,113 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:09:39,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.04ms. Allocated memory is still 184.5MB. Free memory was 147.2MB in the beginning and 119.4MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 17:09:39,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.35ms. Allocated memory is still 184.5MB. Free memory was 119.4MB in the beginning and 116.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:09:39,113 INFO L158 Benchmark]: Boogie Preprocessor took 21.86ms. Allocated memory is still 184.5MB. Free memory was 116.6MB in the beginning and 114.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:09:39,113 INFO L158 Benchmark]: RCFGBuilder took 556.85ms. Allocated memory is still 184.5MB. Free memory was 114.5MB in the beginning and 143.7MB in the end (delta: -29.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2022-12-13 17:09:39,113 INFO L158 Benchmark]: TraceAbstraction took 20588.83ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 142.8MB in the beginning and 460.0MB in the end (delta: -317.3MB). Peak memory consumption was 612.6MB. Max. memory is 16.1GB. [2022-12-13 17:09:39,114 INFO L158 Benchmark]: Witness Printer took 55.16ms. Allocated memory is still 1.1GB. Free memory was 460.0MB in the beginning and 445.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 17:09:39,115 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.04ms. Allocated memory is still 184.5MB. Free memory was 147.2MB in the beginning and 119.4MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.35ms. Allocated memory is still 184.5MB. Free memory was 119.4MB in the beginning and 116.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.86ms. Allocated memory is still 184.5MB. Free memory was 116.6MB in the beginning and 114.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 556.85ms. Allocated memory is still 184.5MB. Free memory was 114.5MB in the beginning and 143.7MB in the end (delta: -29.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20588.83ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 142.8MB in the beginning and 460.0MB in the end (delta: -317.3MB). Peak memory consumption was 612.6MB. Max. memory is 16.1GB. * Witness Printer took 55.16ms. Allocated memory is still 1.1GB. Free memory was 460.0MB in the beginning and 445.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 143 PlacesBefore, 44 PlacesAfterwards, 132 TransitionsBefore, 32 TransitionsAfterwards, 3276 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 9207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3836, independent: 3601, independent conditional: 0, independent unconditional: 3601, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1707, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3836, independent: 1933, independent conditional: 0, independent unconditional: 1933, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1707, unknown conditional: 0, unknown unconditional: 1707] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-4, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-3, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=-2, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 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: 20.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 930 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 777 mSDsluCounter, 608 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 546 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2200 IncrementalHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 62 mSDtfsCounter, 2200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=9, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 2442 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-12-13 17:09:39,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ebb5e10-1e69-4ad1-8573-8b79000ef277/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE