./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:40:31,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:40:31,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:40:31,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:40:31,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:40:31,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:40:31,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:40:31,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:40:31,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:40:31,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:40:31,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:40:31,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:40:31,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:40:31,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:40:31,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:40:31,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:40:31,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:40:31,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:40:31,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:40:31,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:40:31,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:40:31,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:40:31,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:40:31,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:40:31,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:40:31,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:40:31,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:40:31,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:40:31,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:40:31,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:40:31,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:40:31,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:40:31,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:40:31,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:40:31,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:40:31,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:40:31,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:40:31,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:40:31,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:40:31,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:40:31,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:40:31,983 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:40:32,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:40:32,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:40:32,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:40:32,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:40:32,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:40:32,026 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:40:32,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:40:32,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:40:32,027 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:40:32,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:40:32,029 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:40:32,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:40:32,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:40:32,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:40:32,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:40:32,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:40:32,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:40:32,031 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:40:32,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:40:32,031 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:40:32,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:40:32,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:40:32,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:40:32,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:40:32,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:40:32,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:40:32,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:40:32,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:40:32,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:40:32,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:40:32,035 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:40:32,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:40:32,035 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:40:32,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:40:32,036 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_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2022-11-25 15:40:32,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:40:32,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:40:32,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:40:32,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:40:32,376 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:40:32,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 15:40:35,401 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:40:35,806 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:40:35,806 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 15:40:35,822 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/data/4981937de/2728e9e3f742402483b01729c5e32ca8/FLAGf69825140 [2022-11-25 15:40:35,842 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/data/4981937de/2728e9e3f742402483b01729c5e32ca8 [2022-11-25 15:40:35,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:40:35,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:40:35,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:40:35,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:40:35,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:40:35,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:40:35" (1/1) ... [2022-11-25 15:40:35,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7ee26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:35, skipping insertion in model container [2022-11-25 15:40:35,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:40:35" (1/1) ... [2022-11-25 15:40:35,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:40:35,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:40:36,083 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_c45422de-55c5-4843-9eff-9a6378289dd9/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-25 15:40:36,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:40:36,461 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:40:36,474 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_c45422de-55c5-4843-9eff-9a6378289dd9/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-25 15:40:36,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:40:36,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:40:36,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:40:36,569 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:40:36,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36 WrapperNode [2022-11-25 15:40:36,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:40:36,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:40:36,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:40:36,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:40:36,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,653 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2022-11-25 15:40:36,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:40:36,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:40:36,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:40:36,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:40:36,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,707 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:40:36,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:40:36,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:40:36,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:40:36,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (1/1) ... [2022-11-25 15:40:36,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:40:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:40:36,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:40:36,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:40:36,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:40:36,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:40:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:40:36,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:40:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 15:40:36,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 15:40:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:40:36,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:40:36,816 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:40:37,006 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:40:37,009 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:40:37,463 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:40:37,745 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:40:37,745 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:40:37,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:40:37 BoogieIcfgContainer [2022-11-25 15:40:37,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:40:37,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:40:37,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:40:37,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:40:37,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:40:35" (1/3) ... [2022-11-25 15:40:37,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d103130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:40:37, skipping insertion in model container [2022-11-25 15:40:37,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:36" (2/3) ... [2022-11-25 15:40:37,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d103130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:40:37, skipping insertion in model container [2022-11-25 15:40:37,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:40:37" (3/3) ... [2022-11-25 15:40:37,774 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 15:40:37,784 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:40:37,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:40:37,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 15:40:37,796 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:40:37,893 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:40:37,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-11-25 15:40:38,112 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-11-25 15:40:38,112 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:40:38,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-25 15:40:38,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-11-25 15:40:38,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-11-25 15:40:38,144 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:40:38,190 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-11-25 15:40:38,201 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-11-25 15:40:38,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-11-25 15:40:38,241 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-11-25 15:40:38,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:40:38,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-25 15:40:38,245 INFO L119 LiptonReduction]: Number of co-enabled transitions 2952 [2022-11-25 15:40:44,258 INFO L134 LiptonReduction]: Checked pairs total: 7261 [2022-11-25 15:40:44,259 INFO L136 LiptonReduction]: Total number of compositions: 112 [2022-11-25 15:40:44,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:40:44,285 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;@1f30a40f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:40:44,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 15:40:44,293 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-11-25 15:40:44,294 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:40:44,294 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:44,295 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:44,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:44,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1628435328, now seen corresponding path program 1 times [2022-11-25 15:40:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:44,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821710297] [2022-11-25 15:40:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:44,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821710297] [2022-11-25 15:40:44,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821710297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:44,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:44,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:40:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697316837] [2022-11-25 15:40:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:44,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:40:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:40:44,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:44,971 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 244 [2022-11-25 15:40:44,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:44,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:44,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 244 [2022-11-25 15:40:44,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:45,755 INFO L130 PetriNetUnfolder]: 2483/3676 cut-off events. [2022-11-25 15:40:45,755 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-11-25 15:40:45,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7224 conditions, 3676 events. 2483/3676 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19822 event pairs, 593 based on Foata normal form. 0/3519 useless extension candidates. Maximal degree in co-relation 7212. Up to 2539 conditions per place. [2022-11-25 15:40:45,790 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2022-11-25 15:40:45,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 160 flow [2022-11-25 15:40:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:40:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2022-11-25 15:40:45,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5355191256830601 [2022-11-25 15:40:45,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2022-11-25 15:40:45,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2022-11-25 15:40:45,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:45,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2022-11-25 15:40:45,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:45,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:45,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:45,848 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 392 transitions. [2022-11-25 15:40:45,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 160 flow [2022-11-25 15:40:45,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:40:45,857 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-11-25 15:40:45,860 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 15:40:45,866 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 15:40:45,866 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-11-25 15:40:45,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:45,867 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:45,867 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:45,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:40:45,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1059895233, now seen corresponding path program 1 times [2022-11-25 15:40:45,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:45,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176613298] [2022-11-25 15:40:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:46,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:46,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176613298] [2022-11-25 15:40:46,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176613298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:46,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:46,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620428513] [2022-11-25 15:40:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:46,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:46,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:46,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:46,380 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2022-11-25 15:40:46,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:46,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:46,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2022-11-25 15:40:46,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:47,171 INFO L130 PetriNetUnfolder]: 3033/4528 cut-off events. [2022-11-25 15:40:47,171 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-11-25 15:40:47,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9184 conditions, 4528 events. 3033/4528 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25551 event pairs, 621 based on Foata normal form. 192/4701 useless extension candidates. Maximal degree in co-relation 9174. Up to 3353 conditions per place. [2022-11-25 15:40:47,202 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 37 selfloop transitions, 3 changer transitions 21/64 dead transitions. [2022-11-25 15:40:47,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 274 flow [2022-11-25 15:40:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:40:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:40:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-11-25 15:40:47,205 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5229508196721312 [2022-11-25 15:40:47,206 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2022-11-25 15:40:47,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2022-11-25 15:40:47,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:47,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2022-11-25 15:40:47,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:47,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:47,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:47,214 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 5 states and 638 transitions. [2022-11-25 15:40:47,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 274 flow [2022-11-25 15:40:47,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:47,218 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 87 flow [2022-11-25 15:40:47,218 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2022-11-25 15:40:47,223 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-11-25 15:40:47,223 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 87 flow [2022-11-25 15:40:47,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:47,224 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:47,224 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:47,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:40:47,226 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1502959261, now seen corresponding path program 1 times [2022-11-25 15:40:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:47,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151188496] [2022-11-25 15:40:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:47,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151188496] [2022-11-25 15:40:47,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151188496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:47,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:47,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:40:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600781483] [2022-11-25 15:40:47,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:40:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:47,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:40:47,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:40:48,013 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 244 [2022-11-25 15:40:48,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:48,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:48,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 244 [2022-11-25 15:40:48,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:48,881 INFO L130 PetriNetUnfolder]: 3267/4818 cut-off events. [2022-11-25 15:40:48,881 INFO L131 PetriNetUnfolder]: For 1751/1751 co-relation queries the response was YES. [2022-11-25 15:40:48,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11030 conditions, 4818 events. 3267/4818 cut-off events. For 1751/1751 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 26212 event pairs, 884 based on Foata normal form. 200/5015 useless extension candidates. Maximal degree in co-relation 11017. Up to 3655 conditions per place. [2022-11-25 15:40:48,920 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 33 selfloop transitions, 3 changer transitions 19/59 dead transitions. [2022-11-25 15:40:48,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 278 flow [2022-11-25 15:40:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:40:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:40:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-11-25 15:40:48,923 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5204918032786885 [2022-11-25 15:40:48,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2022-11-25 15:40:48,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2022-11-25 15:40:48,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:48,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2022-11-25 15:40:48,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:48,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:48,929 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:48,929 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 87 flow. Second operand 5 states and 635 transitions. [2022-11-25 15:40:48,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 278 flow [2022-11-25 15:40:48,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 272 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:48,955 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 109 flow [2022-11-25 15:40:48,955 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2022-11-25 15:40:48,956 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-11-25 15:40:48,957 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 109 flow [2022-11-25 15:40:48,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:48,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:48,958 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:48,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:40:48,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1083746080, now seen corresponding path program 1 times [2022-11-25 15:40:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:48,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289257305] [2022-11-25 15:40:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:49,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:49,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289257305] [2022-11-25 15:40:49,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289257305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:49,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:49,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63610850] [2022-11-25 15:40:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:49,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:49,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:49,162 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2022-11-25 15:40:49,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:49,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:49,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2022-11-25 15:40:49,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:50,231 INFO L130 PetriNetUnfolder]: 4062/5953 cut-off events. [2022-11-25 15:40:50,232 INFO L131 PetriNetUnfolder]: For 4007/4007 co-relation queries the response was YES. [2022-11-25 15:40:50,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14647 conditions, 5953 events. 4062/5953 cut-off events. For 4007/4007 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30969 event pairs, 1518 based on Foata normal form. 186/6123 useless extension candidates. Maximal degree in co-relation 14631. Up to 4729 conditions per place. [2022-11-25 15:40:50,301 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 37 selfloop transitions, 3 changer transitions 18/63 dead transitions. [2022-11-25 15:40:50,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 316 flow [2022-11-25 15:40:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:40:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:40:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2022-11-25 15:40:50,303 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5180327868852459 [2022-11-25 15:40:50,303 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2022-11-25 15:40:50,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2022-11-25 15:40:50,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:50,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2022-11-25 15:40:50,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:50,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:50,310 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:50,311 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 109 flow. Second operand 5 states and 632 transitions. [2022-11-25 15:40:50,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 316 flow [2022-11-25 15:40:50,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 310 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:50,334 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 131 flow [2022-11-25 15:40:50,334 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2022-11-25 15:40:50,336 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-11-25 15:40:50,337 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 131 flow [2022-11-25 15:40:50,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:50,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:50,338 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:50,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:40:50,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash 720614772, now seen corresponding path program 1 times [2022-11-25 15:40:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:50,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083608748] [2022-11-25 15:40:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:50,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083608748] [2022-11-25 15:40:50,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083608748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:50,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:50,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:40:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066139296] [2022-11-25 15:40:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:50,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:50,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:50,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:50,590 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2022-11-25 15:40:50,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:50,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:50,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2022-11-25 15:40:50,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:51,917 INFO L130 PetriNetUnfolder]: 5328/7775 cut-off events. [2022-11-25 15:40:51,917 INFO L131 PetriNetUnfolder]: For 8431/8438 co-relation queries the response was YES. [2022-11-25 15:40:51,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20942 conditions, 7775 events. 5328/7775 cut-off events. For 8431/8438 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 44185 event pairs, 2527 based on Foata normal form. 240/7947 useless extension candidates. Maximal degree in co-relation 20923. Up to 4156 conditions per place. [2022-11-25 15:40:51,995 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 40 selfloop transitions, 3 changer transitions 17/65 dead transitions. [2022-11-25 15:40:51,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 349 flow [2022-11-25 15:40:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:40:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:40:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2022-11-25 15:40:51,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5188524590163934 [2022-11-25 15:40:51,999 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2022-11-25 15:40:51,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2022-11-25 15:40:52,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:52,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2022-11-25 15:40:52,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:52,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:52,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:52,007 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 131 flow. Second operand 5 states and 633 transitions. [2022-11-25 15:40:52,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 349 flow [2022-11-25 15:40:52,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 338 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:52,051 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 139 flow [2022-11-25 15:40:52,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2022-11-25 15:40:52,055 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2022-11-25 15:40:52,055 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 139 flow [2022-11-25 15:40:52,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:52,056 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:52,056 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:52,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:40:52,056 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 644530797, now seen corresponding path program 1 times [2022-11-25 15:40:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:52,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846493849] [2022-11-25 15:40:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:52,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:52,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846493849] [2022-11-25 15:40:52,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846493849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:52,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:52,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:40:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725106613] [2022-11-25 15:40:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:52,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:40:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:40:52,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:40:52,964 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 244 [2022-11-25 15:40:52,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 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-11-25 15:40:52,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:52,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 244 [2022-11-25 15:40:52,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:54,380 INFO L130 PetriNetUnfolder]: 5222/7675 cut-off events. [2022-11-25 15:40:54,380 INFO L131 PetriNetUnfolder]: For 13051/13131 co-relation queries the response was YES. [2022-11-25 15:40:54,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21006 conditions, 7675 events. 5222/7675 cut-off events. For 13051/13131 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 43711 event pairs, 3211 based on Foata normal form. 280/7906 useless extension candidates. Maximal degree in co-relation 20985. Up to 5400 conditions per place. [2022-11-25 15:40:54,459 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 36 selfloop transitions, 5 changer transitions 18/64 dead transitions. [2022-11-25 15:40:54,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 367 flow [2022-11-25 15:40:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:40:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:40:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2022-11-25 15:40:54,463 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5136612021857924 [2022-11-25 15:40:54,464 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2022-11-25 15:40:54,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2022-11-25 15:40:54,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:54,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2022-11-25 15:40:54,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 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-11-25 15:40:54,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:54,475 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:54,475 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 139 flow. Second operand 6 states and 752 transitions. [2022-11-25 15:40:54,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 367 flow [2022-11-25 15:40:54,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 354 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-25 15:40:54,504 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 162 flow [2022-11-25 15:40:54,504 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2022-11-25 15:40:54,508 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2022-11-25 15:40:54,508 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 162 flow [2022-11-25 15:40:54,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 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-11-25 15:40:54,509 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:54,509 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:54,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:40:54,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1228285442, now seen corresponding path program 1 times [2022-11-25 15:40:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:54,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288405710] [2022-11-25 15:40:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:55,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:55,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288405710] [2022-11-25 15:40:55,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288405710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:55,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:55,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:40:55,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933261972] [2022-11-25 15:40:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:55,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:55,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:55,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:55,187 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2022-11-25 15:40:55,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 34 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:55,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:55,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2022-11-25 15:40:55,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:56,324 INFO L130 PetriNetUnfolder]: 4957/7458 cut-off events. [2022-11-25 15:40:56,324 INFO L131 PetriNetUnfolder]: For 15178/15242 co-relation queries the response was YES. [2022-11-25 15:40:56,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22301 conditions, 7458 events. 4957/7458 cut-off events. For 15178/15242 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 43341 event pairs, 1281 based on Foata normal form. 268/7711 useless extension candidates. Maximal degree in co-relation 22278. Up to 5587 conditions per place. [2022-11-25 15:40:56,385 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 46 selfloop transitions, 5 changer transitions 18/74 dead transitions. [2022-11-25 15:40:56,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 463 flow [2022-11-25 15:40:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:40:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:40:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2022-11-25 15:40:56,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5088797814207651 [2022-11-25 15:40:56,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2022-11-25 15:40:56,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2022-11-25 15:40:56,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:56,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2022-11-25 15:40:56,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:56,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:56,394 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:56,394 INFO L175 Difference]: Start difference. First operand has 54 places, 34 transitions, 162 flow. Second operand 6 states and 745 transitions. [2022-11-25 15:40:56,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 463 flow [2022-11-25 15:40:56,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 450 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-25 15:40:56,416 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 195 flow [2022-11-25 15:40:56,416 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2022-11-25 15:40:56,416 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2022-11-25 15:40:56,417 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 195 flow [2022-11-25 15:40:56,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:56,417 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:56,417 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:56,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:40:56,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -536983686, now seen corresponding path program 1 times [2022-11-25 15:40:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:56,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437337670] [2022-11-25 15:40:56,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:56,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:57,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:57,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437337670] [2022-11-25 15:40:57,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437337670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:57,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:57,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:40:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963309823] [2022-11-25 15:40:57,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:57,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:40:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:40:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:40:57,341 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2022-11-25 15:40:57,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:57,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:57,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2022-11-25 15:40:57,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:58,702 INFO L130 PetriNetUnfolder]: 5032/7520 cut-off events. [2022-11-25 15:40:58,703 INFO L131 PetriNetUnfolder]: For 18245/18309 co-relation queries the response was YES. [2022-11-25 15:40:58,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23728 conditions, 7520 events. 5032/7520 cut-off events. For 18245/18309 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 43728 event pairs, 703 based on Foata normal form. 168/7673 useless extension candidates. Maximal degree in co-relation 23703. Up to 4832 conditions per place. [2022-11-25 15:40:58,791 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 55 selfloop transitions, 7 changer transitions 20/87 dead transitions. [2022-11-25 15:40:58,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 547 flow [2022-11-25 15:40:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:40:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:40:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 994 transitions. [2022-11-25 15:40:58,796 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5092213114754098 [2022-11-25 15:40:58,796 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 994 transitions. [2022-11-25 15:40:58,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 994 transitions. [2022-11-25 15:40:58,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:58,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 994 transitions. [2022-11-25 15:40:58,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.25) internal successors, (994), 8 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:58,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:58,806 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:58,806 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 195 flow. Second operand 8 states and 994 transitions. [2022-11-25 15:40:58,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 547 flow [2022-11-25 15:40:58,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 526 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-11-25 15:40:58,914 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 232 flow [2022-11-25 15:40:58,914 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=232, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2022-11-25 15:40:58,922 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2022-11-25 15:40:58,922 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 232 flow [2022-11-25 15:40:58,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:58,923 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:58,923 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:58,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:40:58,923 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:40:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash 535192193, now seen corresponding path program 1 times [2022-11-25 15:40:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:58,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63507302] [2022-11-25 15:40:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:59,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63507302] [2022-11-25 15:40:59,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63507302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:59,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:59,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:40:59,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173467990] [2022-11-25 15:40:59,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:59,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:40:59,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:59,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:40:59,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:40:59,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2022-11-25 15:40:59,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:59,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:59,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2022-11-25 15:40:59,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:01,072 INFO L130 PetriNetUnfolder]: 5289/7885 cut-off events. [2022-11-25 15:41:01,072 INFO L131 PetriNetUnfolder]: For 28354/28410 co-relation queries the response was YES. [2022-11-25 15:41:01,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27136 conditions, 7885 events. 5289/7885 cut-off events. For 28354/28410 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 45992 event pairs, 1097 based on Foata normal form. 124/7994 useless extension candidates. Maximal degree in co-relation 27107. Up to 4463 conditions per place. [2022-11-25 15:41:01,139 INFO L137 encePairwiseOnDemand]: 236/244 looper letters, 60 selfloop transitions, 17 changer transitions 13/95 dead transitions. [2022-11-25 15:41:01,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 634 flow [2022-11-25 15:41:01,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:41:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:41:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 989 transitions. [2022-11-25 15:41:01,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5066598360655737 [2022-11-25 15:41:01,143 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 989 transitions. [2022-11-25 15:41:01,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 989 transitions. [2022-11-25 15:41:01,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:01,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 989 transitions. [2022-11-25 15:41:01,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.625) internal successors, (989), 8 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:01,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:01,151 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:01,151 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 232 flow. Second operand 8 states and 989 transitions. [2022-11-25 15:41:01,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 634 flow [2022-11-25 15:41:01,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 598 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-11-25 15:41:01,438 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 321 flow [2022-11-25 15:41:01,438 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2022-11-25 15:41:01,439 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2022-11-25 15:41:01,439 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 321 flow [2022-11-25 15:41:01,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:01,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:01,440 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:01,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:41:01,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:41:01,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1656524259, now seen corresponding path program 2 times [2022-11-25 15:41:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:01,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934677137] [2022-11-25 15:41:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:41:02,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:02,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934677137] [2022-11-25 15:41:02,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934677137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:02,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:02,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:41:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746583957] [2022-11-25 15:41:02,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:02,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:41:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:02,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:41:02,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:41:02,596 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2022-11-25 15:41:02,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 321 flow. Second operand has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:02,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:02,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2022-11-25 15:41:02,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:03,670 INFO L130 PetriNetUnfolder]: 5073/7581 cut-off events. [2022-11-25 15:41:03,671 INFO L131 PetriNetUnfolder]: For 24537/24585 co-relation queries the response was YES. [2022-11-25 15:41:03,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27241 conditions, 7581 events. 5073/7581 cut-off events. For 24537/24585 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 43872 event pairs, 647 based on Foata normal form. 124/7690 useless extension candidates. Maximal degree in co-relation 27211. Up to 3850 conditions per place. [2022-11-25 15:41:03,732 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 60 selfloop transitions, 12 changer transitions 13/90 dead transitions. [2022-11-25 15:41:03,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 665 flow [2022-11-25 15:41:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:41:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:41:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2022-11-25 15:41:03,736 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5064402810304449 [2022-11-25 15:41:03,736 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2022-11-25 15:41:03,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2022-11-25 15:41:03,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:03,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2022-11-25 15:41:03,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:03,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:03,743 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:03,743 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 321 flow. Second operand 7 states and 865 transitions. [2022-11-25 15:41:03,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 665 flow [2022-11-25 15:41:04,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 634 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-11-25 15:41:04,183 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 336 flow [2022-11-25 15:41:04,184 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2022-11-25 15:41:04,184 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2022-11-25 15:41:04,184 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 336 flow [2022-11-25 15:41:04,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:04,185 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:04,185 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:04,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:41:04,186 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:41:04,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:04,186 INFO L85 PathProgramCache]: Analyzing trace with hash 593530659, now seen corresponding path program 1 times [2022-11-25 15:41:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:04,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303859223] [2022-11-25 15:41:04,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:41:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:04,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303859223] [2022-11-25 15:41:04,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303859223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:04,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:04,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:41:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51711546] [2022-11-25 15:41:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:04,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:41:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:41:04,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:41:04,446 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2022-11-25 15:41:04,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:04,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:04,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2022-11-25 15:41:04,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:05,221 INFO L130 PetriNetUnfolder]: 3992/6074 cut-off events. [2022-11-25 15:41:05,221 INFO L131 PetriNetUnfolder]: For 27498/27895 co-relation queries the response was YES. [2022-11-25 15:41:05,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22676 conditions, 6074 events. 3992/6074 cut-off events. For 27498/27895 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36872 event pairs, 492 based on Foata normal form. 747/6775 useless extension candidates. Maximal degree in co-relation 22644. Up to 2949 conditions per place. [2022-11-25 15:41:05,295 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 86 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2022-11-25 15:41:05,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 888 flow [2022-11-25 15:41:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:41:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:41:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2022-11-25 15:41:05,298 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5112704918032787 [2022-11-25 15:41:05,298 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2022-11-25 15:41:05,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2022-11-25 15:41:05,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:05,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2022-11-25 15:41:05,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:05,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:05,303 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:05,303 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 336 flow. Second operand 4 states and 499 transitions. [2022-11-25 15:41:05,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 888 flow [2022-11-25 15:41:05,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 824 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-25 15:41:05,351 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 362 flow [2022-11-25 15:41:05,352 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2022-11-25 15:41:05,352 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2022-11-25 15:41:05,352 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 362 flow [2022-11-25 15:41:05,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:05,353 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:05,353 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:05,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:41:05,354 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:41:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash -564521526, now seen corresponding path program 1 times [2022-11-25 15:41:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:05,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884605270] [2022-11-25 15:41:05,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:05,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:41:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:05,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884605270] [2022-11-25 15:41:05,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884605270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:05,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:05,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:41:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872875247] [2022-11-25 15:41:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:05,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:41:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:41:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:41:05,564 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2022-11-25 15:41:05,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 362 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:05,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:05,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2022-11-25 15:41:05,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:06,244 INFO L130 PetriNetUnfolder]: 3118/4911 cut-off events. [2022-11-25 15:41:06,244 INFO L131 PetriNetUnfolder]: For 18784/19152 co-relation queries the response was YES. [2022-11-25 15:41:06,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19924 conditions, 4911 events. 3118/4911 cut-off events. For 18784/19152 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 30676 event pairs, 379 based on Foata normal form. 655/5499 useless extension candidates. Maximal degree in co-relation 19892. Up to 1807 conditions per place. [2022-11-25 15:41:06,280 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 110 selfloop transitions, 10 changer transitions 0/128 dead transitions. [2022-11-25 15:41:06,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 1113 flow [2022-11-25 15:41:06,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:41:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:41:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2022-11-25 15:41:06,283 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5131147540983606 [2022-11-25 15:41:06,283 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2022-11-25 15:41:06,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2022-11-25 15:41:06,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:06,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2022-11-25 15:41:06,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:06,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:06,289 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:06,289 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 362 flow. Second operand 5 states and 626 transitions. [2022-11-25 15:41:06,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 1113 flow [2022-11-25 15:41:06,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 128 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:41:06,343 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 435 flow [2022-11-25 15:41:06,343 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=435, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2022-11-25 15:41:06,344 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2022-11-25 15:41:06,344 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 435 flow [2022-11-25 15:41:06,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:06,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:06,345 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:06,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:41:06,345 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:41:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1950309404, now seen corresponding path program 1 times [2022-11-25 15:41:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:06,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690617724] [2022-11-25 15:41:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:41:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:07,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690617724] [2022-11-25 15:41:07,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690617724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:07,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:07,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:41:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259507935] [2022-11-25 15:41:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:07,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:41:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:07,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:41:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:41:07,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2022-11-25 15:41:07,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:07,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:07,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2022-11-25 15:41:07,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:08,909 INFO L130 PetriNetUnfolder]: 9527/14565 cut-off events. [2022-11-25 15:41:08,910 INFO L131 PetriNetUnfolder]: For 60586/61234 co-relation queries the response was YES. [2022-11-25 15:41:08,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64831 conditions, 14565 events. 9527/14565 cut-off events. For 60586/61234 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 96828 event pairs, 1310 based on Foata normal form. 632/15116 useless extension candidates. Maximal degree in co-relation 64796. Up to 7522 conditions per place. [2022-11-25 15:41:08,995 INFO L137 encePairwiseOnDemand]: 232/244 looper letters, 99 selfloop transitions, 17 changer transitions 50/169 dead transitions. [2022-11-25 15:41:08,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 169 transitions, 1604 flow [2022-11-25 15:41:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:41:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:41:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2022-11-25 15:41:09,000 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4847775175644028 [2022-11-25 15:41:09,000 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2022-11-25 15:41:09,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2022-11-25 15:41:09,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:09,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2022-11-25 15:41:09,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:09,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:09,007 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:09,007 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 435 flow. Second operand 7 states and 828 transitions. [2022-11-25 15:41:09,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 169 transitions, 1604 flow [2022-11-25 15:41:09,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 169 transitions, 1559 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-11-25 15:41:09,168 INFO L231 Difference]: Finished difference. Result has 83 places, 67 transitions, 613 flow [2022-11-25 15:41:09,168 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=613, PETRI_PLACES=83, PETRI_TRANSITIONS=67} [2022-11-25 15:41:09,169 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2022-11-25 15:41:09,169 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 67 transitions, 613 flow [2022-11-25 15:41:09,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:09,170 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:09,170 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:09,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:41:09,170 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:41:09,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:09,170 INFO L85 PathProgramCache]: Analyzing trace with hash -752627325, now seen corresponding path program 1 times [2022-11-25 15:41:09,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:09,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409549845] [2022-11-25 15:41:09,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:09,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:41:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409549845] [2022-11-25 15:41:09,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409549845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:09,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:09,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:41:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500018442] [2022-11-25 15:41:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:09,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:41:09,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:09,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:41:09,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:41:09,400 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2022-11-25 15:41:09,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 67 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:09,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:09,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2022-11-25 15:41:09,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:10,351 INFO L130 PetriNetUnfolder]: 2753/4592 cut-off events. [2022-11-25 15:41:10,351 INFO L131 PetriNetUnfolder]: For 29369/30187 co-relation queries the response was YES. [2022-11-25 15:41:10,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22407 conditions, 4592 events. 2753/4592 cut-off events. For 29369/30187 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 30245 event pairs, 204 based on Foata normal form. 821/5259 useless extension candidates. Maximal degree in co-relation 22366. Up to 1701 conditions per place. [2022-11-25 15:41:10,383 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 119 selfloop transitions, 14 changer transitions 12/156 dead transitions. [2022-11-25 15:41:10,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 156 transitions, 1675 flow [2022-11-25 15:41:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:41:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:41:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions. [2022-11-25 15:41:10,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5116120218579235 [2022-11-25 15:41:10,387 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 749 transitions. [2022-11-25 15:41:10,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions. [2022-11-25 15:41:10,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:10,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions. [2022-11-25 15:41:10,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:10,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:10,393 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:10,393 INFO L175 Difference]: Start difference. First operand has 83 places, 67 transitions, 613 flow. Second operand 6 states and 749 transitions. [2022-11-25 15:41:10,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 156 transitions, 1675 flow [2022-11-25 15:41:10,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 156 transitions, 1633 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-11-25 15:41:10,525 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 586 flow [2022-11-25 15:41:10,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=586, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2022-11-25 15:41:10,526 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2022-11-25 15:41:10,527 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 586 flow [2022-11-25 15:41:10,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:10,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:10,528 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:10,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:41:10,528 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:41:10,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1877152887, now seen corresponding path program 1 times [2022-11-25 15:41:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:10,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690356332] [2022-11-25 15:41:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:10,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:41:11,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:11,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690356332] [2022-11-25 15:41:11,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690356332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:11,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:11,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:41:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514211557] [2022-11-25 15:41:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:11,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:41:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:11,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:41:11,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:41:11,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2022-11-25 15:41:11,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 586 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:11,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:11,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2022-11-25 15:41:11,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:12,969 INFO L130 PetriNetUnfolder]: 5414/9092 cut-off events. [2022-11-25 15:41:12,970 INFO L131 PetriNetUnfolder]: For 49070/49457 co-relation queries the response was YES. [2022-11-25 15:41:13,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46998 conditions, 9092 events. 5414/9092 cut-off events. For 49070/49457 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 64226 event pairs, 233 based on Foata normal form. 298/9363 useless extension candidates. Maximal degree in co-relation 46957. Up to 3321 conditions per place. [2022-11-25 15:41:13,034 INFO L137 encePairwiseOnDemand]: 231/244 looper letters, 96 selfloop transitions, 30 changer transitions 91/220 dead transitions. [2022-11-25 15:41:13,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 220 transitions, 2418 flow [2022-11-25 15:41:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:41:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:41:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2022-11-25 15:41:13,038 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.484192037470726 [2022-11-25 15:41:13,038 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2022-11-25 15:41:13,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2022-11-25 15:41:13,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:13,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2022-11-25 15:41:13,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:13,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:13,047 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:13,047 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 586 flow. Second operand 7 states and 827 transitions. [2022-11-25 15:41:13,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 220 transitions, 2418 flow [2022-11-25 15:41:13,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 220 transitions, 2236 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-11-25 15:41:13,493 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 828 flow [2022-11-25 15:41:13,494 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=828, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2022-11-25 15:41:13,494 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2022-11-25 15:41:13,494 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 828 flow [2022-11-25 15:41:13,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:13,495 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:13,495 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:13,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:41:13,495 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:41:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1052274059, now seen corresponding path program 2 times [2022-11-25 15:41:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:13,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317594481] [2022-11-25 15:41:13,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:41:13,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:13,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317594481] [2022-11-25 15:41:13,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317594481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:13,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:13,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:41:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464408340] [2022-11-25 15:41:13,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:13,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:41:13,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:13,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:41:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:41:13,761 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2022-11-25 15:41:13,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 828 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:13,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:13,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2022-11-25 15:41:13,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:14,370 INFO L130 PetriNetUnfolder]: 1497/2715 cut-off events. [2022-11-25 15:41:14,371 INFO L131 PetriNetUnfolder]: For 18663/18960 co-relation queries the response was YES. [2022-11-25 15:41:14,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14264 conditions, 2715 events. 1497/2715 cut-off events. For 18663/18960 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 17954 event pairs, 117 based on Foata normal form. 326/2999 useless extension candidates. Maximal degree in co-relation 14227. Up to 929 conditions per place. [2022-11-25 15:41:14,398 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 53 selfloop transitions, 18 changer transitions 93/169 dead transitions. [2022-11-25 15:41:14,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 169 transitions, 2170 flow [2022-11-25 15:41:14,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:41:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:41:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 846 transitions. [2022-11-25 15:41:14,402 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4953161592505855 [2022-11-25 15:41:14,402 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 846 transitions. [2022-11-25 15:41:14,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 846 transitions. [2022-11-25 15:41:14,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:14,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 846 transitions. [2022-11-25 15:41:14,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:14,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:14,430 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:14,430 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 828 flow. Second operand 7 states and 846 transitions. [2022-11-25 15:41:14,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 169 transitions, 2170 flow [2022-11-25 15:41:14,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 169 transitions, 2006 flow, removed 40 selfloop flow, removed 11 redundant places. [2022-11-25 15:41:14,583 INFO L231 Difference]: Finished difference. Result has 82 places, 47 transitions, 411 flow [2022-11-25 15:41:14,583 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=82, PETRI_TRANSITIONS=47} [2022-11-25 15:41:14,583 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2022-11-25 15:41:14,584 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 47 transitions, 411 flow [2022-11-25 15:41:14,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:41:14,584 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:14,584 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:14,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:41:14,585 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:41:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash -857239124, now seen corresponding path program 1 times [2022-11-25 15:41:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:14,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229197868] [2022-11-25 15:41:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:41:14,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:41:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:41:14,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:41:14,741 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:41:14,743 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 15:41:14,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 15:41:14,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 15:41:14,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 15:41:14,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 15:41:14,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 15:41:14,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 15:41:14,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:41:14,752 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:14,759 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:41:14,759 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:41:14,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:41:14 BasicIcfg [2022-11-25 15:41:14,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:41:14,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:41:14,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:41:14,880 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:41:14,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:40:37" (3/4) ... [2022-11-25 15:41:14,883 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:41:15,018 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:41:15,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:41:15,021 INFO L158 Benchmark]: Toolchain (without parser) took 39172.38ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 135.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 410.0MB. Max. memory is 16.1GB. [2022-11-25 15:41:15,022 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 127.9MB. Free memory was 72.8MB in the beginning and 72.7MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:41:15,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 721.21ms. Allocated memory is still 169.9MB. Free memory was 135.0MB in the beginning and 107.4MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:41:15,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.81ms. Allocated memory is still 169.9MB. Free memory was 107.4MB in the beginning and 104.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:41:15,023 INFO L158 Benchmark]: Boogie Preprocessor took 58.24ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:41:15,023 INFO L158 Benchmark]: RCFGBuilder took 1039.18ms. Allocated memory is still 169.9MB. Free memory was 102.4MB in the beginning and 69.6MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-25 15:41:15,024 INFO L158 Benchmark]: TraceAbstraction took 37111.82ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 68.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 328.2MB. Max. memory is 16.1GB. [2022-11-25 15:41:15,024 INFO L158 Benchmark]: Witness Printer took 139.00ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 15:41:15,027 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.40ms. Allocated memory is still 127.9MB. Free memory was 72.8MB in the beginning and 72.7MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 721.21ms. Allocated memory is still 169.9MB. Free memory was 135.0MB in the beginning and 107.4MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.81ms. Allocated memory is still 169.9MB. Free memory was 107.4MB in the beginning and 104.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.24ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1039.18ms. Allocated memory is still 169.9MB. Free memory was 102.4MB in the beginning and 69.6MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 37111.82ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 68.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 328.2MB. Max. memory is 16.1GB. * Witness Printer took 139.00ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 139 PlacesBefore, 41 PlacesAfterwards, 128 TransitionsBefore, 29 TransitionsAfterwards, 2952 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 7261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3715, independent: 3527, independent conditional: 0, independent unconditional: 3527, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2087, independent: 2026, independent conditional: 0, independent unconditional: 2026, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2087, independent: 2003, independent conditional: 0, independent unconditional: 2003, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 516, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 478, dependent conditional: 0, dependent unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3715, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 2087, unknown conditional: 0, unknown unconditional: 2087] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 193, Positive conditional cache size: 0, Positive unconditional cache size: 193, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-3, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-2, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$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: 839]: 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: 835]: 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: 837]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1119 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 320 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2216 IncrementalHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 72 mSDtfsCounter, 2216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=828occurred in iteration=15, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 2192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 15:41:15,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45422de-55c5-4843-9eff-9a6378289dd9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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