./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/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_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/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_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- 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 21:53:21,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:53:21,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:53:21,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:53:21,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:53:21,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:53:21,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:53:21,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:53:21,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:53:21,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:53:21,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:53:21,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:53:21,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:53:21,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:53:21,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:53:21,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:53:21,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:53:21,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:53:21,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:53:21,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:53:21,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:53:21,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:53:21,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:53:22,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:53:22,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:53:22,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:53:22,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:53:22,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:53:22,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:53:22,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:53:22,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:53:22,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:53:22,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:53:22,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:53:22,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:53:22,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:53:22,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:53:22,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:53:22,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:53:22,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:53:22,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:53:22,015 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:53:22,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:53:22,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:53:22,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:53:22,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:53:22,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:53:22,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:53:22,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:53:22,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:53:22,035 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:53:22,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:53:22,036 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:53:22,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:53:22,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:53:22,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:53:22,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:53:22,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:53:22,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:53:22,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:53:22,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:53:22,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:53:22,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:53:22,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:53:22,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:53:22,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:53:22,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:53:22,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:53:22,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:53:22,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:53:22,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:53:22,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:53:22,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:53:22,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:53:22,039 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:53:22,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:53:22,039 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:53:22,039 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_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/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_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2022-12-13 21:53:22,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:53:22,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:53:22,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:53:22,220 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:53:22,221 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:53:22,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 21:53:24,835 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:53:25,004 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:53:25,004 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 21:53:25,014 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/data/c7e4a0051/5fe3b5667f474809bebaac62b232a25c/FLAG330fb1fa0 [2022-12-13 21:53:25,024 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/data/c7e4a0051/5fe3b5667f474809bebaac62b232a25c [2022-12-13 21:53:25,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:53:25,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:53:25,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:53:25,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:53:25,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:53:25,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25af71f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25, skipping insertion in model container [2022-12-13 21:53:25,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:53:25,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:53:25,229 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_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 21:53:25,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:53:25,454 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:53:25,467 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_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 21:53:25,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:25,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:25,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:53:25,546 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:53:25,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25 WrapperNode [2022-12-13 21:53:25,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:53:25,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:53:25,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:53:25,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:53:25,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,584 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 21:53:25,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:53:25,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:53:25,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:53:25,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:53:25,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,604 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:53:25,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:53:25,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:53:25,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:53:25,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (1/1) ... [2022-12-13 21:53:25,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:53:25,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:53:25,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:53:25,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:53:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:53:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:53:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:53:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:53:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:53:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:53:25,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:53:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:53:25,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:53:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:53:25,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:53:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:53:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:53:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:53:25,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:53:25,668 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 21:53:25,765 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:53:25,767 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:53:26,086 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:53:26,232 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:53:26,233 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:53:26,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:26 BoogieIcfgContainer [2022-12-13 21:53:26,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:53:26,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:53:26,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:53:26,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:53:26,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:53:25" (1/3) ... [2022-12-13 21:53:26,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e954e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:53:26, skipping insertion in model container [2022-12-13 21:53:26,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:25" (2/3) ... [2022-12-13 21:53:26,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e954e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:53:26, skipping insertion in model container [2022-12-13 21:53:26,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:26" (3/3) ... [2022-12-13 21:53:26,243 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 21:53:26,252 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 21:53:26,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:53:26,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 21:53:26,262 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:53:26,310 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:53:26,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-12-13 21:53:26,393 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-12-13 21:53:26,393 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:26,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 21:53:26,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-12-13 21:53:26,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-12-13 21:53:26,404 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:53:26,411 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2022-12-13 21:53:26,413 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2022-12-13 21:53:26,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2022-12-13 21:53:26,438 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-12-13 21:53:26,438 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:26,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 21:53:26,441 INFO L119 LiptonReduction]: Number of co-enabled transitions 2206 [2022-12-13 21:53:29,989 INFO L134 LiptonReduction]: Checked pairs total: 5687 [2022-12-13 21:53:29,989 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-12-13 21:53:29,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:53:30,003 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;@12247c94, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:53:30,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 21:53:30,006 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 21:53:30,006 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:30,006 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:30,007 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:53:30,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:30,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:30,010 INFO L85 PathProgramCache]: Analyzing trace with hash 539910589, now seen corresponding path program 1 times [2022-12-13 21:53:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115247674] [2022-12-13 21:53:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:30,280 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 21:53:30,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:30,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115247674] [2022-12-13 21:53:30,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115247674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:30,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:30,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:53:30,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733319329] [2022-12-13 21:53:30,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:30,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:53:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:53:30,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:53:30,312 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 218 [2022-12-13 21:53:30,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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 21:53:30,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:30,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 218 [2022-12-13 21:53:30,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:30,701 INFO L130 PetriNetUnfolder]: 1397/2220 cut-off events. [2022-12-13 21:53:30,701 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 21:53:30,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 2220 events. 1397/2220 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11386 event pairs, 236 based on Foata normal form. 0/2100 useless extension candidates. Maximal degree in co-relation 4334. Up to 1648 conditions per place. [2022-12-13 21:53:30,712 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 33 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-12-13 21:53:30,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 162 flow [2022-12-13 21:53:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2022-12-13 21:53:30,726 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5122324159021406 [2022-12-13 21:53:30,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2022-12-13 21:53:30,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2022-12-13 21:53:30,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:30,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2022-12-13 21:53:30,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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 21:53:30,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 21:53:30,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 21:53:30,743 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 57 flow. Second operand 3 states and 335 transitions. [2022-12-13 21:53:30,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 162 flow [2022-12-13 21:53:30,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:53:30,747 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-12-13 21:53:30,749 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-13 21:53:30,752 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 21:53:30,752 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-12-13 21:53:30,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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 21:53:30,753 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:30,753 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:30,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:53:30,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1116740617, now seen corresponding path program 1 times [2022-12-13 21:53:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:30,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858587146] [2022-12-13 21:53:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:31,381 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 21:53:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:31,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858587146] [2022-12-13 21:53:31,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858587146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:31,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:31,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:53:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96634465] [2022-12-13 21:53:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:31,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:53:31,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:53:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:53:31,430 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2022-12-13 21:53:31,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 21:53:31,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:31,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2022-12-13 21:53:31,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:31,684 INFO L130 PetriNetUnfolder]: 958/1445 cut-off events. [2022-12-13 21:53:31,684 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-13 21:53:31,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 1445 events. 958/1445 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6382 event pairs, 418 based on Foata normal form. 60/1502 useless extension candidates. Maximal degree in co-relation 3057. Up to 851 conditions per place. [2022-12-13 21:53:31,689 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-13 21:53:31,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 154 flow [2022-12-13 21:53:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2022-12-13 21:53:31,692 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47553516819571867 [2022-12-13 21:53:31,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2022-12-13 21:53:31,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2022-12-13 21:53:31,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:31,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2022-12-13 21:53:31,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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 21:53:31,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 21:53:31,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 21:53:31,694 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 311 transitions. [2022-12-13 21:53:31,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 154 flow [2022-12-13 21:53:31,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:31,695 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-12-13 21:53:31,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-13 21:53:31,696 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 21:53:31,696 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-12-13 21:53:31,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 21:53:31,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:31,697 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:31,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:53:31,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:31,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash 942276524, now seen corresponding path program 1 times [2022-12-13 21:53:31,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:31,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699255568] [2022-12-13 21:53:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:32,239 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 21:53:32,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:32,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699255568] [2022-12-13 21:53:32,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699255568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:32,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:32,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:53:32,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583978744] [2022-12-13 21:53:32,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:32,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:53:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:32,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:53:32,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:53:32,275 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2022-12-13 21:53:32,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 21:53:32,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:32,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2022-12-13 21:53:32,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:32,508 INFO L130 PetriNetUnfolder]: 929/1401 cut-off events. [2022-12-13 21:53:32,508 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-13 21:53:32,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1401 events. 929/1401 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5971 event pairs, 213 based on Foata normal form. 12/1409 useless extension candidates. Maximal degree in co-relation 3043. Up to 1089 conditions per place. [2022-12-13 21:53:32,514 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 29 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-13 21:53:32,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 143 flow [2022-12-13 21:53:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-12-13 21:53:32,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4709480122324159 [2022-12-13 21:53:32,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2022-12-13 21:53:32,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2022-12-13 21:53:32,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:32,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2022-12-13 21:53:32,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 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 21:53:32,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 21:53:32,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 21:53:32,520 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 308 transitions. [2022-12-13 21:53:32,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 143 flow [2022-12-13 21:53:32,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:32,521 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2022-12-13 21:53:32,521 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-13 21:53:32,521 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2022-12-13 21:53:32,521 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow [2022-12-13 21:53:32,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 21:53:32,522 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:32,522 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:32,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:53:32,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:32,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1529485251, now seen corresponding path program 1 times [2022-12-13 21:53:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:32,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544372477] [2022-12-13 21:53:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:33,043 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 21:53:33,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:33,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544372477] [2022-12-13 21:53:33,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544372477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:33,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:33,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:53:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538167036] [2022-12-13 21:53:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:33,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:53:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:53:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:53:33,091 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 218 [2022-12-13 21:53:33,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 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 21:53:33,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:33,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 218 [2022-12-13 21:53:33,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:33,516 INFO L130 PetriNetUnfolder]: 1310/1943 cut-off events. [2022-12-13 21:53:33,516 INFO L131 PetriNetUnfolder]: For 259/259 co-relation queries the response was YES. [2022-12-13 21:53:33,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 1943 events. 1310/1943 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8483 event pairs, 186 based on Foata normal form. 9/1952 useless extension candidates. Maximal degree in co-relation 4350. Up to 1168 conditions per place. [2022-12-13 21:53:33,523 INFO L137 encePairwiseOnDemand]: 207/218 looper letters, 44 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2022-12-13 21:53:33,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 277 flow [2022-12-13 21:53:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:53:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:53:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-12-13 21:53:33,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46972477064220186 [2022-12-13 21:53:33,530 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2022-12-13 21:53:33,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2022-12-13 21:53:33,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:33,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2022-12-13 21:53:33,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 21:53:33,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 21:53:33,536 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 21:53:33,537 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 5 states and 512 transitions. [2022-12-13 21:53:33,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 277 flow [2022-12-13 21:53:33,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:33,538 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 175 flow [2022-12-13 21:53:33,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2022-12-13 21:53:33,539 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-13 21:53:33,539 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 175 flow [2022-12-13 21:53:33,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 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 21:53:33,539 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:33,539 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:33,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:53:33,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1412770419, now seen corresponding path program 2 times [2022-12-13 21:53:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:33,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856142309] [2022-12-13 21:53:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:33,701 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 21:53:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:33,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856142309] [2022-12-13 21:53:33,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856142309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:33,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:33,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:53:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488554679] [2022-12-13 21:53:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:33,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:53:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:53:33,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:53:33,708 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-12-13 21:53:33,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 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 21:53:33,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:33,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-12-13 21:53:33,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:34,061 INFO L130 PetriNetUnfolder]: 1666/2491 cut-off events. [2022-12-13 21:53:34,061 INFO L131 PetriNetUnfolder]: For 2475/2475 co-relation queries the response was YES. [2022-12-13 21:53:34,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 2491 events. 1666/2491 cut-off events. For 2475/2475 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11344 event pairs, 293 based on Foata normal form. 60/2551 useless extension candidates. Maximal degree in co-relation 7836. Up to 1020 conditions per place. [2022-12-13 21:53:34,067 INFO L137 encePairwiseOnDemand]: 214/218 looper letters, 40 selfloop transitions, 3 changer transitions 18/61 dead transitions. [2022-12-13 21:53:34,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 396 flow [2022-12-13 21:53:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:53:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:53:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2022-12-13 21:53:34,070 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49655963302752293 [2022-12-13 21:53:34,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2022-12-13 21:53:34,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2022-12-13 21:53:34,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:34,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2022-12-13 21:53:34,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 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 21:53:34,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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 21:53:34,074 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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 21:53:34,074 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 175 flow. Second operand 4 states and 433 transitions. [2022-12-13 21:53:34,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 61 transitions, 396 flow [2022-12-13 21:53:34,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:53:34,078 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 124 flow [2022-12-13 21:53:34,078 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2022-12-13 21:53:34,078 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-13 21:53:34,079 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 124 flow [2022-12-13 21:53:34,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 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 21:53:34,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:34,079 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:34,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:53:34,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1794380343, now seen corresponding path program 1 times [2022-12-13 21:53:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:34,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814570720] [2022-12-13 21:53:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:34,901 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 21:53:34,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:34,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814570720] [2022-12-13 21:53:34,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814570720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:34,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:34,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:53:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450697330] [2022-12-13 21:53:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:34,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:53:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:53:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:53:34,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-12-13 21:53:34,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 124 flow. Second operand has 8 states, 8 states have (on average 96.75) internal successors, (774), 8 states have internal predecessors, (774), 0 states have call successors, (0), 0 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 21:53:34,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:34,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-12-13 21:53:34,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:35,216 INFO L130 PetriNetUnfolder]: 792/1233 cut-off events. [2022-12-13 21:53:35,216 INFO L131 PetriNetUnfolder]: For 1550/1550 co-relation queries the response was YES. [2022-12-13 21:53:35,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4088 conditions, 1233 events. 792/1233 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5110 event pairs, 100 based on Foata normal form. 3/1236 useless extension candidates. Maximal degree in co-relation 4070. Up to 1037 conditions per place. [2022-12-13 21:53:35,221 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 42 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2022-12-13 21:53:35,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 352 flow [2022-12-13 21:53:35,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:53:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:53:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-12-13 21:53:35,223 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.481651376146789 [2022-12-13 21:53:35,223 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-12-13 21:53:35,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-12-13 21:53:35,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:35,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-12-13 21:53:35,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 21:53:35,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 21:53:35,227 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 21:53:35,227 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 124 flow. Second operand 5 states and 525 transitions. [2022-12-13 21:53:35,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 352 flow [2022-12-13 21:53:35,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 322 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 21:53:35,231 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 190 flow [2022-12-13 21:53:35,231 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-13 21:53:35,232 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-13 21:53:35,232 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 190 flow [2022-12-13 21:53:35,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.75) internal successors, (774), 8 states have internal predecessors, (774), 0 states have call successors, (0), 0 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 21:53:35,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:35,232 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:35,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:53:35,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -434946359, now seen corresponding path program 2 times [2022-12-13 21:53:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:35,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973103990] [2022-12-13 21:53:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:35,745 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 21:53:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:35,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973103990] [2022-12-13 21:53:35,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973103990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:35,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:35,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:53:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599146234] [2022-12-13 21:53:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:35,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:53:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:53:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:53:35,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-12-13 21:53:35,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 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 21:53:35,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:35,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-12-13 21:53:35,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:36,067 INFO L130 PetriNetUnfolder]: 961/1491 cut-off events. [2022-12-13 21:53:36,067 INFO L131 PetriNetUnfolder]: For 2291/2291 co-relation queries the response was YES. [2022-12-13 21:53:36,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5301 conditions, 1491 events. 961/1491 cut-off events. For 2291/2291 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6390 event pairs, 169 based on Foata normal form. 12/1503 useless extension candidates. Maximal degree in co-relation 5284. Up to 1119 conditions per place. [2022-12-13 21:53:36,073 INFO L137 encePairwiseOnDemand]: 208/218 looper letters, 42 selfloop transitions, 19 changer transitions 0/62 dead transitions. [2022-12-13 21:53:36,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 448 flow [2022-12-13 21:53:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:53:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:53:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 627 transitions. [2022-12-13 21:53:36,075 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4793577981651376 [2022-12-13 21:53:36,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 627 transitions. [2022-12-13 21:53:36,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 627 transitions. [2022-12-13 21:53:36,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:36,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 627 transitions. [2022-12-13 21:53:36,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 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 21:53:36,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 21:53:36,077 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 21:53:36,077 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 190 flow. Second operand 6 states and 627 transitions. [2022-12-13 21:53:36,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 448 flow [2022-12-13 21:53:36,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:53:36,079 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 343 flow [2022-12-13 21:53:36,079 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-13 21:53:36,080 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-13 21:53:36,080 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 343 flow [2022-12-13 21:53:36,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 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 21:53:36,080 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:36,080 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:36,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:53:36,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1843598625, now seen corresponding path program 1 times [2022-12-13 21:53:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:36,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178690719] [2022-12-13 21:53:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:36,748 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 21:53:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:36,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178690719] [2022-12-13 21:53:36,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178690719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:36,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:36,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:53:36,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607439723] [2022-12-13 21:53:36,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:36,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:53:36,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:53:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:53:36,780 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2022-12-13 21:53:36,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 343 flow. Second operand has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:36,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:36,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2022-12-13 21:53:36,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:37,159 INFO L130 PetriNetUnfolder]: 994/1538 cut-off events. [2022-12-13 21:53:37,159 INFO L131 PetriNetUnfolder]: For 4514/4514 co-relation queries the response was YES. [2022-12-13 21:53:37,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6415 conditions, 1538 events. 994/1538 cut-off events. For 4514/4514 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6674 event pairs, 223 based on Foata normal form. 2/1540 useless extension candidates. Maximal degree in co-relation 6395. Up to 1341 conditions per place. [2022-12-13 21:53:37,165 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 57 selfloop transitions, 21 changer transitions 0/79 dead transitions. [2022-12-13 21:53:37,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 682 flow [2022-12-13 21:53:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:53:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:53:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2022-12-13 21:53:37,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47477064220183485 [2022-12-13 21:53:37,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 621 transitions. [2022-12-13 21:53:37,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 621 transitions. [2022-12-13 21:53:37,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:37,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 621 transitions. [2022-12-13 21:53:37,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 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 21:53:37,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 21:53:37,172 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 21:53:37,172 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 343 flow. Second operand 6 states and 621 transitions. [2022-12-13 21:53:37,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 682 flow [2022-12-13 21:53:37,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 675 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 21:53:37,177 INFO L231 Difference]: Finished difference. Result has 53 places, 56 transitions, 520 flow [2022-12-13 21:53:37,177 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=53, PETRI_TRANSITIONS=56} [2022-12-13 21:53:37,177 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-12-13 21:53:37,177 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 520 flow [2022-12-13 21:53:37,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:37,178 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:37,178 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:37,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:53:37,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash 961757547, now seen corresponding path program 1 times [2022-12-13 21:53:37,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:37,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560047273] [2022-12-13 21:53:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:37,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:37,320 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 21:53:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:37,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560047273] [2022-12-13 21:53:37,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560047273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:37,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:37,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:53:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323836325] [2022-12-13 21:53:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:37,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:53:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:53:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:53:37,332 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-12-13 21:53:37,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 520 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 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 21:53:37,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:37,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-12-13 21:53:37,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:37,607 INFO L130 PetriNetUnfolder]: 823/1346 cut-off events. [2022-12-13 21:53:37,607 INFO L131 PetriNetUnfolder]: For 7178/7178 co-relation queries the response was YES. [2022-12-13 21:53:37,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6084 conditions, 1346 events. 823/1346 cut-off events. For 7178/7178 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6204 event pairs, 103 based on Foata normal form. 134/1479 useless extension candidates. Maximal degree in co-relation 6061. Up to 701 conditions per place. [2022-12-13 21:53:37,611 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 69 selfloop transitions, 4 changer transitions 61/135 dead transitions. [2022-12-13 21:53:37,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 135 transitions, 1523 flow [2022-12-13 21:53:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:53:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:53:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 539 transitions. [2022-12-13 21:53:37,613 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4944954128440367 [2022-12-13 21:53:37,613 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 539 transitions. [2022-12-13 21:53:37,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 539 transitions. [2022-12-13 21:53:37,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:37,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 539 transitions. [2022-12-13 21:53:37,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:37,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 21:53:37,616 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 21:53:37,616 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 520 flow. Second operand 5 states and 539 transitions. [2022-12-13 21:53:37,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 135 transitions, 1523 flow [2022-12-13 21:53:37,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 135 transitions, 1444 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 21:53:37,620 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 459 flow [2022-12-13 21:53:37,620 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-13 21:53:37,621 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-12-13 21:53:37,621 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 459 flow [2022-12-13 21:53:37,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 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 21:53:37,621 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:37,621 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:37,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:53:37,621 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1383733636, now seen corresponding path program 1 times [2022-12-13 21:53:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:37,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043790921] [2022-12-13 21:53:37,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:37,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:37,771 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 21:53:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:37,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043790921] [2022-12-13 21:53:37,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043790921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:37,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:37,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:53:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494093709] [2022-12-13 21:53:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:37,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:53:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:53:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:53:37,786 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-12-13 21:53:37,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 459 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 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 21:53:37,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:37,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-12-13 21:53:37,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:38,056 INFO L130 PetriNetUnfolder]: 438/770 cut-off events. [2022-12-13 21:53:38,056 INFO L131 PetriNetUnfolder]: For 4150/4150 co-relation queries the response was YES. [2022-12-13 21:53:38,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3757 conditions, 770 events. 438/770 cut-off events. For 4150/4150 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3258 event pairs, 65 based on Foata normal form. 69/838 useless extension candidates. Maximal degree in co-relation 3732. Up to 308 conditions per place. [2022-12-13 21:53:38,059 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 81 selfloop transitions, 7 changer transitions 35/124 dead transitions. [2022-12-13 21:53:38,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 124 transitions, 1329 flow [2022-12-13 21:53:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:53:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:53:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 646 transitions. [2022-12-13 21:53:38,061 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4938837920489297 [2022-12-13 21:53:38,061 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 646 transitions. [2022-12-13 21:53:38,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 646 transitions. [2022-12-13 21:53:38,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:38,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 646 transitions. [2022-12-13 21:53:38,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 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 21:53:38,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 21:53:38,064 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 21:53:38,064 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 459 flow. Second operand 6 states and 646 transitions. [2022-12-13 21:53:38,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 124 transitions, 1329 flow [2022-12-13 21:53:38,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 1269 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:38,069 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 471 flow [2022-12-13 21:53:38,069 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2022-12-13 21:53:38,069 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2022-12-13 21:53:38,069 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 471 flow [2022-12-13 21:53:38,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 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 21:53:38,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:38,070 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:38,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:53:38,070 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1109882971, now seen corresponding path program 1 times [2022-12-13 21:53:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:38,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467307513] [2022-12-13 21:53:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:38,219 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 21:53:38,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:38,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467307513] [2022-12-13 21:53:38,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467307513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:38,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:38,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:53:38,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423024349] [2022-12-13 21:53:38,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:38,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:53:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:38,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:53:38,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:53:38,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-12-13 21:53:38,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:38,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:38,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-12-13 21:53:38,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:38,446 INFO L130 PetriNetUnfolder]: 309/553 cut-off events. [2022-12-13 21:53:38,446 INFO L131 PetriNetUnfolder]: For 2678/2678 co-relation queries the response was YES. [2022-12-13 21:53:38,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2714 conditions, 553 events. 309/553 cut-off events. For 2678/2678 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2233 event pairs, 62 based on Foata normal form. 14/566 useless extension candidates. Maximal degree in co-relation 2686. Up to 257 conditions per place. [2022-12-13 21:53:38,450 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 78 selfloop transitions, 10 changer transitions 14/103 dead transitions. [2022-12-13 21:53:38,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 1090 flow [2022-12-13 21:53:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:53:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:53:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 729 transitions. [2022-12-13 21:53:38,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47771952817824376 [2022-12-13 21:53:38,452 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 729 transitions. [2022-12-13 21:53:38,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 729 transitions. [2022-12-13 21:53:38,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:38,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 729 transitions. [2022-12-13 21:53:38,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 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 21:53:38,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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 21:53:38,455 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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 21:53:38,455 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 471 flow. Second operand 7 states and 729 transitions. [2022-12-13 21:53:38,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 1090 flow [2022-12-13 21:53:38,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 972 flow, removed 49 selfloop flow, removed 6 redundant places. [2022-12-13 21:53:38,461 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 433 flow [2022-12-13 21:53:38,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2022-12-13 21:53:38,461 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2022-12-13 21:53:38,461 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 433 flow [2022-12-13 21:53:38,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:38,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:38,461 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] [2022-12-13 21:53:38,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:53:38,462 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:38,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash -539888285, now seen corresponding path program 1 times [2022-12-13 21:53:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:38,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469267175] [2022-12-13 21:53:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:39,403 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 21:53:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469267175] [2022-12-13 21:53:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469267175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:39,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:39,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:53:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011358394] [2022-12-13 21:53:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:39,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:53:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:53:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:53:39,484 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-12-13 21:53:39,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 433 flow. Second operand has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 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 21:53:39,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:39,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-12-13 21:53:39,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:39,875 INFO L130 PetriNetUnfolder]: 369/670 cut-off events. [2022-12-13 21:53:39,875 INFO L131 PetriNetUnfolder]: For 2392/2392 co-relation queries the response was YES. [2022-12-13 21:53:39,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 670 events. 369/670 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2937 event pairs, 22 based on Foata normal form. 1/671 useless extension candidates. Maximal degree in co-relation 3117. Up to 316 conditions per place. [2022-12-13 21:53:39,877 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 73 selfloop transitions, 23 changer transitions 13/110 dead transitions. [2022-12-13 21:53:39,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 1018 flow [2022-12-13 21:53:39,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:53:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:53:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 833 transitions. [2022-12-13 21:53:39,880 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4776376146788991 [2022-12-13 21:53:39,880 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 833 transitions. [2022-12-13 21:53:39,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 833 transitions. [2022-12-13 21:53:39,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:39,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 833 transitions. [2022-12-13 21:53:39,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.125) internal successors, (833), 8 states have internal predecessors, (833), 0 states have call successors, (0), 0 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 21:53:39,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 21:53:39,885 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 21:53:39,885 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 433 flow. Second operand 8 states and 833 transitions. [2022-12-13 21:53:39,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 1018 flow [2022-12-13 21:53:39,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 110 transitions, 922 flow, removed 30 selfloop flow, removed 6 redundant places. [2022-12-13 21:53:39,892 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 549 flow [2022-12-13 21:53:39,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=549, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2022-12-13 21:53:39,892 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2022-12-13 21:53:39,892 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 549 flow [2022-12-13 21:53:39,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 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 21:53:39,893 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:39,893 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] [2022-12-13 21:53:39,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:53:39,893 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash -481313821, now seen corresponding path program 2 times [2022-12-13 21:53:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:39,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984649302] [2022-12-13 21:53:39,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:39,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:40,647 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 21:53:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:40,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984649302] [2022-12-13 21:53:40,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984649302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:40,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:40,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:53:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556920472] [2022-12-13 21:53:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:40,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:53:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:53:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:53:40,683 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-12-13 21:53:40,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:40,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:40,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-12-13 21:53:40,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:40,945 INFO L130 PetriNetUnfolder]: 371/677 cut-off events. [2022-12-13 21:53:40,945 INFO L131 PetriNetUnfolder]: For 3199/3199 co-relation queries the response was YES. [2022-12-13 21:53:40,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 677 events. 371/677 cut-off events. For 3199/3199 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2996 event pairs, 37 based on Foata normal form. 1/678 useless extension candidates. Maximal degree in co-relation 3346. Up to 510 conditions per place. [2022-12-13 21:53:40,948 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 58 selfloop transitions, 23 changer transitions 9/91 dead transitions. [2022-12-13 21:53:40,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 910 flow [2022-12-13 21:53:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:53:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:53:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-12-13 21:53:40,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47782874617737003 [2022-12-13 21:53:40,949 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 625 transitions. [2022-12-13 21:53:40,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions. [2022-12-13 21:53:40,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:40,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions. [2022-12-13 21:53:40,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 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 21:53:40,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 21:53:40,952 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 21:53:40,952 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 549 flow. Second operand 6 states and 625 transitions. [2022-12-13 21:53:40,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 910 flow [2022-12-13 21:53:40,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 861 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-13 21:53:40,957 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 639 flow [2022-12-13 21:53:40,957 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2022-12-13 21:53:40,958 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-13 21:53:40,958 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 639 flow [2022-12-13 21:53:40,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:40,958 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:40,958 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] [2022-12-13 21:53:40,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:53:40,958 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash 68798135, now seen corresponding path program 3 times [2022-12-13 21:53:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:40,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132389309] [2022-12-13 21:53:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:41,761 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 21:53:41,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:41,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132389309] [2022-12-13 21:53:41,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132389309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:41,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:41,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:53:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526394558] [2022-12-13 21:53:41,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:41,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:53:41,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:41,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:53:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:53:41,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 218 [2022-12-13 21:53:41,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 639 flow. Second operand has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 21:53:41,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:41,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 218 [2022-12-13 21:53:41,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:42,218 INFO L130 PetriNetUnfolder]: 386/710 cut-off events. [2022-12-13 21:53:42,218 INFO L131 PetriNetUnfolder]: For 3631/3646 co-relation queries the response was YES. [2022-12-13 21:53:42,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3704 conditions, 710 events. 386/710 cut-off events. For 3631/3646 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3221 event pairs, 62 based on Foata normal form. 7/717 useless extension candidates. Maximal degree in co-relation 3677. Up to 407 conditions per place. [2022-12-13 21:53:42,221 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 79 selfloop transitions, 25 changer transitions 17/122 dead transitions. [2022-12-13 21:53:42,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 122 transitions, 1200 flow [2022-12-13 21:53:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:53:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 21:53:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 967 transitions. [2022-12-13 21:53:42,223 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44357798165137613 [2022-12-13 21:53:42,224 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 967 transitions. [2022-12-13 21:53:42,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 967 transitions. [2022-12-13 21:53:42,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:42,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 967 transitions. [2022-12-13 21:53:42,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.7) internal successors, (967), 10 states have internal predecessors, (967), 0 states have call successors, (0), 0 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 21:53:42,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 218.0) internal successors, (2398), 11 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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 21:53:42,227 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 218.0) internal successors, (2398), 11 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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 21:53:42,227 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 639 flow. Second operand 10 states and 967 transitions. [2022-12-13 21:53:42,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 122 transitions, 1200 flow [2022-12-13 21:53:42,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 1177 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 21:53:42,232 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 772 flow [2022-12-13 21:53:42,233 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=772, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2022-12-13 21:53:42,233 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 37 predicate places. [2022-12-13 21:53:42,233 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 772 flow [2022-12-13 21:53:42,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 21:53:42,233 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:42,233 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] [2022-12-13 21:53:42,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:53:42,234 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1285201663, now seen corresponding path program 4 times [2022-12-13 21:53:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:42,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378409353] [2022-12-13 21:53:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:42,938 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 21:53:42,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:42,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378409353] [2022-12-13 21:53:42,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378409353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:42,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:42,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:53:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308042073] [2022-12-13 21:53:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:42,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:53:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:42,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:53:42,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:53:43,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 218 [2022-12-13 21:53:43,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 772 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 21:53:43,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:43,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 218 [2022-12-13 21:53:43,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:43,504 INFO L130 PetriNetUnfolder]: 471/859 cut-off events. [2022-12-13 21:53:43,504 INFO L131 PetriNetUnfolder]: For 5049/5073 co-relation queries the response was YES. [2022-12-13 21:53:43,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 859 events. 471/859 cut-off events. For 5049/5073 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4095 event pairs, 41 based on Foata normal form. 13/872 useless extension candidates. Maximal degree in co-relation 4727. Up to 423 conditions per place. [2022-12-13 21:53:43,507 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 63 selfloop transitions, 26 changer transitions 43/133 dead transitions. [2022-12-13 21:53:43,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 133 transitions, 1476 flow [2022-12-13 21:53:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:53:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 21:53:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 959 transitions. [2022-12-13 21:53:43,509 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4399082568807339 [2022-12-13 21:53:43,509 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 959 transitions. [2022-12-13 21:53:43,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 959 transitions. [2022-12-13 21:53:43,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:43,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 959 transitions. [2022-12-13 21:53:43,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.9) internal successors, (959), 10 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:43,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 218.0) internal successors, (2398), 11 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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 21:53:43,513 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 218.0) internal successors, (2398), 11 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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 21:53:43,513 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 772 flow. Second operand 10 states and 959 transitions. [2022-12-13 21:53:43,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 133 transitions, 1476 flow [2022-12-13 21:53:43,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 133 transitions, 1420 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-13 21:53:43,521 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 752 flow [2022-12-13 21:53:43,521 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=752, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2022-12-13 21:53:43,521 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2022-12-13 21:53:43,521 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 752 flow [2022-12-13 21:53:43,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 21:53:43,521 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:43,521 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] [2022-12-13 21:53:43,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:53:43,522 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1073782965, now seen corresponding path program 5 times [2022-12-13 21:53:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226637133] [2022-12-13 21:53:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:43,943 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 21:53:43,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:43,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226637133] [2022-12-13 21:53:43,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226637133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:43,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:43,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:53:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382314538] [2022-12-13 21:53:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:43,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:53:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:43,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:53:43,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:53:43,975 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-12-13 21:53:43,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 752 flow. Second operand has 8 states, 8 states have (on average 97.625) internal successors, (781), 8 states have internal predecessors, (781), 0 states have call successors, (0), 0 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 21:53:43,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:43,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-12-13 21:53:43,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:44,325 INFO L130 PetriNetUnfolder]: 376/687 cut-off events. [2022-12-13 21:53:44,325 INFO L131 PetriNetUnfolder]: For 4545/4557 co-relation queries the response was YES. [2022-12-13 21:53:44,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 687 events. 376/687 cut-off events. For 4545/4557 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3086 event pairs, 37 based on Foata normal form. 13/700 useless extension candidates. Maximal degree in co-relation 3865. Up to 335 conditions per place. [2022-12-13 21:53:44,329 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 69 selfloop transitions, 31 changer transitions 11/112 dead transitions. [2022-12-13 21:53:44,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 1241 flow [2022-12-13 21:53:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:53:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:53:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 830 transitions. [2022-12-13 21:53:44,331 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47591743119266056 [2022-12-13 21:53:44,331 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 830 transitions. [2022-12-13 21:53:44,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 830 transitions. [2022-12-13 21:53:44,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:44,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 830 transitions. [2022-12-13 21:53:44,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.75) internal successors, (830), 8 states have internal predecessors, (830), 0 states have call successors, (0), 0 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 21:53:44,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 21:53:44,333 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 21:53:44,333 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 752 flow. Second operand 8 states and 830 transitions. [2022-12-13 21:53:44,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 1241 flow [2022-12-13 21:53:44,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 1127 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-12-13 21:53:44,341 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 797 flow [2022-12-13 21:53:44,341 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=797, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2022-12-13 21:53:44,342 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2022-12-13 21:53:44,342 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 797 flow [2022-12-13 21:53:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.625) internal successors, (781), 8 states have internal predecessors, (781), 0 states have call successors, (0), 0 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 21:53:44,342 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:44,342 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] [2022-12-13 21:53:44,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:53:44,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash -839057073, now seen corresponding path program 6 times [2022-12-13 21:53:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:44,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838824239] [2022-12-13 21:53:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:44,702 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 21:53:44,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:44,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838824239] [2022-12-13 21:53:44,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838824239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:44,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:44,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:53:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262208771] [2022-12-13 21:53:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:44,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:53:44,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:44,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:53:44,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:53:44,726 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 218 [2022-12-13 21:53:44,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 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 21:53:44,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:44,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 218 [2022-12-13 21:53:44,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:44,974 INFO L130 PetriNetUnfolder]: 375/685 cut-off events. [2022-12-13 21:53:44,974 INFO L131 PetriNetUnfolder]: For 4881/4893 co-relation queries the response was YES. [2022-12-13 21:53:44,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3850 conditions, 685 events. 375/685 cut-off events. For 4881/4893 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3050 event pairs, 107 based on Foata normal form. 4/688 useless extension candidates. Maximal degree in co-relation 3820. Up to 548 conditions per place. [2022-12-13 21:53:44,976 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 64 selfloop transitions, 17 changer transitions 19/101 dead transitions. [2022-12-13 21:53:44,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 101 transitions, 1196 flow [2022-12-13 21:53:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:53:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:53:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2022-12-13 21:53:44,979 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4619921363040629 [2022-12-13 21:53:44,979 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2022-12-13 21:53:44,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2022-12-13 21:53:44,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:44,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2022-12-13 21:53:44,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:44,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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 21:53:44,982 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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 21:53:44,982 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 797 flow. Second operand 7 states and 705 transitions. [2022-12-13 21:53:44,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 101 transitions, 1196 flow [2022-12-13 21:53:44,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 101 transitions, 1093 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-13 21:53:44,989 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 789 flow [2022-12-13 21:53:44,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=789, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2022-12-13 21:53:44,990 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2022-12-13 21:53:44,990 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 789 flow [2022-12-13 21:53:44,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 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 21:53:44,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:44,990 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] [2022-12-13 21:53:44,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:53:44,990 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:44,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash 559279747, now seen corresponding path program 7 times [2022-12-13 21:53:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:44,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131952438] [2022-12-13 21:53:44,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:45,997 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 21:53:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:45,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131952438] [2022-12-13 21:53:45,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131952438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:45,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:45,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:53:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54729791] [2022-12-13 21:53:45,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:45,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:53:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:45,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:53:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:53:46,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 218 [2022-12-13 21:53:46,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 789 flow. Second operand has 10 states, 10 states have (on average 89.1) internal successors, (891), 10 states have internal predecessors, (891), 0 states have call successors, (0), 0 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 21:53:46,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:46,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 218 [2022-12-13 21:53:46,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:46,601 INFO L130 PetriNetUnfolder]: 448/848 cut-off events. [2022-12-13 21:53:46,602 INFO L131 PetriNetUnfolder]: For 5229/5241 co-relation queries the response was YES. [2022-12-13 21:53:46,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4543 conditions, 848 events. 448/848 cut-off events. For 5229/5241 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4166 event pairs, 32 based on Foata normal form. 5/852 useless extension candidates. Maximal degree in co-relation 4513. Up to 278 conditions per place. [2022-12-13 21:53:46,604 INFO L137 encePairwiseOnDemand]: 210/218 looper letters, 81 selfloop transitions, 37 changer transitions 32/151 dead transitions. [2022-12-13 21:53:46,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 151 transitions, 1578 flow [2022-12-13 21:53:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:53:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 21:53:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 864 transitions. [2022-12-13 21:53:46,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44036697247706424 [2022-12-13 21:53:46,606 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 864 transitions. [2022-12-13 21:53:46,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 864 transitions. [2022-12-13 21:53:46,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:46,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 864 transitions. [2022-12-13 21:53:46,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.0) internal successors, (864), 9 states have internal predecessors, (864), 0 states have call successors, (0), 0 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 21:53:46,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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 21:53:46,609 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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 21:53:46,609 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 789 flow. Second operand 9 states and 864 transitions. [2022-12-13 21:53:46,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 151 transitions, 1578 flow [2022-12-13 21:53:46,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 151 transitions, 1517 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 21:53:46,620 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 920 flow [2022-12-13 21:53:46,620 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=920, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2022-12-13 21:53:46,620 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2022-12-13 21:53:46,620 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 920 flow [2022-12-13 21:53:46,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.1) internal successors, (891), 10 states have internal predecessors, (891), 0 states have call successors, (0), 0 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 21:53:46,621 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:46,621 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] [2022-12-13 21:53:46,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 21:53:46,621 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:46,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash 547483905, now seen corresponding path program 8 times [2022-12-13 21:53:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:46,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004318174] [2022-12-13 21:53:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:47,092 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 21:53:47,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:47,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004318174] [2022-12-13 21:53:47,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004318174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:47,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:47,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:53:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653129719] [2022-12-13 21:53:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:47,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:53:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:53:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:53:47,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 218 [2022-12-13 21:53:47,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 920 flow. Second operand has 9 states, 9 states have (on average 93.33333333333333) internal successors, (840), 9 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 21:53:47,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:47,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 218 [2022-12-13 21:53:47,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:47,489 INFO L130 PetriNetUnfolder]: 410/784 cut-off events. [2022-12-13 21:53:47,490 INFO L131 PetriNetUnfolder]: For 6311/6323 co-relation queries the response was YES. [2022-12-13 21:53:47,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 784 events. 410/784 cut-off events. For 6311/6323 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3800 event pairs, 92 based on Foata normal form. 5/788 useless extension candidates. Maximal degree in co-relation 4439. Up to 444 conditions per place. [2022-12-13 21:53:47,492 INFO L137 encePairwiseOnDemand]: 210/218 looper letters, 66 selfloop transitions, 10 changer transitions 38/115 dead transitions. [2022-12-13 21:53:47,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 115 transitions, 1447 flow [2022-12-13 21:53:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:53:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:53:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 789 transitions. [2022-12-13 21:53:47,494 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45240825688073394 [2022-12-13 21:53:47,494 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 789 transitions. [2022-12-13 21:53:47,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 789 transitions. [2022-12-13 21:53:47,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:47,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 789 transitions. [2022-12-13 21:53:47,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 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 21:53:47,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 21:53:47,497 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 21:53:47,497 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 920 flow. Second operand 8 states and 789 transitions. [2022-12-13 21:53:47,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 115 transitions, 1447 flow [2022-12-13 21:53:47,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 1292 flow, removed 45 selfloop flow, removed 6 redundant places. [2022-12-13 21:53:47,509 INFO L231 Difference]: Finished difference. Result has 85 places, 62 transitions, 677 flow [2022-12-13 21:53:47,509 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=677, PETRI_PLACES=85, PETRI_TRANSITIONS=62} [2022-12-13 21:53:47,509 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2022-12-13 21:53:47,509 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 62 transitions, 677 flow [2022-12-13 21:53:47,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.33333333333333) internal successors, (840), 9 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 21:53:47,510 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:47,510 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] [2022-12-13 21:53:47,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 21:53:47,510 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash 298042491, now seen corresponding path program 9 times [2022-12-13 21:53:47,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:47,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103832932] [2022-12-13 21:53:47,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:48,174 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 21:53:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:48,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103832932] [2022-12-13 21:53:48,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103832932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:48,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:48,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:53:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552386668] [2022-12-13 21:53:48,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:48,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:53:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:48,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:53:48,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:53:48,205 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 218 [2022-12-13 21:53:48,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 62 transitions, 677 flow. Second operand has 7 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:48,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:48,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 218 [2022-12-13 21:53:48,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:48,412 INFO L130 PetriNetUnfolder]: 316/611 cut-off events. [2022-12-13 21:53:48,412 INFO L131 PetriNetUnfolder]: For 3921/3927 co-relation queries the response was YES. [2022-12-13 21:53:48,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 611 events. 316/611 cut-off events. For 3921/3927 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2796 event pairs, 56 based on Foata normal form. 1/611 useless extension candidates. Maximal degree in co-relation 3140. Up to 339 conditions per place. [2022-12-13 21:53:48,415 INFO L137 encePairwiseOnDemand]: 210/218 looper letters, 52 selfloop transitions, 22 changer transitions 7/82 dead transitions. [2022-12-13 21:53:48,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 956 flow [2022-12-13 21:53:48,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:53:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:53:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2022-12-13 21:53:48,416 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.463302752293578 [2022-12-13 21:53:48,416 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2022-12-13 21:53:48,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2022-12-13 21:53:48,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:48,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2022-12-13 21:53:48,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 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 21:53:48,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 21:53:48,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 21:53:48,418 INFO L175 Difference]: Start difference. First operand has 85 places, 62 transitions, 677 flow. Second operand 5 states and 505 transitions. [2022-12-13 21:53:48,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 956 flow [2022-12-13 21:53:48,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 82 transitions, 857 flow, removed 12 selfloop flow, removed 12 redundant places. [2022-12-13 21:53:48,426 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 686 flow [2022-12-13 21:53:48,426 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=686, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2022-12-13 21:53:48,426 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2022-12-13 21:53:48,426 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 686 flow [2022-12-13 21:53:48,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:53:48,426 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:48,426 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] [2022-12-13 21:53:48,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 21:53:48,427 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash 512060305, now seen corresponding path program 10 times [2022-12-13 21:53:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:48,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972567372] [2022-12-13 21:53:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:48,820 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 21:53:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:48,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972567372] [2022-12-13 21:53:48,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972567372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:48,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:48,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:53:48,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306832934] [2022-12-13 21:53:48,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:48,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:53:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:53:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:53:48,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 218 [2022-12-13 21:53:48,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 686 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:53:48,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:48,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 218 [2022-12-13 21:53:48,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:49,110 INFO L130 PetriNetUnfolder]: 371/743 cut-off events. [2022-12-13 21:53:49,110 INFO L131 PetriNetUnfolder]: For 4333/4339 co-relation queries the response was YES. [2022-12-13 21:53:49,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3778 conditions, 743 events. 371/743 cut-off events. For 4333/4339 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3743 event pairs, 54 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 3749. Up to 388 conditions per place. [2022-12-13 21:53:49,113 INFO L137 encePairwiseOnDemand]: 208/218 looper letters, 70 selfloop transitions, 24 changer transitions 30/125 dead transitions. [2022-12-13 21:53:49,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 125 transitions, 1369 flow [2022-12-13 21:53:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:53:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:53:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2022-12-13 21:53:49,114 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45740498034076016 [2022-12-13 21:53:49,115 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2022-12-13 21:53:49,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2022-12-13 21:53:49,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:49,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2022-12-13 21:53:49,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 0 states have call successors, (0), 0 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 21:53:49,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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 21:53:49,118 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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 21:53:49,118 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 686 flow. Second operand 7 states and 698 transitions. [2022-12-13 21:53:49,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 125 transitions, 1369 flow [2022-12-13 21:53:49,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 1343 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 21:53:49,126 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 754 flow [2022-12-13 21:53:49,126 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=754, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2022-12-13 21:53:49,127 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2022-12-13 21:53:49,127 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 754 flow [2022-12-13 21:53:49,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:53:49,127 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:49,127 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] [2022-12-13 21:53:49,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 21:53:49,127 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1811185823, now seen corresponding path program 11 times [2022-12-13 21:53:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276919371] [2022-12-13 21:53:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:50,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 21:53:50,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:50,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276919371] [2022-12-13 21:53:50,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276919371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:50,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:50,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:53:50,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205027211] [2022-12-13 21:53:50,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:50,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 21:53:50,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:50,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 21:53:50,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:53:50,309 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 218 [2022-12-13 21:53:50,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 754 flow. Second operand has 12 states, 12 states have (on average 90.75) internal successors, (1089), 12 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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 21:53:50,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:50,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 218 [2022-12-13 21:53:50,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:50,680 INFO L130 PetriNetUnfolder]: 323/666 cut-off events. [2022-12-13 21:53:50,680 INFO L131 PetriNetUnfolder]: For 5335/5341 co-relation queries the response was YES. [2022-12-13 21:53:50,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 666 events. 323/666 cut-off events. For 5335/5341 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3257 event pairs, 99 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 3659. Up to 339 conditions per place. [2022-12-13 21:53:50,682 INFO L137 encePairwiseOnDemand]: 210/218 looper letters, 69 selfloop transitions, 11 changer transitions 28/109 dead transitions. [2022-12-13 21:53:50,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 109 transitions, 1316 flow [2022-12-13 21:53:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:53:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 21:53:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 858 transitions. [2022-12-13 21:53:50,684 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43730886850152906 [2022-12-13 21:53:50,684 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 858 transitions. [2022-12-13 21:53:50,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 858 transitions. [2022-12-13 21:53:50,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:50,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 858 transitions. [2022-12-13 21:53:50,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.33333333333333) internal successors, (858), 9 states have internal predecessors, (858), 0 states have call successors, (0), 0 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 21:53:50,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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 21:53:50,686 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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 21:53:50,686 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 754 flow. Second operand 9 states and 858 transitions. [2022-12-13 21:53:50,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 109 transitions, 1316 flow [2022-12-13 21:53:50,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 1227 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 21:53:50,696 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 745 flow [2022-12-13 21:53:50,697 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2022-12-13 21:53:50,697 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2022-12-13 21:53:50,697 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 745 flow [2022-12-13 21:53:50,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 90.75) internal successors, (1089), 12 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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 21:53:50,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:50,697 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] [2022-12-13 21:53:50,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 21:53:50,701 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:50,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1311359477, now seen corresponding path program 12 times [2022-12-13 21:53:50,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:50,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893666525] [2022-12-13 21:53:50,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:51,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 21:53:51,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:51,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893666525] [2022-12-13 21:53:51,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893666525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:51,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:51,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:53:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583598292] [2022-12-13 21:53:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:51,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:53:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:53:51,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:53:51,054 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2022-12-13 21:53:51,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 745 flow. Second operand has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 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 21:53:51,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:51,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2022-12-13 21:53:51,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:51,297 INFO L130 PetriNetUnfolder]: 360/758 cut-off events. [2022-12-13 21:53:51,297 INFO L131 PetriNetUnfolder]: For 4430/4436 co-relation queries the response was YES. [2022-12-13 21:53:51,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3877 conditions, 758 events. 360/758 cut-off events. For 4430/4436 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3968 event pairs, 83 based on Foata normal form. 8/766 useless extension candidates. Maximal degree in co-relation 3846. Up to 295 conditions per place. [2022-12-13 21:53:51,300 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 66 selfloop transitions, 17 changer transitions 44/128 dead transitions. [2022-12-13 21:53:51,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 128 transitions, 1369 flow [2022-12-13 21:53:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:53:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:53:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 813 transitions. [2022-12-13 21:53:51,301 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4661697247706422 [2022-12-13 21:53:51,301 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 813 transitions. [2022-12-13 21:53:51,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 813 transitions. [2022-12-13 21:53:51,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:51,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 813 transitions. [2022-12-13 21:53:51,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.625) internal successors, (813), 8 states have internal predecessors, (813), 0 states have call successors, (0), 0 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 21:53:51,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 21:53:51,303 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 21:53:51,303 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 745 flow. Second operand 8 states and 813 transitions. [2022-12-13 21:53:51,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 128 transitions, 1369 flow [2022-12-13 21:53:51,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 128 transitions, 1325 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-13 21:53:51,313 INFO L231 Difference]: Finished difference. Result has 86 places, 61 transitions, 661 flow [2022-12-13 21:53:51,314 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=661, PETRI_PLACES=86, PETRI_TRANSITIONS=61} [2022-12-13 21:53:51,314 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2022-12-13 21:53:51,314 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 61 transitions, 661 flow [2022-12-13 21:53:51,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 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 21:53:51,314 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:51,314 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] [2022-12-13 21:53:51,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 21:53:51,314 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:53:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1860202259, now seen corresponding path program 13 times [2022-12-13 21:53:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:51,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169076725] [2022-12-13 21:53:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:53:51,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:53:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:53:51,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:53:51,400 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:53:51,401 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 21:53:51,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 21:53:51,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 21:53:51,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 21:53:51,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 21:53:51,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 21:53:51,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 21:53:51,403 INFO L445 BasicCegarLoop]: Path program histogram: [13, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:51,407 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:53:51,407 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:53:51,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:53:51 BasicIcfg [2022-12-13 21:53:51,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:53:51,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:53:51,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:53:51,451 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:53:51,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:26" (3/4) ... [2022-12-13 21:53:51,453 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 21:53:51,525 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:53:51,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:53:51,525 INFO L158 Benchmark]: Toolchain (without parser) took 26498.07ms. Allocated memory was 136.3MB in the beginning and 287.3MB in the end (delta: 151.0MB). Free memory was 92.9MB in the beginning and 192.1MB in the end (delta: -99.2MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2022-12-13 21:53:51,526 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 136.3MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:53:51,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.88ms. Allocated memory is still 136.3MB. Free memory was 92.9MB in the beginning and 63.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 21:53:51,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.63ms. Allocated memory is still 136.3MB. Free memory was 63.4MB in the beginning and 60.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 21:53:51,526 INFO L158 Benchmark]: Boogie Preprocessor took 24.19ms. Allocated memory is still 136.3MB. Free memory was 60.7MB in the beginning and 58.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:53:51,527 INFO L158 Benchmark]: RCFGBuilder took 626.09ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 58.2MB in the beginning and 104.0MB in the end (delta: -45.8MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2022-12-13 21:53:51,527 INFO L158 Benchmark]: TraceAbstraction took 25212.69ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 103.1MB in the beginning and 203.6MB in the end (delta: -100.6MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-12-13 21:53:51,527 INFO L158 Benchmark]: Witness Printer took 74.22ms. Allocated memory is still 287.3MB. Free memory was 203.6MB in the beginning and 192.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:53:51,529 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.16ms. Allocated memory is still 136.3MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.88ms. Allocated memory is still 136.3MB. Free memory was 92.9MB in the beginning and 63.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.63ms. Allocated memory is still 136.3MB. Free memory was 63.4MB in the beginning and 60.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.19ms. Allocated memory is still 136.3MB. Free memory was 60.7MB in the beginning and 58.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 626.09ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 58.2MB in the beginning and 104.0MB in the end (delta: -45.8MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25212.69ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 103.1MB in the beginning and 203.6MB in the end (delta: -100.6MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 74.22ms. Allocated memory is still 287.3MB. Free memory was 203.6MB in the beginning and 192.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 121 PlacesBefore, 34 PlacesAfterwards, 113 TransitionsBefore, 24 TransitionsAfterwards, 2206 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 5687 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2164, independent: 1990, independent conditional: 0, independent unconditional: 1990, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1194, independent: 1146, independent conditional: 0, independent unconditional: 1146, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2164, independent: 844, independent conditional: 0, independent unconditional: 844, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 1194, unknown conditional: 0, unknown unconditional: 1194] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-3, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-2, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=68, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 859]: 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: 857]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 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: 25.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1589 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1314 mSDsluCounter, 1116 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 831 mSDsCounter, 691 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3665 IncrementalHoareTripleChecker+Invalid, 4356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 691 mSolverCounterUnsat, 285 mSDtfsCounter, 3665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=920occurred in iteration=18, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 5502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 21:53:51,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e6ac07-4d8f-4de5-86f4-4851b5b1221e/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