./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/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_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/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_70476f51-75da-4906-a8e9-ff6658861aa8/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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- 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 13:21:43,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:21:43,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:21:43,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:21:43,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:21:43,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:21:43,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:21:43,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:21:43,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:21:43,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:21:43,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:21:43,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:21:43,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:21:43,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:21:43,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:21:43,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:21:43,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:21:43,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:21:43,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:21:43,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:21:43,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:21:43,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:21:43,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:21:43,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:21:43,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:21:43,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:21:43,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:21:43,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:21:43,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:21:43,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:21:43,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:21:43,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:21:43,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:21:43,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:21:43,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:21:43,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:21:43,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:21:43,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:21:43,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:21:43,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:21:43,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:21:43,499 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:21:43,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:21:43,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:21:43,516 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:21:43,516 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:21:43,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:21:43,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:21:43,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:21:43,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:21:43,518 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:21:43,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:21:43,518 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:21:43,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:21:43,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:21:43,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:21:43,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:21:43,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:21:43,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:21:43,519 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:21:43,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:21:43,520 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:21:43,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:21:43,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:21:43,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:21:43,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:21:43,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:21:43,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:21:43,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:21:43,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:21:43,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:21:43,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:21:43,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:21:43,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:21:43,522 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:21:43,522 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:21:43,523 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:21:43,523 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_70476f51-75da-4906-a8e9-ff6658861aa8/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_70476f51-75da-4906-a8e9-ff6658861aa8/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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2022-12-13 13:21:43,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:21:43,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:21:43,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:21:43,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:21:43,728 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:21:43,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 13:21:46,280 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:21:46,463 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:21:46,464 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 13:21:46,477 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/data/4fc1c8c71/6c82648d04094038a63b6e6d9475406d/FLAG38d0ebbe6 [2022-12-13 13:21:46,831 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/data/4fc1c8c71/6c82648d04094038a63b6e6d9475406d [2022-12-13 13:21:46,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:21:46,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:21:46,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:21:46,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:21:46,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:21:46,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:21:46" (1/1) ... [2022-12-13 13:21:46,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95023b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:46, skipping insertion in model container [2022-12-13 13:21:46,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:21:46" (1/1) ... [2022-12-13 13:21:46,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:21:46,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:21:46,977 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_70476f51-75da-4906-a8e9-ff6658861aa8/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-13 13:21:47,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:21:47,117 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:21:47,125 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_70476f51-75da-4906-a8e9-ff6658861aa8/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-13 13:21:47,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:47,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:47,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:21:47,184 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:21:47,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47 WrapperNode [2022-12-13 13:21:47,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:21:47,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:21:47,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:21:47,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:21:47,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,219 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-13 13:21:47,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:21:47,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:21:47,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:21:47,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:21:47,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,239 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:21:47,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:21:47,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:21:47,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:21:47,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (1/1) ... [2022-12-13 13:21:47,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:21:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:21:47,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:21:47,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:21:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:21:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:21:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:21:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:21:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:21:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:21:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:21:47,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:21:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:21:47,303 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:21:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:21:47,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:21:47,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:21:47,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:21:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:21:47,304 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 13:21:47,411 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:21:47,413 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:21:47,765 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:21:47,854 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:21:47,854 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:21:47,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:21:47 BoogieIcfgContainer [2022-12-13 13:21:47,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:21:47,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:21:47,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:21:47,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:21:47,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:21:46" (1/3) ... [2022-12-13 13:21:47,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5191ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:21:47, skipping insertion in model container [2022-12-13 13:21:47,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:47" (2/3) ... [2022-12-13 13:21:47,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5191ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:21:47, skipping insertion in model container [2022-12-13 13:21:47,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:21:47" (3/3) ... [2022-12-13 13:21:47,862 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 13:21:47,868 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:21:47,875 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:21:47,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:21:47,875 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:21:47,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:21:47,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 13:21:47,992 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 13:21:47,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:21:47,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-13 13:21:47,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 13:21:47,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-13 13:21:48,001 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:21:48,008 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 13:21:48,011 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 13:21:48,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-13 13:21:48,028 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 13:21:48,029 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:21:48,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-13 13:21:48,030 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 13:21:50,873 INFO L134 LiptonReduction]: Checked pairs total: 5276 [2022-12-13 13:21:50,874 INFO L136 LiptonReduction]: Total number of compositions: 99 [2022-12-13 13:21:50,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:21:50,889 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;@e20c858, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:21:50,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 13:21:50,891 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 13:21:50,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:21:50,891 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:50,891 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 13:21:50,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:21:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 547862, now seen corresponding path program 1 times [2022-12-13 13:21:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:50,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346819668] [2022-12-13 13:21:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:51,163 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 13:21:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:51,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346819668] [2022-12-13 13:21:51,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346819668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:51,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:51,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:21:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508450751] [2022-12-13 13:21:51,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:51,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:21:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:51,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:21:51,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:21:51,193 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 213 [2022-12-13 13:21:51,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 13:21:51,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:51,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 213 [2022-12-13 13:21:51,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:51,521 INFO L130 PetriNetUnfolder]: 1263/2016 cut-off events. [2022-12-13 13:21:51,521 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 13:21:51,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 2016 events. 1263/2016 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10939 event pairs, 204 based on Foata normal form. 80/1935 useless extension candidates. Maximal degree in co-relation 3916. Up to 1510 conditions per place. [2022-12-13 13:21:51,530 INFO L137 encePairwiseOnDemand]: 209/213 looper letters, 33 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2022-12-13 13:21:51,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 175 flow [2022-12-13 13:21:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:21:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:21:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-12-13 13:21:51,540 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5258215962441315 [2022-12-13 13:21:51,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-12-13 13:21:51,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-12-13 13:21:51,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:51,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-12-13 13:21:51,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 13:21:51,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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 13:21:51,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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 13:21:51,551 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 336 transitions. [2022-12-13 13:21:51,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 175 flow [2022-12-13 13:21:51,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:21:51,554 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-12-13 13:21:51,556 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-13 13:21:51,559 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-13 13:21:51,559 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2022-12-13 13:21:51,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 13:21:51,559 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:51,559 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:51,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:21:51,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:21:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash 715125328, now seen corresponding path program 1 times [2022-12-13 13:21:51,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:51,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568556452] [2022-12-13 13:21:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:52,392 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 13:21:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:52,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568556452] [2022-12-13 13:21:52,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568556452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:52,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:52,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:21:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106889442] [2022-12-13 13:21:52,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:52,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:21:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:52,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:21:52,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:21:52,444 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 213 [2022-12-13 13:21:52,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 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 13:21:52,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:52,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 213 [2022-12-13 13:21:52,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:52,968 INFO L130 PetriNetUnfolder]: 1267/1918 cut-off events. [2022-12-13 13:21:52,968 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-13 13:21:52,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 1918 events. 1267/1918 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8664 event pairs, 357 based on Foata normal form. 112/2024 useless extension candidates. Maximal degree in co-relation 3988. Up to 1028 conditions per place. [2022-12-13 13:21:52,976 INFO L137 encePairwiseOnDemand]: 203/213 looper letters, 31 selfloop transitions, 8 changer transitions 26/66 dead transitions. [2022-12-13 13:21:52,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 66 transitions, 278 flow [2022-12-13 13:21:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:21:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:21:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 691 transitions. [2022-12-13 13:21:52,981 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46344735077129445 [2022-12-13 13:21:52,981 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 691 transitions. [2022-12-13 13:21:52,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 691 transitions. [2022-12-13 13:21:52,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:52,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 691 transitions. [2022-12-13 13:21:52,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 13:21:52,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:21:52,989 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:21:52,989 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 7 states and 691 transitions. [2022-12-13 13:21:52,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 66 transitions, 278 flow [2022-12-13 13:21:52,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 66 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:52,991 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 126 flow [2022-12-13 13:21:52,991 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, 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=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 13:21:52,991 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-13 13:21:52,992 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 126 flow [2022-12-13 13:21:52,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 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 13:21:52,992 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:52,992 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:52,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:21:52,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:21:52,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 111559292, now seen corresponding path program 1 times [2022-12-13 13:21:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:52,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457777597] [2022-12-13 13:21:52,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:53,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457777597] [2022-12-13 13:21:53,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457777597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:53,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:53,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:21:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74714859] [2022-12-13 13:21:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:53,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:21:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:53,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:21:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:21:53,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2022-12-13 13:21:53,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:53,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:53,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2022-12-13 13:21:53,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:53,739 INFO L130 PetriNetUnfolder]: 1963/2951 cut-off events. [2022-12-13 13:21:53,739 INFO L131 PetriNetUnfolder]: For 2720/2782 co-relation queries the response was YES. [2022-12-13 13:21:53,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9135 conditions, 2951 events. 1963/2951 cut-off events. For 2720/2782 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14250 event pairs, 456 based on Foata normal form. 135/3050 useless extension candidates. Maximal degree in co-relation 9119. Up to 1425 conditions per place. [2022-12-13 13:21:53,750 INFO L137 encePairwiseOnDemand]: 205/213 looper letters, 39 selfloop transitions, 5 changer transitions 25/71 dead transitions. [2022-12-13 13:21:53,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 71 transitions, 446 flow [2022-12-13 13:21:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:21:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:21:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-12-13 13:21:53,752 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5032863849765258 [2022-12-13 13:21:53,752 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2022-12-13 13:21:53,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2022-12-13 13:21:53,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:53,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2022-12-13 13:21:53,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 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 13:21:53,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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 13:21:53,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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 13:21:53,755 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 126 flow. Second operand 5 states and 536 transitions. [2022-12-13 13:21:53,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 71 transitions, 446 flow [2022-12-13 13:21:53,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 438 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:53,768 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 158 flow [2022-12-13 13:21:53,768 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-13 13:21:53,768 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-13 13:21:53,768 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 158 flow [2022-12-13 13:21:53,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:53,769 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:53,769 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:53,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:21:53,769 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:21:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash 40060892, now seen corresponding path program 2 times [2022-12-13 13:21:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:53,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686418258] [2022-12-13 13:21:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:54,699 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 13:21:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686418258] [2022-12-13 13:21:54,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686418258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:54,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:54,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:21:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162089687] [2022-12-13 13:21:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:54,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:21:54,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:54,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:21:54,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:21:54,746 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 213 [2022-12-13 13:21:54,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:54,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:54,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 213 [2022-12-13 13:21:54,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:55,366 INFO L130 PetriNetUnfolder]: 1566/2362 cut-off events. [2022-12-13 13:21:55,366 INFO L131 PetriNetUnfolder]: For 2739/2739 co-relation queries the response was YES. [2022-12-13 13:21:55,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8150 conditions, 2362 events. 1566/2362 cut-off events. For 2739/2739 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10424 event pairs, 451 based on Foata normal form. 99/2461 useless extension candidates. Maximal degree in co-relation 8131. Up to 1767 conditions per place. [2022-12-13 13:21:55,376 INFO L137 encePairwiseOnDemand]: 200/213 looper letters, 42 selfloop transitions, 20 changer transitions 29/91 dead transitions. [2022-12-13 13:21:55,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 91 transitions, 622 flow [2022-12-13 13:21:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:21:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:21:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2022-12-13 13:21:55,379 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4681421864520456 [2022-12-13 13:21:55,379 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2022-12-13 13:21:55,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2022-12-13 13:21:55,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:55,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2022-12-13 13:21:55,380 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 13:21:55,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:21:55,398 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:21:55,398 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 158 flow. Second operand 7 states and 698 transitions. [2022-12-13 13:21:55,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 91 transitions, 622 flow [2022-12-13 13:21:55,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 598 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 13:21:55,404 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 330 flow [2022-12-13 13:21:55,404 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-12-13 13:21:55,405 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2022-12-13 13:21:55,405 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 330 flow [2022-12-13 13:21:55,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:55,405 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:55,405 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:55,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:21:55,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:21:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash -848729459, now seen corresponding path program 1 times [2022-12-13 13:21:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:55,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604180638] [2022-12-13 13:21:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:55,936 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 13:21:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:55,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604180638] [2022-12-13 13:21:55,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604180638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:55,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:55,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:21:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222825566] [2022-12-13 13:21:55,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:55,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:21:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:55,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:21:55,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:21:55,979 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 213 [2022-12-13 13:21:55,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 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 13:21:55,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:55,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 213 [2022-12-13 13:21:55,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:56,412 INFO L130 PetriNetUnfolder]: 1310/2033 cut-off events. [2022-12-13 13:21:56,412 INFO L131 PetriNetUnfolder]: For 5902/5924 co-relation queries the response was YES. [2022-12-13 13:21:56,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9132 conditions, 2033 events. 1310/2033 cut-off events. For 5902/5924 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9336 event pairs, 498 based on Foata normal form. 91/2109 useless extension candidates. Maximal degree in co-relation 9109. Up to 1547 conditions per place. [2022-12-13 13:21:56,424 INFO L137 encePairwiseOnDemand]: 202/213 looper letters, 53 selfloop transitions, 22 changer transitions 19/97 dead transitions. [2022-12-13 13:21:56,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 890 flow [2022-12-13 13:21:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:21:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:21:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 694 transitions. [2022-12-13 13:21:56,427 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46545942320590206 [2022-12-13 13:21:56,427 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 694 transitions. [2022-12-13 13:21:56,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 694 transitions. [2022-12-13 13:21:56,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:56,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 694 transitions. [2022-12-13 13:21:56,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 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 13:21:56,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:21:56,432 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:21:56,433 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 330 flow. Second operand 7 states and 694 transitions. [2022-12-13 13:21:56,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 890 flow [2022-12-13 13:21:56,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 862 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-13 13:21:56,442 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 498 flow [2022-12-13 13:21:56,442 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=498, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2022-12-13 13:21:56,443 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2022-12-13 13:21:56,443 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 498 flow [2022-12-13 13:21:56,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 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 13:21:56,443 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:56,443 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:56,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:21:56,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:21:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1641766959, now seen corresponding path program 1 times [2022-12-13 13:21:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:56,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269778152] [2022-12-13 13:21:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:56,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:57,051 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 13:21:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:57,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269778152] [2022-12-13 13:21:57,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269778152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:57,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:57,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:21:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958289758] [2022-12-13 13:21:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:57,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:21:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:57,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:21:57,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:21:57,117 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 213 [2022-12-13 13:21:57,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 498 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 13:21:57,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:57,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 213 [2022-12-13 13:21:57,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:57,673 INFO L130 PetriNetUnfolder]: 2003/3009 cut-off events. [2022-12-13 13:21:57,673 INFO L131 PetriNetUnfolder]: For 10374/10374 co-relation queries the response was YES. [2022-12-13 13:21:57,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14431 conditions, 3009 events. 2003/3009 cut-off events. For 10374/10374 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14001 event pairs, 470 based on Foata normal form. 69/3078 useless extension candidates. Maximal degree in co-relation 14402. Up to 1545 conditions per place. [2022-12-13 13:21:57,684 INFO L137 encePairwiseOnDemand]: 200/213 looper letters, 72 selfloop transitions, 31 changer transitions 27/130 dead transitions. [2022-12-13 13:21:57,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 1414 flow [2022-12-13 13:21:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:21:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:21:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 679 transitions. [2022-12-13 13:21:57,686 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45539906103286387 [2022-12-13 13:21:57,687 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 679 transitions. [2022-12-13 13:21:57,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 679 transitions. [2022-12-13 13:21:57,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:57,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 679 transitions. [2022-12-13 13:21:57,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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 13:21:57,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:21:57,690 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:21:57,690 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 498 flow. Second operand 7 states and 679 transitions. [2022-12-13 13:21:57,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 1414 flow [2022-12-13 13:21:57,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 130 transitions, 1392 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 13:21:57,718 INFO L231 Difference]: Finished difference. Result has 61 places, 67 transitions, 790 flow [2022-12-13 13:21:57,718 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=790, PETRI_PLACES=61, PETRI_TRANSITIONS=67} [2022-12-13 13:21:57,719 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2022-12-13 13:21:57,719 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 67 transitions, 790 flow [2022-12-13 13:21:57,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 13:21:57,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:57,719 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:57,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:21:57,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:21:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1841091035, now seen corresponding path program 2 times [2022-12-13 13:21:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:57,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12705133] [2022-12-13 13:21:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:58,193 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 13:21:58,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:58,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12705133] [2022-12-13 13:21:58,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12705133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:58,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:58,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:21:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484001437] [2022-12-13 13:21:58,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:58,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:21:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:58,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:21:58,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:21:58,227 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 213 [2022-12-13 13:21:58,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 67 transitions, 790 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 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 13:21:58,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:58,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 213 [2022-12-13 13:21:58,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:58,667 INFO L130 PetriNetUnfolder]: 1673/2619 cut-off events. [2022-12-13 13:21:58,667 INFO L131 PetriNetUnfolder]: For 10691/10721 co-relation queries the response was YES. [2022-12-13 13:21:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12840 conditions, 2619 events. 1673/2619 cut-off events. For 10691/10721 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13017 event pairs, 499 based on Foata normal form. 83/2668 useless extension candidates. Maximal degree in co-relation 12808. Up to 1355 conditions per place. [2022-12-13 13:21:58,677 INFO L137 encePairwiseOnDemand]: 206/213 looper letters, 61 selfloop transitions, 20 changer transitions 19/104 dead transitions. [2022-12-13 13:21:58,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 1211 flow [2022-12-13 13:21:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:21:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:21:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2022-12-13 13:21:58,678 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46557120500782473 [2022-12-13 13:21:58,679 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 595 transitions. [2022-12-13 13:21:58,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 595 transitions. [2022-12-13 13:21:58,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:58,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 595 transitions. [2022-12-13 13:21:58,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 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 13:21:58,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 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 13:21:58,683 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 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 13:21:58,683 INFO L175 Difference]: Start difference. First operand has 61 places, 67 transitions, 790 flow. Second operand 6 states and 595 transitions. [2022-12-13 13:21:58,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 1211 flow [2022-12-13 13:21:58,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 104 transitions, 1155 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 13:21:58,717 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 764 flow [2022-12-13 13:21:58,717 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2022-12-13 13:21:58,718 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2022-12-13 13:21:58,718 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 764 flow [2022-12-13 13:21:58,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 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 13:21:58,718 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:58,719 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:58,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:21:58,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:21:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1451855976, now seen corresponding path program 1 times [2022-12-13 13:21:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:58,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459316515] [2022-12-13 13:21:58,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:59,530 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 13:21:59,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:59,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459316515] [2022-12-13 13:21:59,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459316515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:59,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:59,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:21:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823605807] [2022-12-13 13:21:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:59,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:21:59,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:21:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:21:59,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 213 [2022-12-13 13:21:59,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 764 flow. Second operand has 8 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 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 13:21:59,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:59,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 213 [2022-12-13 13:21:59,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:00,188 INFO L130 PetriNetUnfolder]: 1858/2925 cut-off events. [2022-12-13 13:22:00,189 INFO L131 PetriNetUnfolder]: For 14394/14394 co-relation queries the response was YES. [2022-12-13 13:22:00,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14375 conditions, 2925 events. 1858/2925 cut-off events. For 14394/14394 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14813 event pairs, 244 based on Foata normal form. 103/3028 useless extension candidates. Maximal degree in co-relation 14340. Up to 1611 conditions per place. [2022-12-13 13:22:00,198 INFO L137 encePairwiseOnDemand]: 202/213 looper letters, 57 selfloop transitions, 18 changer transitions 71/146 dead transitions. [2022-12-13 13:22:00,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 146 transitions, 1863 flow [2022-12-13 13:22:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:22:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:22:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 776 transitions. [2022-12-13 13:22:00,201 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45539906103286387 [2022-12-13 13:22:00,201 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 776 transitions. [2022-12-13 13:22:00,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 776 transitions. [2022-12-13 13:22:00,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:00,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 776 transitions. [2022-12-13 13:22:00,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 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 13:22:00,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:00,204 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:00,204 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 764 flow. Second operand 8 states and 776 transitions. [2022-12-13 13:22:00,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 146 transitions, 1863 flow [2022-12-13 13:22:00,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 146 transitions, 1809 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:22:00,229 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 570 flow [2022-12-13 13:22:00,229 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=570, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2022-12-13 13:22:00,229 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2022-12-13 13:22:00,229 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 570 flow [2022-12-13 13:22:00,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 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 13:22:00,230 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:00,230 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:00,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:22:00,230 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1219625434, now seen corresponding path program 1 times [2022-12-13 13:22:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:00,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853238244] [2022-12-13 13:22:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:00,654 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 13:22:00,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:00,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853238244] [2022-12-13 13:22:00,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853238244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:00,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:00,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:22:00,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023386227] [2022-12-13 13:22:00,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:00,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:22:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:00,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:22:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:22:00,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 213 [2022-12-13 13:22:00,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 570 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 13:22:00,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:00,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 213 [2022-12-13 13:22:00,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:01,217 INFO L130 PetriNetUnfolder]: 1192/1899 cut-off events. [2022-12-13 13:22:01,217 INFO L131 PetriNetUnfolder]: For 10542/10569 co-relation queries the response was YES. [2022-12-13 13:22:01,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9561 conditions, 1899 events. 1192/1899 cut-off events. For 10542/10569 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8833 event pairs, 636 based on Foata normal form. 77/1976 useless extension candidates. Maximal degree in co-relation 9523. Up to 1546 conditions per place. [2022-12-13 13:22:01,224 INFO L137 encePairwiseOnDemand]: 206/213 looper letters, 70 selfloop transitions, 13 changer transitions 23/109 dead transitions. [2022-12-13 13:22:01,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 1214 flow [2022-12-13 13:22:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:22:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:22:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2022-12-13 13:22:01,226 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.486697965571205 [2022-12-13 13:22:01,226 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 933 transitions. [2022-12-13 13:22:01,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 933 transitions. [2022-12-13 13:22:01,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:01,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 933 transitions. [2022-12-13 13:22:01,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 0 states have call successors, (0), 0 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 13:22:01,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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 13:22:01,230 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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 13:22:01,230 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 570 flow. Second operand 9 states and 933 transitions. [2022-12-13 13:22:01,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 1214 flow [2022-12-13 13:22:01,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 1061 flow, removed 20 selfloop flow, removed 12 redundant places. [2022-12-13 13:22:01,241 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 575 flow [2022-12-13 13:22:01,241 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2022-12-13 13:22:01,241 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2022-12-13 13:22:01,242 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 575 flow [2022-12-13 13:22:01,242 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 13:22:01,242 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:01,242 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:01,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:22:01,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1457551807, now seen corresponding path program 1 times [2022-12-13 13:22:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:01,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345448672] [2022-12-13 13:22:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:01,552 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 13:22:01,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:01,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345448672] [2022-12-13 13:22:01,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345448672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:01,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:01,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:22:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567487290] [2022-12-13 13:22:01,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:01,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:22:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:01,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:22:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:22:01,590 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 213 [2022-12-13 13:22:01,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 575 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 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 13:22:01,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:01,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 213 [2022-12-13 13:22:01,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:02,218 INFO L130 PetriNetUnfolder]: 1376/2222 cut-off events. [2022-12-13 13:22:02,219 INFO L131 PetriNetUnfolder]: For 13748/13778 co-relation queries the response was YES. [2022-12-13 13:22:02,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11145 conditions, 2222 events. 1376/2222 cut-off events. For 13748/13778 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11071 event pairs, 480 based on Foata normal form. 124/2340 useless extension candidates. Maximal degree in co-relation 11108. Up to 1344 conditions per place. [2022-12-13 13:22:02,227 INFO L137 encePairwiseOnDemand]: 203/213 looper letters, 64 selfloop transitions, 20 changer transitions 29/116 dead transitions. [2022-12-13 13:22:02,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 1276 flow [2022-12-13 13:22:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:22:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:22:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 819 transitions. [2022-12-13 13:22:02,229 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48063380281690143 [2022-12-13 13:22:02,229 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 819 transitions. [2022-12-13 13:22:02,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 819 transitions. [2022-12-13 13:22:02,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:02,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 819 transitions. [2022-12-13 13:22:02,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.375) internal successors, (819), 8 states have internal predecessors, (819), 0 states have call successors, (0), 0 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 13:22:02,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:02,232 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:02,232 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 575 flow. Second operand 8 states and 819 transitions. [2022-12-13 13:22:02,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 1276 flow [2022-12-13 13:22:02,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 116 transitions, 1165 flow, removed 51 selfloop flow, removed 6 redundant places. [2022-12-13 13:22:02,251 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 712 flow [2022-12-13 13:22:02,251 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=712, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2022-12-13 13:22:02,252 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2022-12-13 13:22:02,252 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 712 flow [2022-12-13 13:22:02,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 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 13:22:02,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:02,253 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:02,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:22:02,253 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2060460939, now seen corresponding path program 1 times [2022-12-13 13:22:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:02,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456384191] [2022-12-13 13:22:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:02,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:03,047 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 13:22:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:03,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456384191] [2022-12-13 13:22:03,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456384191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:03,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:03,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:22:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345799964] [2022-12-13 13:22:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:03,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:22:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:03,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:22:03,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:22:03,117 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 213 [2022-12-13 13:22:03,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 712 flow. Second operand has 10 states, 10 states have (on average 88.6) internal successors, (886), 10 states have internal predecessors, (886), 0 states have call successors, (0), 0 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 13:22:03,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:03,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 213 [2022-12-13 13:22:03,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:03,755 INFO L130 PetriNetUnfolder]: 1478/2444 cut-off events. [2022-12-13 13:22:03,755 INFO L131 PetriNetUnfolder]: For 13641/13667 co-relation queries the response was YES. [2022-12-13 13:22:03,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12083 conditions, 2444 events. 1478/2444 cut-off events. For 13641/13667 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12930 event pairs, 327 based on Foata normal form. 82/2520 useless extension candidates. Maximal degree in co-relation 12044. Up to 1380 conditions per place. [2022-12-13 13:22:03,764 INFO L137 encePairwiseOnDemand]: 204/213 looper letters, 81 selfloop transitions, 37 changer transitions 20/141 dead transitions. [2022-12-13 13:22:03,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 141 transitions, 1608 flow [2022-12-13 13:22:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:22:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:22:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1049 transitions. [2022-12-13 13:22:03,767 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44771660264618013 [2022-12-13 13:22:03,767 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1049 transitions. [2022-12-13 13:22:03,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1049 transitions. [2022-12-13 13:22:03,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:03,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1049 transitions. [2022-12-13 13:22:03,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.36363636363636) internal successors, (1049), 11 states have internal predecessors, (1049), 0 states have call successors, (0), 0 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 13:22:03,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 0 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 13:22:03,771 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 0 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 13:22:03,771 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 712 flow. Second operand 11 states and 1049 transitions. [2022-12-13 13:22:03,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 141 transitions, 1608 flow [2022-12-13 13:22:03,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 141 transitions, 1537 flow, removed 26 selfloop flow, removed 5 redundant places. [2022-12-13 13:22:03,792 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 995 flow [2022-12-13 13:22:03,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=995, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2022-12-13 13:22:03,793 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2022-12-13 13:22:03,793 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 995 flow [2022-12-13 13:22:03,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.6) internal successors, (886), 10 states have internal predecessors, (886), 0 states have call successors, (0), 0 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 13:22:03,794 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:03,794 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:03,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:22:03,794 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:03,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2086328176, now seen corresponding path program 1 times [2022-12-13 13:22:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:03,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687127160] [2022-12-13 13:22:03,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:04,782 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 13:22:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:04,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687127160] [2022-12-13 13:22:04,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687127160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:04,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:04,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:22:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174146196] [2022-12-13 13:22:04,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:04,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:22:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:04,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:22:04,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:22:04,848 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 213 [2022-12-13 13:22:04,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 995 flow. Second operand has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:04,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:04,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 213 [2022-12-13 13:22:04,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:05,753 INFO L130 PetriNetUnfolder]: 1928/3258 cut-off events. [2022-12-13 13:22:05,754 INFO L131 PetriNetUnfolder]: For 22899/22957 co-relation queries the response was YES. [2022-12-13 13:22:05,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17485 conditions, 3258 events. 1928/3258 cut-off events. For 22899/22957 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19007 event pairs, 250 based on Foata normal form. 124/3366 useless extension candidates. Maximal degree in co-relation 17444. Up to 1758 conditions per place. [2022-12-13 13:22:05,765 INFO L137 encePairwiseOnDemand]: 202/213 looper letters, 113 selfloop transitions, 52 changer transitions 37/205 dead transitions. [2022-12-13 13:22:05,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 205 transitions, 2625 flow [2022-12-13 13:22:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:22:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:22:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1414 transitions. [2022-12-13 13:22:05,768 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47417840375586856 [2022-12-13 13:22:05,768 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1414 transitions. [2022-12-13 13:22:05,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1414 transitions. [2022-12-13 13:22:05,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:05,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1414 transitions. [2022-12-13 13:22:05,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 101.0) internal successors, (1414), 14 states have internal predecessors, (1414), 0 states have call successors, (0), 0 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 13:22:05,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 213.0) internal successors, (3195), 15 states have internal predecessors, (3195), 0 states have call successors, (0), 0 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 13:22:05,773 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 213.0) internal successors, (3195), 15 states have internal predecessors, (3195), 0 states have call successors, (0), 0 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 13:22:05,773 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 995 flow. Second operand 14 states and 1414 transitions. [2022-12-13 13:22:05,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 205 transitions, 2625 flow [2022-12-13 13:22:05,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 205 transitions, 2515 flow, removed 50 selfloop flow, removed 5 redundant places. [2022-12-13 13:22:05,822 INFO L231 Difference]: Finished difference. Result has 97 places, 112 transitions, 1595 flow [2022-12-13 13:22:05,823 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1595, PETRI_PLACES=97, PETRI_TRANSITIONS=112} [2022-12-13 13:22:05,823 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 62 predicate places. [2022-12-13 13:22:05,823 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 1595 flow [2022-12-13 13:22:05,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:05,823 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:05,824 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:05,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:22:05,824 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:05,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1929229235, now seen corresponding path program 2 times [2022-12-13 13:22:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:05,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503173906] [2022-12-13 13:22:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:06,731 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 13:22:06,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:06,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503173906] [2022-12-13 13:22:06,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503173906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:06,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:06,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:22:06,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463865328] [2022-12-13 13:22:06,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:06,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:22:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:06,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:22:06,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:22:06,802 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 213 [2022-12-13 13:22:06,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 1595 flow. Second operand has 10 states, 10 states have (on average 91.6) internal successors, (916), 10 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:06,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:06,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 213 [2022-12-13 13:22:06,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:07,605 INFO L130 PetriNetUnfolder]: 1886/3244 cut-off events. [2022-12-13 13:22:07,605 INFO L131 PetriNetUnfolder]: For 29721/29789 co-relation queries the response was YES. [2022-12-13 13:22:07,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18783 conditions, 3244 events. 1886/3244 cut-off events. For 29721/29789 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19542 event pairs, 785 based on Foata normal form. 112/3344 useless extension candidates. Maximal degree in co-relation 18735. Up to 2412 conditions per place. [2022-12-13 13:22:07,617 INFO L137 encePairwiseOnDemand]: 204/213 looper letters, 109 selfloop transitions, 16 changer transitions 60/188 dead transitions. [2022-12-13 13:22:07,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 188 transitions, 2805 flow [2022-12-13 13:22:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:22:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:22:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions. [2022-12-13 13:22:07,619 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4637454355764215 [2022-12-13 13:22:07,619 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 889 transitions. [2022-12-13 13:22:07,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 889 transitions. [2022-12-13 13:22:07,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:07,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 889 transitions. [2022-12-13 13:22:07,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:07,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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 13:22:07,623 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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 13:22:07,623 INFO L175 Difference]: Start difference. First operand has 97 places, 112 transitions, 1595 flow. Second operand 9 states and 889 transitions. [2022-12-13 13:22:07,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 188 transitions, 2805 flow [2022-12-13 13:22:07,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 188 transitions, 2745 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-13 13:22:07,669 INFO L231 Difference]: Finished difference. Result has 101 places, 114 transitions, 1659 flow [2022-12-13 13:22:07,669 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1659, PETRI_PLACES=101, PETRI_TRANSITIONS=114} [2022-12-13 13:22:07,670 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 66 predicate places. [2022-12-13 13:22:07,670 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 114 transitions, 1659 flow [2022-12-13 13:22:07,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.6) internal successors, (916), 10 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:07,670 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:07,670 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:07,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:22:07,671 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash -466730102, now seen corresponding path program 2 times [2022-12-13 13:22:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:07,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465180068] [2022-12-13 13:22:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:08,438 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 13:22:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:08,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465180068] [2022-12-13 13:22:08,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465180068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:08,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:08,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:22:08,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454836815] [2022-12-13 13:22:08,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:08,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:22:08,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:22:08,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:22:08,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 213 [2022-12-13 13:22:08,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 114 transitions, 1659 flow. Second operand has 10 states, 10 states have (on average 92.6) internal successors, (926), 10 states have internal predecessors, (926), 0 states have call successors, (0), 0 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 13:22:08,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:08,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 213 [2022-12-13 13:22:08,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:09,164 INFO L130 PetriNetUnfolder]: 1539/2610 cut-off events. [2022-12-13 13:22:09,164 INFO L131 PetriNetUnfolder]: For 25249/25289 co-relation queries the response was YES. [2022-12-13 13:22:09,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15432 conditions, 2610 events. 1539/2610 cut-off events. For 25249/25289 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14604 event pairs, 693 based on Foata normal form. 62/2668 useless extension candidates. Maximal degree in co-relation 15381. Up to 2290 conditions per place. [2022-12-13 13:22:09,175 INFO L137 encePairwiseOnDemand]: 205/213 looper letters, 113 selfloop transitions, 19 changer transitions 16/151 dead transitions. [2022-12-13 13:22:09,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 151 transitions, 2323 flow [2022-12-13 13:22:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:22:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:22:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 793 transitions. [2022-12-13 13:22:09,177 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4653755868544601 [2022-12-13 13:22:09,177 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 793 transitions. [2022-12-13 13:22:09,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 793 transitions. [2022-12-13 13:22:09,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:09,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 793 transitions. [2022-12-13 13:22:09,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:09,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:09,180 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:09,180 INFO L175 Difference]: Start difference. First operand has 101 places, 114 transitions, 1659 flow. Second operand 8 states and 793 transitions. [2022-12-13 13:22:09,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 151 transitions, 2323 flow [2022-12-13 13:22:09,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 151 transitions, 2206 flow, removed 54 selfloop flow, removed 6 redundant places. [2022-12-13 13:22:09,246 INFO L231 Difference]: Finished difference. Result has 100 places, 114 transitions, 1616 flow [2022-12-13 13:22:09,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1616, PETRI_PLACES=100, PETRI_TRANSITIONS=114} [2022-12-13 13:22:09,246 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2022-12-13 13:22:09,247 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 114 transitions, 1616 flow [2022-12-13 13:22:09,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.6) internal successors, (926), 10 states have internal predecessors, (926), 0 states have call successors, (0), 0 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 13:22:09,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:09,247 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:09,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:22:09,247 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1242494469, now seen corresponding path program 3 times [2022-12-13 13:22:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:09,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960916360] [2022-12-13 13:22:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:09,763 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 13:22:09,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:09,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960916360] [2022-12-13 13:22:09,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960916360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:09,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:09,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:22:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522143315] [2022-12-13 13:22:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:09,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:22:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:09,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:22:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:22:09,798 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 213 [2022-12-13 13:22:09,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 114 transitions, 1616 flow. Second operand has 9 states, 9 states have (on average 92.77777777777777) internal successors, (835), 9 states have internal predecessors, (835), 0 states have call successors, (0), 0 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 13:22:09,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:09,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 213 [2022-12-13 13:22:09,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:10,417 INFO L130 PetriNetUnfolder]: 1534/2636 cut-off events. [2022-12-13 13:22:10,417 INFO L131 PetriNetUnfolder]: For 22465/22512 co-relation queries the response was YES. [2022-12-13 13:22:10,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14993 conditions, 2636 events. 1534/2636 cut-off events. For 22465/22512 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15037 event pairs, 653 based on Foata normal form. 73/2709 useless extension candidates. Maximal degree in co-relation 14943. Up to 2143 conditions per place. [2022-12-13 13:22:10,428 INFO L137 encePairwiseOnDemand]: 205/213 looper letters, 114 selfloop transitions, 21 changer transitions 19/157 dead transitions. [2022-12-13 13:22:10,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 157 transitions, 2287 flow [2022-12-13 13:22:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:22:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:22:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 798 transitions. [2022-12-13 13:22:10,430 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46830985915492956 [2022-12-13 13:22:10,430 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 798 transitions. [2022-12-13 13:22:10,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 798 transitions. [2022-12-13 13:22:10,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:10,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 798 transitions. [2022-12-13 13:22:10,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.75) internal successors, (798), 8 states have internal predecessors, (798), 0 states have call successors, (0), 0 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 13:22:10,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:10,433 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:10,433 INFO L175 Difference]: Start difference. First operand has 100 places, 114 transitions, 1616 flow. Second operand 8 states and 798 transitions. [2022-12-13 13:22:10,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 157 transitions, 2287 flow [2022-12-13 13:22:10,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 157 transitions, 2236 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 13:22:10,474 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 1667 flow [2022-12-13 13:22:10,474 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1667, PETRI_PLACES=103, PETRI_TRANSITIONS=115} [2022-12-13 13:22:10,474 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 68 predicate places. [2022-12-13 13:22:10,474 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 115 transitions, 1667 flow [2022-12-13 13:22:10,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.77777777777777) internal successors, (835), 9 states have internal predecessors, (835), 0 states have call successors, (0), 0 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 13:22:10,475 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:10,475 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:10,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:22:10,475 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:10,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1198701699, now seen corresponding path program 4 times [2022-12-13 13:22:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:10,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896786885] [2022-12-13 13:22:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:10,846 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 13:22:10,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:10,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896786885] [2022-12-13 13:22:10,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896786885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:10,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:10,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:22:10,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235692568] [2022-12-13 13:22:10,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:10,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:22:10,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:10,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:22:10,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:22:10,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 213 [2022-12-13 13:22:10,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 115 transitions, 1667 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 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 13:22:10,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:10,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 213 [2022-12-13 13:22:10,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:11,437 INFO L130 PetriNetUnfolder]: 1486/2550 cut-off events. [2022-12-13 13:22:11,438 INFO L131 PetriNetUnfolder]: For 23388/23424 co-relation queries the response was YES. [2022-12-13 13:22:11,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14625 conditions, 2550 events. 1486/2550 cut-off events. For 23388/23424 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14498 event pairs, 371 based on Foata normal form. 70/2620 useless extension candidates. Maximal degree in co-relation 14574. Up to 1424 conditions per place. [2022-12-13 13:22:11,449 INFO L137 encePairwiseOnDemand]: 204/213 looper letters, 90 selfloop transitions, 43 changer transitions 16/152 dead transitions. [2022-12-13 13:22:11,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 152 transitions, 2317 flow [2022-12-13 13:22:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:22:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:22:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 708 transitions. [2022-12-13 13:22:11,450 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47484909456740443 [2022-12-13 13:22:11,450 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 708 transitions. [2022-12-13 13:22:11,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 708 transitions. [2022-12-13 13:22:11,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:11,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 708 transitions. [2022-12-13 13:22:11,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 0 states have call successors, (0), 0 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 13:22:11,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:22:11,453 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:22:11,453 INFO L175 Difference]: Start difference. First operand has 103 places, 115 transitions, 1667 flow. Second operand 7 states and 708 transitions. [2022-12-13 13:22:11,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 152 transitions, 2317 flow [2022-12-13 13:22:11,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 152 transitions, 2255 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 13:22:11,502 INFO L231 Difference]: Finished difference. Result has 104 places, 116 transitions, 1787 flow [2022-12-13 13:22:11,502 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1787, PETRI_PLACES=104, PETRI_TRANSITIONS=116} [2022-12-13 13:22:11,503 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2022-12-13 13:22:11,503 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 116 transitions, 1787 flow [2022-12-13 13:22:11,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 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 13:22:11,503 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:11,503 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 13:22:11,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:22:11,503 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1261016082, now seen corresponding path program 1 times [2022-12-13 13:22:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:11,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130693802] [2022-12-13 13:22:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:12,056 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 13:22:12,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:12,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130693802] [2022-12-13 13:22:12,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130693802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:12,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:12,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:22:12,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283072994] [2022-12-13 13:22:12,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:12,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:22:12,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:12,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:22:12,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:22:12,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 213 [2022-12-13 13:22:12,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 116 transitions, 1787 flow. Second operand has 8 states, 8 states have (on average 86.125) internal successors, (689), 8 states have internal predecessors, (689), 0 states have call successors, (0), 0 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 13:22:12,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:12,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 213 [2022-12-13 13:22:12,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:13,233 INFO L130 PetriNetUnfolder]: 1996/3359 cut-off events. [2022-12-13 13:22:13,233 INFO L131 PetriNetUnfolder]: For 31791/31791 co-relation queries the response was YES. [2022-12-13 13:22:13,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19849 conditions, 3359 events. 1996/3359 cut-off events. For 31791/31791 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 19819 event pairs, 385 based on Foata normal form. 28/3387 useless extension candidates. Maximal degree in co-relation 19798. Up to 1834 conditions per place. [2022-12-13 13:22:13,248 INFO L137 encePairwiseOnDemand]: 200/213 looper letters, 126 selfloop transitions, 56 changer transitions 44/226 dead transitions. [2022-12-13 13:22:13,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 226 transitions, 3514 flow [2022-12-13 13:22:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:22:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:22:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1035 transitions. [2022-12-13 13:22:13,250 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44174135723431496 [2022-12-13 13:22:13,250 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1035 transitions. [2022-12-13 13:22:13,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1035 transitions. [2022-12-13 13:22:13,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:13,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1035 transitions. [2022-12-13 13:22:13,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.0909090909091) internal successors, (1035), 11 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 13:22:13,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 0 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 13:22:13,252 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 0 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 13:22:13,253 INFO L175 Difference]: Start difference. First operand has 104 places, 116 transitions, 1787 flow. Second operand 11 states and 1035 transitions. [2022-12-13 13:22:13,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 226 transitions, 3514 flow [2022-12-13 13:22:13,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 226 transitions, 3472 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-13 13:22:13,325 INFO L231 Difference]: Finished difference. Result has 113 places, 143 transitions, 2454 flow [2022-12-13 13:22:13,325 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2454, PETRI_PLACES=113, PETRI_TRANSITIONS=143} [2022-12-13 13:22:13,325 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 78 predicate places. [2022-12-13 13:22:13,325 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 143 transitions, 2454 flow [2022-12-13 13:22:13,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.125) internal successors, (689), 8 states have internal predecessors, (689), 0 states have call successors, (0), 0 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 13:22:13,325 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:13,326 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 13:22:13,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:22:13,326 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash -980458758, now seen corresponding path program 2 times [2022-12-13 13:22:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:13,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740138123] [2022-12-13 13:22:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:13,634 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 13:22:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:13,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740138123] [2022-12-13 13:22:13,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740138123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:13,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:13,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:22:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516322991] [2022-12-13 13:22:13,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:13,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:22:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:22:13,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:22:13,659 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 213 [2022-12-13 13:22:13,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 143 transitions, 2454 flow. Second operand has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 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 13:22:13,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:13,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 213 [2022-12-13 13:22:13,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:14,304 INFO L130 PetriNetUnfolder]: 1327/2320 cut-off events. [2022-12-13 13:22:14,304 INFO L131 PetriNetUnfolder]: For 28961/28984 co-relation queries the response was YES. [2022-12-13 13:22:14,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15334 conditions, 2320 events. 1327/2320 cut-off events. For 28961/28984 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13109 event pairs, 605 based on Foata normal form. 51/2371 useless extension candidates. Maximal degree in co-relation 15280. Up to 1788 conditions per place. [2022-12-13 13:22:14,315 INFO L137 encePairwiseOnDemand]: 203/213 looper letters, 123 selfloop transitions, 33 changer transitions 34/193 dead transitions. [2022-12-13 13:22:14,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 193 transitions, 3404 flow [2022-12-13 13:22:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:22:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:22:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 796 transitions. [2022-12-13 13:22:14,317 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4671361502347418 [2022-12-13 13:22:14,317 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 796 transitions. [2022-12-13 13:22:14,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 796 transitions. [2022-12-13 13:22:14,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:14,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 796 transitions. [2022-12-13 13:22:14,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 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 13:22:14,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:14,320 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:14,320 INFO L175 Difference]: Start difference. First operand has 113 places, 143 transitions, 2454 flow. Second operand 8 states and 796 transitions. [2022-12-13 13:22:14,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 193 transitions, 3404 flow [2022-12-13 13:22:14,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 193 transitions, 3269 flow, removed 67 selfloop flow, removed 3 redundant places. [2022-12-13 13:22:14,386 INFO L231 Difference]: Finished difference. Result has 119 places, 144 transitions, 2513 flow [2022-12-13 13:22:14,386 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2513, PETRI_PLACES=119, PETRI_TRANSITIONS=144} [2022-12-13 13:22:14,387 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 84 predicate places. [2022-12-13 13:22:14,387 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 144 transitions, 2513 flow [2022-12-13 13:22:14,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 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 13:22:14,387 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:14,387 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 13:22:14,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:22:14,387 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash -934762258, now seen corresponding path program 1 times [2022-12-13 13:22:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:14,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554878070] [2022-12-13 13:22:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:14,521 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 13:22:14,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:14,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554878070] [2022-12-13 13:22:14,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554878070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:14,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:14,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:22:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458360098] [2022-12-13 13:22:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:14,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:22:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:14,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:22:14,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:22:14,528 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 213 [2022-12-13 13:22:14,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 144 transitions, 2513 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 13:22:14,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:14,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 213 [2022-12-13 13:22:14,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:14,823 INFO L130 PetriNetUnfolder]: 655/1230 cut-off events. [2022-12-13 13:22:14,823 INFO L131 PetriNetUnfolder]: For 19318/19358 co-relation queries the response was YES. [2022-12-13 13:22:14,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8161 conditions, 1230 events. 655/1230 cut-off events. For 19318/19358 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6664 event pairs, 136 based on Foata normal form. 92/1317 useless extension candidates. Maximal degree in co-relation 8103. Up to 1026 conditions per place. [2022-12-13 13:22:14,829 INFO L137 encePairwiseOnDemand]: 208/213 looper letters, 136 selfloop transitions, 4 changer transitions 1/147 dead transitions. [2022-12-13 13:22:14,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 147 transitions, 2698 flow [2022-12-13 13:22:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:22:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:22:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2022-12-13 13:22:14,830 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5007824726134585 [2022-12-13 13:22:14,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2022-12-13 13:22:14,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2022-12-13 13:22:14,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:14,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2022-12-13 13:22:14,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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 13:22:14,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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 13:22:14,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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 13:22:14,831 INFO L175 Difference]: Start difference. First operand has 119 places, 144 transitions, 2513 flow. Second operand 3 states and 320 transitions. [2022-12-13 13:22:14,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 147 transitions, 2698 flow [2022-12-13 13:22:14,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 147 transitions, 2340 flow, removed 75 selfloop flow, removed 23 redundant places. [2022-12-13 13:22:14,857 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 1431 flow [2022-12-13 13:22:14,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1431, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2022-12-13 13:22:14,858 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2022-12-13 13:22:14,858 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 1431 flow [2022-12-13 13:22:14,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 13:22:14,858 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:14,858 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:14,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:22:14,858 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 469881018, now seen corresponding path program 1 times [2022-12-13 13:22:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:14,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904163669] [2022-12-13 13:22:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:14,960 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 13:22:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:14,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904163669] [2022-12-13 13:22:14,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904163669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:14,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:14,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:22:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098081389] [2022-12-13 13:22:14,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:14,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:22:14,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:14,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:22:14,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:22:14,968 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 213 [2022-12-13 13:22:14,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 1431 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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 13:22:14,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:14,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 213 [2022-12-13 13:22:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:15,163 INFO L130 PetriNetUnfolder]: 299/647 cut-off events. [2022-12-13 13:22:15,163 INFO L131 PetriNetUnfolder]: For 7178/7192 co-relation queries the response was YES. [2022-12-13 13:22:15,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 647 events. 299/647 cut-off events. For 7178/7192 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3260 event pairs, 40 based on Foata normal form. 89/731 useless extension candidates. Maximal degree in co-relation 4203. Up to 292 conditions per place. [2022-12-13 13:22:15,166 INFO L137 encePairwiseOnDemand]: 208/213 looper letters, 142 selfloop transitions, 7 changer transitions 4/158 dead transitions. [2022-12-13 13:22:15,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 158 transitions, 2510 flow [2022-12-13 13:22:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:22:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:22:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2022-12-13 13:22:15,167 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 13:22:15,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2022-12-13 13:22:15,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2022-12-13 13:22:15,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:15,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2022-12-13 13:22:15,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 13:22:15,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 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 13:22:15,168 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 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 13:22:15,168 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 1431 flow. Second operand 4 states and 426 transitions. [2022-12-13 13:22:15,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 158 transitions, 2510 flow [2022-12-13 13:22:15,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 158 transitions, 2387 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-12-13 13:22:15,181 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 1182 flow [2022-12-13 13:22:15,181 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1182, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2022-12-13 13:22:15,181 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 59 predicate places. [2022-12-13 13:22:15,181 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 1182 flow [2022-12-13 13:22:15,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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 13:22:15,181 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:15,182 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 13:22:15,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:22:15,182 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash -317121400, now seen corresponding path program 1 times [2022-12-13 13:22:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:15,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494865664] [2022-12-13 13:22:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:16,342 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 13:22:16,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:16,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494865664] [2022-12-13 13:22:16,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494865664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:16,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:16,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:22:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104630218] [2022-12-13 13:22:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:16,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:22:16,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:16,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:22:16,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:22:16,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 213 [2022-12-13 13:22:16,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 1182 flow. Second operand has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 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 13:22:16,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:16,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 213 [2022-12-13 13:22:16,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:16,838 INFO L130 PetriNetUnfolder]: 340/747 cut-off events. [2022-12-13 13:22:16,838 INFO L131 PetriNetUnfolder]: For 6744/6756 co-relation queries the response was YES. [2022-12-13 13:22:16,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4906 conditions, 747 events. 340/747 cut-off events. For 6744/6756 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3848 event pairs, 51 based on Foata normal form. 24/771 useless extension candidates. Maximal degree in co-relation 4864. Up to 484 conditions per place. [2022-12-13 13:22:16,841 INFO L137 encePairwiseOnDemand]: 205/213 looper letters, 73 selfloop transitions, 25 changer transitions 29/129 dead transitions. [2022-12-13 13:22:16,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 129 transitions, 1776 flow [2022-12-13 13:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:22:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:22:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 694 transitions. [2022-12-13 13:22:16,842 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46545942320590206 [2022-12-13 13:22:16,842 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 694 transitions. [2022-12-13 13:22:16,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 694 transitions. [2022-12-13 13:22:16,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:16,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 694 transitions. [2022-12-13 13:22:16,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 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 13:22:16,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:22:16,844 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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 13:22:16,844 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 1182 flow. Second operand 7 states and 694 transitions. [2022-12-13 13:22:16,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 129 transitions, 1776 flow [2022-12-13 13:22:16,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 129 transitions, 1704 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 13:22:16,858 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 1160 flow [2022-12-13 13:22:16,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1160, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2022-12-13 13:22:16,859 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 66 predicate places. [2022-12-13 13:22:16,859 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 1160 flow [2022-12-13 13:22:16,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 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 13:22:16,859 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:16,859 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 13:22:16,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:22:16,859 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1135810994, now seen corresponding path program 2 times [2022-12-13 13:22:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:16,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178486694] [2022-12-13 13:22:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:18,304 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 13:22:18,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:18,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178486694] [2022-12-13 13:22:18,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178486694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:18,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:18,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:22:18,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633229408] [2022-12-13 13:22:18,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:18,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:22:18,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:22:18,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:22:18,415 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 213 [2022-12-13 13:22:18,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 1160 flow. Second operand has 11 states, 11 states have (on average 91.72727272727273) internal successors, (1009), 11 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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 13:22:18,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:18,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 213 [2022-12-13 13:22:18,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:18,800 INFO L130 PetriNetUnfolder]: 257/608 cut-off events. [2022-12-13 13:22:18,800 INFO L131 PetriNetUnfolder]: For 6688/6700 co-relation queries the response was YES. [2022-12-13 13:22:18,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4039 conditions, 608 events. 257/608 cut-off events. For 6688/6700 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3126 event pairs, 63 based on Foata normal form. 18/626 useless extension candidates. Maximal degree in co-relation 3994. Up to 335 conditions per place. [2022-12-13 13:22:18,803 INFO L137 encePairwiseOnDemand]: 206/213 looper letters, 86 selfloop transitions, 20 changer transitions 15/123 dead transitions. [2022-12-13 13:22:18,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 123 transitions, 1720 flow [2022-12-13 13:22:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:22:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:22:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2022-12-13 13:22:18,804 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45800730307772564 [2022-12-13 13:22:18,804 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2022-12-13 13:22:18,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2022-12-13 13:22:18,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:18,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2022-12-13 13:22:18,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 0 states have call successors, (0), 0 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 13:22:18,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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 13:22:18,806 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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 13:22:18,807 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 1160 flow. Second operand 9 states and 878 transitions. [2022-12-13 13:22:18,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 123 transitions, 1720 flow [2022-12-13 13:22:18,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 123 transitions, 1662 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-13 13:22:18,818 INFO L231 Difference]: Finished difference. Result has 104 places, 81 transitions, 1107 flow [2022-12-13 13:22:18,818 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1107, PETRI_PLACES=104, PETRI_TRANSITIONS=81} [2022-12-13 13:22:18,819 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2022-12-13 13:22:18,819 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 81 transitions, 1107 flow [2022-12-13 13:22:18,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.72727272727273) internal successors, (1009), 11 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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 13:22:18,819 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:18,819 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 13:22:18,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:22:18,819 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash 487247736, now seen corresponding path program 3 times [2022-12-13 13:22:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:18,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942468782] [2022-12-13 13:22:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:18,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:19,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942468782] [2022-12-13 13:22:19,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942468782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:19,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:19,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:22:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552119818] [2022-12-13 13:22:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:22:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:19,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:22:19,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:22:19,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 213 [2022-12-13 13:22:19,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 81 transitions, 1107 flow. Second operand has 11 states, 11 states have (on average 91.72727272727273) internal successors, (1009), 11 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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 13:22:19,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:19,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 213 [2022-12-13 13:22:19,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:20,223 INFO L130 PetriNetUnfolder]: 214/469 cut-off events. [2022-12-13 13:22:20,223 INFO L131 PetriNetUnfolder]: For 5022/5022 co-relation queries the response was YES. [2022-12-13 13:22:20,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 469 events. 214/469 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2059 event pairs, 52 based on Foata normal form. 3/472 useless extension candidates. Maximal degree in co-relation 3158. Up to 356 conditions per place. [2022-12-13 13:22:20,225 INFO L137 encePairwiseOnDemand]: 203/213 looper letters, 67 selfloop transitions, 6 changer transitions 38/112 dead transitions. [2022-12-13 13:22:20,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 1532 flow [2022-12-13 13:22:20,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:22:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:22:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 781 transitions. [2022-12-13 13:22:20,227 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-13 13:22:20,227 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 781 transitions. [2022-12-13 13:22:20,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 781 transitions. [2022-12-13 13:22:20,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:20,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 781 transitions. [2022-12-13 13:22:20,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 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 13:22:20,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:20,229 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:20,229 INFO L175 Difference]: Start difference. First operand has 104 places, 81 transitions, 1107 flow. Second operand 8 states and 781 transitions. [2022-12-13 13:22:20,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 1532 flow [2022-12-13 13:22:20,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 112 transitions, 1475 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-12-13 13:22:20,238 INFO L231 Difference]: Finished difference. Result has 104 places, 66 transitions, 908 flow [2022-12-13 13:22:20,238 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=908, PETRI_PLACES=104, PETRI_TRANSITIONS=66} [2022-12-13 13:22:20,238 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2022-12-13 13:22:20,238 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 66 transitions, 908 flow [2022-12-13 13:22:20,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.72727272727273) internal successors, (1009), 11 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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 13:22:20,238 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:20,238 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:20,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:22:20,239 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1612012356, now seen corresponding path program 1 times [2022-12-13 13:22:20,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:20,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756707808] [2022-12-13 13:22:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:20,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:20,370 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 13:22:20,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:20,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756707808] [2022-12-13 13:22:20,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756707808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:20,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:20,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:22:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777665285] [2022-12-13 13:22:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:20,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:22:20,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:20,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:22:20,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:22:20,379 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 213 [2022-12-13 13:22:20,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 66 transitions, 908 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 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 13:22:20,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:20,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 213 [2022-12-13 13:22:20,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:20,505 INFO L130 PetriNetUnfolder]: 126/271 cut-off events. [2022-12-13 13:22:20,505 INFO L131 PetriNetUnfolder]: For 3210/3212 co-relation queries the response was YES. [2022-12-13 13:22:20,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 271 events. 126/271 cut-off events. For 3210/3212 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1069 event pairs, 14 based on Foata normal form. 20/289 useless extension candidates. Maximal degree in co-relation 1805. Up to 127 conditions per place. [2022-12-13 13:22:20,507 INFO L137 encePairwiseOnDemand]: 208/213 looper letters, 91 selfloop transitions, 10 changer transitions 2/106 dead transitions. [2022-12-13 13:22:20,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 106 transitions, 1723 flow [2022-12-13 13:22:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:22:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:22:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-12-13 13:22:20,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48450704225352115 [2022-12-13 13:22:20,508 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2022-12-13 13:22:20,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2022-12-13 13:22:20,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:20,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2022-12-13 13:22:20,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 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 13:22:20,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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 13:22:20,510 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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 13:22:20,510 INFO L175 Difference]: Start difference. First operand has 104 places, 66 transitions, 908 flow. Second operand 5 states and 516 transitions. [2022-12-13 13:22:20,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 106 transitions, 1723 flow [2022-12-13 13:22:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 1407 flow, removed 70 selfloop flow, removed 31 redundant places. [2022-12-13 13:22:20,515 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 669 flow [2022-12-13 13:22:20,515 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=669, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2022-12-13 13:22:20,516 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2022-12-13 13:22:20,516 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 669 flow [2022-12-13 13:22:20,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 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 13:22:20,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:20,516 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 13:22:20,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:22:20,516 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1205889111, now seen corresponding path program 1 times [2022-12-13 13:22:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:20,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111364260] [2022-12-13 13:22:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:20,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:21,883 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 13:22:21,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:21,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111364260] [2022-12-13 13:22:21,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111364260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:21,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:21,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 13:22:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820576326] [2022-12-13 13:22:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:21,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:22:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:22:21,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:22:21,968 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 213 [2022-12-13 13:22:21,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 669 flow. Second operand has 12 states, 12 states have (on average 89.75) internal successors, (1077), 12 states have internal predecessors, (1077), 0 states have call successors, (0), 0 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 13:22:21,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:21,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 213 [2022-12-13 13:22:21,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:22,237 INFO L130 PetriNetUnfolder]: 139/302 cut-off events. [2022-12-13 13:22:22,238 INFO L131 PetriNetUnfolder]: For 1895/1895 co-relation queries the response was YES. [2022-12-13 13:22:22,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 302 events. 139/302 cut-off events. For 1895/1895 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1144 event pairs, 26 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 1708. Up to 153 conditions per place. [2022-12-13 13:22:22,239 INFO L137 encePairwiseOnDemand]: 205/213 looper letters, 54 selfloop transitions, 5 changer transitions 30/90 dead transitions. [2022-12-13 13:22:22,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 1026 flow [2022-12-13 13:22:22,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:22:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:22:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 756 transitions. [2022-12-13 13:22:22,240 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44366197183098594 [2022-12-13 13:22:22,240 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 756 transitions. [2022-12-13 13:22:22,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 756 transitions. [2022-12-13 13:22:22,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:22,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 756 transitions. [2022-12-13 13:22:22,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 13:22:22,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:22,243 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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 13:22:22,243 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 669 flow. Second operand 8 states and 756 transitions. [2022-12-13 13:22:22,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 1026 flow [2022-12-13 13:22:22,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 970 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 13:22:22,246 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 549 flow [2022-12-13 13:22:22,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=549, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2022-12-13 13:22:22,247 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2022-12-13 13:22:22,247 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 549 flow [2022-12-13 13:22:22,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.75) internal successors, (1077), 12 states have internal predecessors, (1077), 0 states have call successors, (0), 0 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 13:22:22,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:22,247 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 13:22:22,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:22:22,247 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:22:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1209276741, now seen corresponding path program 2 times [2022-12-13 13:22:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:22,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13351652] [2022-12-13 13:22:22,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:22,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:22,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:22:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:22,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:22:22,340 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:22:22,341 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 13:22:22,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 13:22:22,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 13:22:22,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 13:22:22,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 13:22:22,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 13:22:22,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 13:22:22,343 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:22,348 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:22:22,348 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:22:22,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:22:22 BasicIcfg [2022-12-13 13:22:22,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:22:22,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:22:22,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:22:22,396 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:22:22,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:21:47" (3/4) ... [2022-12-13 13:22:22,398 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:22:22,486 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:22:22,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:22:22,487 INFO L158 Benchmark]: Toolchain (without parser) took 35651.89ms. Allocated memory was 140.5MB in the beginning and 434.1MB in the end (delta: 293.6MB). Free memory was 110.2MB in the beginning and 184.1MB in the end (delta: -73.9MB). Peak memory consumption was 222.1MB. Max. memory is 16.1GB. [2022-12-13 13:22:22,487 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 140.5MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:22:22,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.67ms. Allocated memory is still 140.5MB. Free memory was 109.8MB in the beginning and 81.3MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 13:22:22,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.63ms. Allocated memory is still 140.5MB. Free memory was 81.3MB in the beginning and 78.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:22:22,488 INFO L158 Benchmark]: Boogie Preprocessor took 22.81ms. Allocated memory is still 140.5MB. Free memory was 78.5MB in the beginning and 76.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:22:22,488 INFO L158 Benchmark]: RCFGBuilder took 612.83ms. Allocated memory is still 140.5MB. Free memory was 76.4MB in the beginning and 84.7MB in the end (delta: -8.3MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-12-13 13:22:22,489 INFO L158 Benchmark]: TraceAbstraction took 34537.94ms. Allocated memory was 140.5MB in the beginning and 434.1MB in the end (delta: 293.6MB). Free memory was 84.1MB in the beginning and 194.6MB in the end (delta: -110.6MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. [2022-12-13 13:22:22,489 INFO L158 Benchmark]: Witness Printer took 90.16ms. Allocated memory is still 434.1MB. Free memory was 194.6MB in the beginning and 184.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:22:22,491 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 140.5MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.67ms. Allocated memory is still 140.5MB. Free memory was 109.8MB in the beginning and 81.3MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.63ms. Allocated memory is still 140.5MB. Free memory was 81.3MB in the beginning and 78.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.81ms. Allocated memory is still 140.5MB. Free memory was 78.5MB in the beginning and 76.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 612.83ms. Allocated memory is still 140.5MB. Free memory was 76.4MB in the beginning and 84.7MB in the end (delta: -8.3MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34537.94ms. Allocated memory was 140.5MB in the beginning and 434.1MB in the end (delta: 293.6MB). Free memory was 84.1MB in the beginning and 194.6MB in the end (delta: -110.6MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. * Witness Printer took 90.16ms. Allocated memory is still 434.1MB. Free memory was 194.6MB in the beginning and 184.1MB in the end (delta: 10.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: 2.9s, 119 PlacesBefore, 35 PlacesAfterwards, 111 TransitionsBefore, 26 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 5276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1835, independent: 1678, independent conditional: 0, independent unconditional: 1678, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1082, independent: 1054, independent conditional: 0, independent unconditional: 1054, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1835, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 1082, unknown conditional: 0, unknown unconditional: 1082] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-3, t1873={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] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-2, t1873={5:0}, t1874={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] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t1875, ((void *)0), P2, ((void *)0))=-1, t1873={5:0}, t1874={6:0}, t1875={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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 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_p2_EAX=0, __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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 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) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 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 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 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) [L867] 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)) [L868] 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)) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: 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, 141 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: 34.4s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2191 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1863 mSDsluCounter, 1976 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1743 mSDsCounter, 906 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5535 IncrementalHoareTripleChecker+Invalid, 6441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 906 mSolverCounterUnsat, 233 mSDtfsCounter, 5535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2513occurred in iteration=18, InterpolantAutomatonStates: 187, 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.5s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 5838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 13:22:22,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70476f51-75da-4906-a8e9-ff6658861aa8/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