./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a45428c1422efa85fd947d764edf0847add56b17c38e18f54072b18b642fedaf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:04:11,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:04:11,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:04:11,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:04:11,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:04:11,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:04:11,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:04:11,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:04:11,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:04:11,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:04:11,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:04:11,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:04:11,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:04:11,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:04:11,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:04:11,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:04:11,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:04:11,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:04:11,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:04:11,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:04:11,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:04:11,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:04:11,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:04:11,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:04:11,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:04:11,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:04:11,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:04:11,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:04:11,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:04:11,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:04:11,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:04:11,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:04:11,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:04:11,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:04:11,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:04:11,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:04:11,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:04:11,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:04:11,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:04:11,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:04:11,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:04:11,273 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 16:04:11,291 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:04:11,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:04:11,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:04:11,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:04:11,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:04:11,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:04:11,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:04:11,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:04:11,299 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:04:11,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:04:11,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:04:11,300 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:04:11,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:04:11,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:04:11,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:04:11,301 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:04:11,301 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:04:11,301 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:04:11,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:04:11,301 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:04:11,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:04:11,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:04:11,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:04:11,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:04:11,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:04:11,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:04:11,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:04:11,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:04:11,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:04:11,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:04:11,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:04:11,304 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:04:11,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:04:11,304 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:04:11,304 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_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a45428c1422efa85fd947d764edf0847add56b17c38e18f54072b18b642fedaf [2022-12-13 16:04:11,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:04:11,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:04:11,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:04:11,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:04:11,512 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:04:11,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i [2022-12-13 16:04:14,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:04:14,207 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:04:14,207 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i [2022-12-13 16:04:14,217 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/data/bd265e6ce/5d456532424e407bbed453e65e1059de/FLAG7fb07c8ee [2022-12-13 16:04:14,615 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/data/bd265e6ce/5d456532424e407bbed453e65e1059de [2022-12-13 16:04:14,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:04:14,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:04:14,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:04:14,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:04:14,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:04:14,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:14,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97d0202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14, skipping insertion in model container [2022-12-13 16:04:14,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:14,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:04:14,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:04:14,774 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_9212d86f-59d1-40de-930d-c8164dcf3560/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i[995,1008] [2022-12-13 16:04:14,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:04:14,920 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:04:14,929 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_9212d86f-59d1-40de-930d-c8164dcf3560/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i[995,1008] [2022-12-13 16:04:14,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:04:14,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:04:14,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:04:14,990 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:04:14,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14 WrapperNode [2022-12-13 16:04:14,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:04:14,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:04:14,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:04:14,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:04:14,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,026 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-12-13 16:04:15,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:04:15,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:04:15,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:04:15,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:04:15,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,052 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:04:15,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:04:15,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:04:15,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:04:15,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (1/1) ... [2022-12-13 16:04:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:04:15,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:04:15,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:04:15,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:04:15,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 16:04:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:04:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:04:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:04:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:04:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:04:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:04:15,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:04:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:04:15,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:04:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:04:15,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:04:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 16:04:15,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 16:04:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:04:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:04:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:04:15,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:04:15,122 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:04:15,236 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:04:15,237 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:04:15,662 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:04:16,194 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:04:16,194 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:04:16,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:04:16 BoogieIcfgContainer [2022-12-13 16:04:16,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:04:16,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:04:16,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:04:16,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:04:16,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:04:14" (1/3) ... [2022-12-13 16:04:16,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c75af16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:04:16, skipping insertion in model container [2022-12-13 16:04:16,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:04:14" (2/3) ... [2022-12-13 16:04:16,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c75af16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:04:16, skipping insertion in model container [2022-12-13 16:04:16,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:04:16" (3/3) ... [2022-12-13 16:04:16,203 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2022-12-13 16:04:16,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:04:16,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-12-13 16:04:16,221 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:04:16,342 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:04:16,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 207 transitions, 434 flow [2022-12-13 16:04:16,478 INFO L130 PetriNetUnfolder]: 2/203 cut-off events. [2022-12-13 16:04:16,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:04:16,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 2/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 337 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-12-13 16:04:16,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 207 transitions, 434 flow [2022-12-13 16:04:16,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 203 transitions, 418 flow [2022-12-13 16:04:16,490 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:04:16,497 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 203 transitions, 418 flow [2022-12-13 16:04:16,499 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 203 transitions, 418 flow [2022-12-13 16:04:16,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 203 transitions, 418 flow [2022-12-13 16:04:16,536 INFO L130 PetriNetUnfolder]: 2/203 cut-off events. [2022-12-13 16:04:16,536 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:04:16,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 2/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 337 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-12-13 16:04:16,540 INFO L119 LiptonReduction]: Number of co-enabled transitions 9308 [2022-12-13 16:04:36,481 INFO L134 LiptonReduction]: Checked pairs total: 42391 [2022-12-13 16:04:36,481 INFO L136 LiptonReduction]: Total number of compositions: 172 [2022-12-13 16:04:36,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:04:36,500 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@de5fdc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:04:36,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2022-12-13 16:04:36,502 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:04:36,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:04:36,502 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:04:36,503 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:04:36,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:04:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2022-12-13 16:04:36,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:04:36,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714383326] [2022-12-13 16:04:36,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:36,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:04:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:04:36,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714383326] [2022-12-13 16:04:36,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714383326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:04:36,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:04:36,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:04:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124594615] [2022-12-13 16:04:36,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:04:36,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:04:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:04:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:04:36,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:04:36,643 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 379 [2022-12-13 16:04:36,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 188 flow. Second operand has 2 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:04:36,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:04:36,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 379 [2022-12-13 16:04:36,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:04:50,646 INFO L130 PetriNetUnfolder]: 69461/91514 cut-off events. [2022-12-13 16:04:50,646 INFO L131 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2022-12-13 16:04:50,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183164 conditions, 91514 events. 69461/91514 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 6172. Compared 599903 event pairs, 69461 based on Foata normal form. 0/46768 useless extension candidates. Maximal degree in co-relation 183152. Up to 91363 conditions per place. [2022-12-13 16:04:51,128 INFO L137 encePairwiseOnDemand]: 346/379 looper letters, 49 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2022-12-13 16:04:51,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 218 flow [2022-12-13 16:04:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:04:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:04:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 388 transitions. [2022-12-13 16:04:51,140 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5118733509234829 [2022-12-13 16:04:51,140 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 388 transitions. [2022-12-13 16:04:51,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 388 transitions. [2022-12-13 16:04:51,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:04:51,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 388 transitions. [2022-12-13 16:04:51,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 194.0) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:04:51,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 379.0) internal successors, (1137), 3 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:04:51,155 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 379.0) internal successors, (1137), 3 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:04:51,156 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 188 flow. Second operand 2 states and 388 transitions. [2022-12-13 16:04:51,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 218 flow [2022-12-13 16:04:51,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 16:04:51,162 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 116 flow [2022-12-13 16:04:51,164 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=116, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2022-12-13 16:04:51,167 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2022-12-13 16:04:51,167 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 116 flow [2022-12-13 16:04:51,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:04:51,167 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:04:51,167 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 16:04:51,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:04:51,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:04:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1269452, now seen corresponding path program 1 times [2022-12-13 16:04:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:04:51,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760896339] [2022-12-13 16:04:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:04:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:51,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:04:51,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760896339] [2022-12-13 16:04:51,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760896339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:04:51,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:04:51,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:04:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195786259] [2022-12-13 16:04:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:04:51,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:04:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:04:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:04:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:04:51,376 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 379 [2022-12-13 16:04:51,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:04:51,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:04:51,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 379 [2022-12-13 16:04:51,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:01,425 INFO L130 PetriNetUnfolder]: 56678/77063 cut-off events. [2022-12-13 16:05:01,425 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:05:01,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153918 conditions, 77063 events. 56678/77063 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3450. Compared 494292 event pairs, 33903 based on Foata normal form. 0/49075 useless extension candidates. Maximal degree in co-relation 153915. Up to 44962 conditions per place. [2022-12-13 16:05:01,784 INFO L137 encePairwiseOnDemand]: 358/379 looper letters, 58 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2022-12-13 16:05:01,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 290 flow [2022-12-13 16:05:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2022-12-13 16:05:01,787 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4494283201407212 [2022-12-13 16:05:01,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2022-12-13 16:05:01,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2022-12-13 16:05:01,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:01,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2022-12-13 16:05:01,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:01,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:01,791 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:01,792 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 116 flow. Second operand 3 states and 511 transitions. [2022-12-13 16:05:01,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 290 flow [2022-12-13 16:05:01,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:05:01,793 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 204 flow [2022-12-13 16:05:01,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2022-12-13 16:05:01,794 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2022-12-13 16:05:01,794 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 204 flow [2022-12-13 16:05:01,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:01,794 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:01,795 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 16:05:01,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:05:01,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:01,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:01,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1269453, now seen corresponding path program 1 times [2022-12-13 16:05:01,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:01,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499156811] [2022-12-13 16:05:01,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:01,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:01,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:01,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499156811] [2022-12-13 16:05:01,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499156811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:01,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:01,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:05:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875691445] [2022-12-13 16:05:01,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:01,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:05:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:01,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:05:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:05:01,921 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 379 [2022-12-13 16:05:01,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:01,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:01,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 379 [2022-12-13 16:05:01,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:06,097 INFO L130 PetriNetUnfolder]: 18560/26392 cut-off events. [2022-12-13 16:05:06,097 INFO L131 PetriNetUnfolder]: For 7436/7604 co-relation queries the response was YES. [2022-12-13 16:05:06,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71524 conditions, 26392 events. 18560/26392 cut-off events. For 7436/7604 co-relation queries the response was YES. Maximal size of possible extension queue 1448. Compared 166954 event pairs, 14279 based on Foata normal form. 6111/29610 useless extension candidates. Maximal degree in co-relation 71519. Up to 24969 conditions per place. [2022-12-13 16:05:06,223 INFO L137 encePairwiseOnDemand]: 368/379 looper letters, 44 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2022-12-13 16:05:06,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 274 flow [2022-12-13 16:05:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-12-13 16:05:06,225 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4371152154793316 [2022-12-13 16:05:06,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-12-13 16:05:06,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-12-13 16:05:06,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:06,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-12-13 16:05:06,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:06,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:06,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:06,229 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 204 flow. Second operand 3 states and 497 transitions. [2022-12-13 16:05:06,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 274 flow [2022-12-13 16:05:06,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:05:06,274 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 164 flow [2022-12-13 16:05:06,274 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 16:05:06,275 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2022-12-13 16:05:06,275 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 164 flow [2022-12-13 16:05:06,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:06,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:06,275 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:06,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:05:06,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:06,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1869339986, now seen corresponding path program 1 times [2022-12-13 16:05:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:06,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128611259] [2022-12-13 16:05:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:06,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128611259] [2022-12-13 16:05:06,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128611259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:06,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:06,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:05:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715650245] [2022-12-13 16:05:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:06,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:05:06,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:05:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:05:06,445 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 379 [2022-12-13 16:05:06,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:06,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:06,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 379 [2022-12-13 16:05:06,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:10,814 INFO L130 PetriNetUnfolder]: 24669/34097 cut-off events. [2022-12-13 16:05:10,815 INFO L131 PetriNetUnfolder]: For 9980/10512 co-relation queries the response was YES. [2022-12-13 16:05:10,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86053 conditions, 34097 events. 24669/34097 cut-off events. For 9980/10512 co-relation queries the response was YES. Maximal size of possible extension queue 1691. Compared 219818 event pairs, 3786 based on Foata normal form. 170/27539 useless extension candidates. Maximal degree in co-relation 86048. Up to 29285 conditions per place. [2022-12-13 16:05:10,957 INFO L137 encePairwiseOnDemand]: 375/379 looper letters, 84 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2022-12-13 16:05:10,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 472 flow [2022-12-13 16:05:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2022-12-13 16:05:10,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45646437994722955 [2022-12-13 16:05:10,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2022-12-13 16:05:10,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2022-12-13 16:05:10,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:10,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2022-12-13 16:05:10,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:10,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:10,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:10,963 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 164 flow. Second operand 3 states and 519 transitions. [2022-12-13 16:05:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 472 flow [2022-12-13 16:05:10,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:05:10,965 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 182 flow [2022-12-13 16:05:10,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2022-12-13 16:05:10,966 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2022-12-13 16:05:10,966 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 182 flow [2022-12-13 16:05:10,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:10,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:10,966 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:10,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:05:10,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1869340333, now seen corresponding path program 1 times [2022-12-13 16:05:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:10,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863560426] [2022-12-13 16:05:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:11,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:11,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863560426] [2022-12-13 16:05:11,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863560426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:11,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:11,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:05:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099210499] [2022-12-13 16:05:11,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:11,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:05:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:05:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:05:11,096 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 379 [2022-12-13 16:05:11,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:11,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:11,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 379 [2022-12-13 16:05:11,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:15,139 INFO L130 PetriNetUnfolder]: 21936/31020 cut-off events. [2022-12-13 16:05:15,139 INFO L131 PetriNetUnfolder]: For 6772/6993 co-relation queries the response was YES. [2022-12-13 16:05:15,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82838 conditions, 31020 events. 21936/31020 cut-off events. For 6772/6993 co-relation queries the response was YES. Maximal size of possible extension queue 1546. Compared 197762 event pairs, 9831 based on Foata normal form. 0/25010 useless extension candidates. Maximal degree in co-relation 82832. Up to 19509 conditions per place. [2022-12-13 16:05:15,307 INFO L137 encePairwiseOnDemand]: 375/379 looper letters, 80 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2022-12-13 16:05:15,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 473 flow [2022-12-13 16:05:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2022-12-13 16:05:15,309 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46174142480211083 [2022-12-13 16:05:15,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2022-12-13 16:05:15,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2022-12-13 16:05:15,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:15,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2022-12-13 16:05:15,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:15,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:15,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:15,313 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 182 flow. Second operand 3 states and 525 transitions. [2022-12-13 16:05:15,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 473 flow [2022-12-13 16:05:15,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:05:15,315 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 192 flow [2022-12-13 16:05:15,315 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2022-12-13 16:05:15,315 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2022-12-13 16:05:15,315 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 192 flow [2022-12-13 16:05:15,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:15,316 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:15,316 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:15,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:05:15,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2114966691, now seen corresponding path program 1 times [2022-12-13 16:05:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:15,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189723967] [2022-12-13 16:05:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:15,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:15,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189723967] [2022-12-13 16:05:15,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189723967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:15,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:15,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:05:15,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487193562] [2022-12-13 16:05:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:15,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:05:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:15,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:05:15,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:05:15,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 379 [2022-12-13 16:05:15,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:15,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:15,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 379 [2022-12-13 16:05:15,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:20,174 INFO L130 PetriNetUnfolder]: 24919/35294 cut-off events. [2022-12-13 16:05:20,174 INFO L131 PetriNetUnfolder]: For 9828/9828 co-relation queries the response was YES. [2022-12-13 16:05:20,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96895 conditions, 35294 events. 24919/35294 cut-off events. For 9828/9828 co-relation queries the response was YES. Maximal size of possible extension queue 1802. Compared 227428 event pairs, 7937 based on Foata normal form. 0/30405 useless extension candidates. Maximal degree in co-relation 96888. Up to 16335 conditions per place. [2022-12-13 16:05:20,349 INFO L137 encePairwiseOnDemand]: 367/379 looper letters, 66 selfloop transitions, 17 changer transitions 0/86 dead transitions. [2022-12-13 16:05:20,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 458 flow [2022-12-13 16:05:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:05:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:05:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 653 transitions. [2022-12-13 16:05:20,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43073878627968337 [2022-12-13 16:05:20,351 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 653 transitions. [2022-12-13 16:05:20,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 653 transitions. [2022-12-13 16:05:20,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:20,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 653 transitions. [2022-12-13 16:05:20,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:20,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:20,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:20,355 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 192 flow. Second operand 4 states and 653 transitions. [2022-12-13 16:05:20,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 458 flow [2022-12-13 16:05:20,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:05:20,358 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 236 flow [2022-12-13 16:05:20,359 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2022-12-13 16:05:20,359 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2022-12-13 16:05:20,359 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 236 flow [2022-12-13 16:05:20,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:20,360 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:20,360 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:20,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:05:20,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1098019506, now seen corresponding path program 1 times [2022-12-13 16:05:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:20,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464088770] [2022-12-13 16:05:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:20,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:20,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464088770] [2022-12-13 16:05:20,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464088770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:20,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:20,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:05:20,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599960882] [2022-12-13 16:05:20,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:20,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:05:20,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:05:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:05:21,015 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 379 [2022-12-13 16:05:21,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:21,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:21,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 379 [2022-12-13 16:05:21,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:26,778 INFO L130 PetriNetUnfolder]: 35844/50811 cut-off events. [2022-12-13 16:05:26,778 INFO L131 PetriNetUnfolder]: For 19061/19061 co-relation queries the response was YES. [2022-12-13 16:05:26,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145370 conditions, 50811 events. 35844/50811 cut-off events. For 19061/19061 co-relation queries the response was YES. Maximal size of possible extension queue 2641. Compared 341516 event pairs, 19763 based on Foata normal form. 160/46841 useless extension candidates. Maximal degree in co-relation 145363. Up to 25681 conditions per place. [2022-12-13 16:05:27,053 INFO L137 encePairwiseOnDemand]: 373/379 looper letters, 87 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2022-12-13 16:05:27,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 578 flow [2022-12-13 16:05:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:05:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:05:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2022-12-13 16:05:27,055 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4234828496042216 [2022-12-13 16:05:27,055 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2022-12-13 16:05:27,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2022-12-13 16:05:27,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:27,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2022-12-13 16:05:27,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:27,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:27,058 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:27,058 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 236 flow. Second operand 4 states and 642 transitions. [2022-12-13 16:05:27,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 578 flow [2022-12-13 16:05:27,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 97 transitions, 553 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:05:27,102 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 251 flow [2022-12-13 16:05:27,102 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2022-12-13 16:05:27,103 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2022-12-13 16:05:27,103 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 251 flow [2022-12-13 16:05:27,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:27,103 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:27,103 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:27,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:05:27,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1488713066, now seen corresponding path program 2 times [2022-12-13 16:05:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760850539] [2022-12-13 16:05:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:27,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:27,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760850539] [2022-12-13 16:05:27,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760850539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:27,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:27,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:05:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123858113] [2022-12-13 16:05:27,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:27,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:05:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:05:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:05:27,432 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 379 [2022-12-13 16:05:27,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:27,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:27,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 379 [2022-12-13 16:05:27,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:32,980 INFO L130 PetriNetUnfolder]: 34227/48987 cut-off events. [2022-12-13 16:05:32,980 INFO L131 PetriNetUnfolder]: For 22627/22886 co-relation queries the response was YES. [2022-12-13 16:05:33,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136095 conditions, 48987 events. 34227/48987 cut-off events. For 22627/22886 co-relation queries the response was YES. Maximal size of possible extension queue 2642. Compared 337462 event pairs, 17874 based on Foata normal form. 152/41416 useless extension candidates. Maximal degree in co-relation 136087. Up to 36835 conditions per place. [2022-12-13 16:05:33,259 INFO L137 encePairwiseOnDemand]: 376/379 looper letters, 84 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2022-12-13 16:05:33,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 548 flow [2022-12-13 16:05:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:05:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:05:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions. [2022-12-13 16:05:33,262 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4287598944591029 [2022-12-13 16:05:33,262 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 650 transitions. [2022-12-13 16:05:33,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions. [2022-12-13 16:05:33,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:33,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions. [2022-12-13 16:05:33,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:33,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:33,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:33,265 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 251 flow. Second operand 4 states and 650 transitions. [2022-12-13 16:05:33,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 548 flow [2022-12-13 16:05:33,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 538 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:05:33,279 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 241 flow [2022-12-13 16:05:33,279 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2022-12-13 16:05:33,280 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -39 predicate places. [2022-12-13 16:05:33,280 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 241 flow [2022-12-13 16:05:33,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:33,280 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:33,280 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:33,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:05:33,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:33,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 945686663, now seen corresponding path program 1 times [2022-12-13 16:05:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:33,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662377487] [2022-12-13 16:05:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:33,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:33,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662377487] [2022-12-13 16:05:33,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662377487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:33,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:33,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:05:33,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482574866] [2022-12-13 16:05:33,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:33,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:05:33,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:05:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:05:33,394 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 379 [2022-12-13 16:05:33,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:33,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:33,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 379 [2022-12-13 16:05:33,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:38,780 INFO L130 PetriNetUnfolder]: 32401/46994 cut-off events. [2022-12-13 16:05:38,780 INFO L131 PetriNetUnfolder]: For 25400/25472 co-relation queries the response was YES. [2022-12-13 16:05:38,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131201 conditions, 46994 events. 32401/46994 cut-off events. For 25400/25472 co-relation queries the response was YES. Maximal size of possible extension queue 2582. Compared 335557 event pairs, 6857 based on Foata normal form. 72/39596 useless extension candidates. Maximal degree in co-relation 131194. Up to 39043 conditions per place. [2022-12-13 16:05:39,041 INFO L137 encePairwiseOnDemand]: 376/379 looper letters, 85 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2022-12-13 16:05:39,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 566 flow [2022-12-13 16:05:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2022-12-13 16:05:39,043 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44854881266490765 [2022-12-13 16:05:39,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2022-12-13 16:05:39,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2022-12-13 16:05:39,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:39,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2022-12-13 16:05:39,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:39,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:39,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:39,046 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 241 flow. Second operand 3 states and 510 transitions. [2022-12-13 16:05:39,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 566 flow [2022-12-13 16:05:39,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:05:39,049 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 245 flow [2022-12-13 16:05:39,049 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2022-12-13 16:05:39,050 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2022-12-13 16:05:39,050 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 245 flow [2022-12-13 16:05:39,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:39,050 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:39,051 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:39,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:05:39,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:39,051 INFO L85 PathProgramCache]: Analyzing trace with hash -748485804, now seen corresponding path program 1 times [2022-12-13 16:05:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:39,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87054436] [2022-12-13 16:05:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:39,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87054436] [2022-12-13 16:05:39,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87054436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:39,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:39,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:05:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309784167] [2022-12-13 16:05:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:39,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:05:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:39,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:05:39,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:05:39,339 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 379 [2022-12-13 16:05:39,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 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-12-13 16:05:39,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:39,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 379 [2022-12-13 16:05:39,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:44,869 INFO L130 PetriNetUnfolder]: 34012/48714 cut-off events. [2022-12-13 16:05:44,869 INFO L131 PetriNetUnfolder]: For 19573/19754 co-relation queries the response was YES. [2022-12-13 16:05:44,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138661 conditions, 48714 events. 34012/48714 cut-off events. For 19573/19754 co-relation queries the response was YES. Maximal size of possible extension queue 2637. Compared 336434 event pairs, 16628 based on Foata normal form. 30/41104 useless extension candidates. Maximal degree in co-relation 138653. Up to 36448 conditions per place. [2022-12-13 16:05:45,130 INFO L137 encePairwiseOnDemand]: 376/379 looper letters, 83 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2022-12-13 16:05:45,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 545 flow [2022-12-13 16:05:45,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-12-13 16:05:45,132 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4608619173262973 [2022-12-13 16:05:45,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-12-13 16:05:45,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-12-13 16:05:45,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:45,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-12-13 16:05:45,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:45,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:45,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:45,136 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 245 flow. Second operand 3 states and 524 transitions. [2022-12-13 16:05:45,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 545 flow [2022-12-13 16:05:45,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:05:45,153 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 252 flow [2022-12-13 16:05:45,153 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2022-12-13 16:05:45,154 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2022-12-13 16:05:45,154 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 252 flow [2022-12-13 16:05:45,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 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-12-13 16:05:45,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:45,154 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:45,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:05:45,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:45,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1139415726, now seen corresponding path program 1 times [2022-12-13 16:05:45,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:45,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126257943] [2022-12-13 16:05:45,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:45,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:45,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:45,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126257943] [2022-12-13 16:05:45,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126257943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:45,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:45,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:05:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683818301] [2022-12-13 16:05:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:45,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:05:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:45,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:05:45,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:05:45,369 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 379 [2022-12-13 16:05:45,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:45,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:45,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 379 [2022-12-13 16:05:45,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:50,413 INFO L130 PetriNetUnfolder]: 31295/44364 cut-off events. [2022-12-13 16:05:50,413 INFO L131 PetriNetUnfolder]: For 19811/19811 co-relation queries the response was YES. [2022-12-13 16:05:50,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129327 conditions, 44364 events. 31295/44364 cut-off events. For 19811/19811 co-relation queries the response was YES. Maximal size of possible extension queue 2395. Compared 289859 event pairs, 10565 based on Foata normal form. 60/37985 useless extension candidates. Maximal degree in co-relation 129318. Up to 19795 conditions per place. [2022-12-13 16:05:50,649 INFO L137 encePairwiseOnDemand]: 362/379 looper letters, 64 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2022-12-13 16:05:50,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 507 flow [2022-12-13 16:05:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:05:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:05:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2022-12-13 16:05:50,651 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41490765171503957 [2022-12-13 16:05:50,651 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 629 transitions. [2022-12-13 16:05:50,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 629 transitions. [2022-12-13 16:05:50,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:50,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 629 transitions. [2022-12-13 16:05:50,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:50,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:50,654 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:50,654 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 252 flow. Second operand 4 states and 629 transitions. [2022-12-13 16:05:50,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 507 flow [2022-12-13 16:05:50,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 82 transitions, 497 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:05:50,658 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 348 flow [2022-12-13 16:05:50,658 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2022-12-13 16:05:50,659 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2022-12-13 16:05:50,659 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 348 flow [2022-12-13 16:05:50,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:50,659 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:50,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:50,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:05:50,659 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash 268898207, now seen corresponding path program 1 times [2022-12-13 16:05:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739340076] [2022-12-13 16:05:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:50,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739340076] [2022-12-13 16:05:50,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739340076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:50,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:50,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:05:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396858847] [2022-12-13 16:05:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:50,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:05:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:50,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:05:50,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:05:50,745 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 379 [2022-12-13 16:05:50,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:50,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:50,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 379 [2022-12-13 16:05:50,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:57,480 INFO L130 PetriNetUnfolder]: 44839/63589 cut-off events. [2022-12-13 16:05:57,480 INFO L131 PetriNetUnfolder]: For 66334/67199 co-relation queries the response was YES. [2022-12-13 16:05:57,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202368 conditions, 63589 events. 44839/63589 cut-off events. For 66334/67199 co-relation queries the response was YES. Maximal size of possible extension queue 3206. Compared 450366 event pairs, 17460 based on Foata normal form. 543/57932 useless extension candidates. Maximal degree in co-relation 202358. Up to 36600 conditions per place. [2022-12-13 16:05:57,863 INFO L137 encePairwiseOnDemand]: 376/379 looper letters, 100 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2022-12-13 16:05:57,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 785 flow [2022-12-13 16:05:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-12-13 16:05:57,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4547053649956025 [2022-12-13 16:05:57,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2022-12-13 16:05:57,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2022-12-13 16:05:57,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:57,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2022-12-13 16:05:57,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:57,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:57,868 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:57,868 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 348 flow. Second operand 3 states and 517 transitions. [2022-12-13 16:05:57,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 785 flow [2022-12-13 16:05:58,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 778 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:05:58,061 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 355 flow [2022-12-13 16:05:58,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2022-12-13 16:05:58,062 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -32 predicate places. [2022-12-13 16:05:58,062 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 355 flow [2022-12-13 16:05:58,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:58,062 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:58,062 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:58,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:05:58,063 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:05:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1827038500, now seen corresponding path program 1 times [2022-12-13 16:05:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:58,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077309465] [2022-12-13 16:05:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:59,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:59,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077309465] [2022-12-13 16:05:59,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077309465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:59,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:59,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:05:59,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324896330] [2022-12-13 16:05:59,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:59,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:05:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:05:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:05:59,535 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 379 [2022-12-13 16:05:59,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 130.88888888888889) internal successors, (1178), 9 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:59,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:59,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 379 [2022-12-13 16:05:59,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:06:05,820 INFO L130 PetriNetUnfolder]: 37801/53886 cut-off events. [2022-12-13 16:06:05,820 INFO L131 PetriNetUnfolder]: For 44907/45003 co-relation queries the response was YES. [2022-12-13 16:06:06,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178189 conditions, 53886 events. 37801/53886 cut-off events. For 44907/45003 co-relation queries the response was YES. Maximal size of possible extension queue 3131. Compared 377049 event pairs, 9265 based on Foata normal form. 44/49414 useless extension candidates. Maximal degree in co-relation 178177. Up to 49219 conditions per place. [2022-12-13 16:06:06,187 INFO L137 encePairwiseOnDemand]: 366/379 looper letters, 110 selfloop transitions, 33 changer transitions 0/145 dead transitions. [2022-12-13 16:06:06,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 145 transitions, 1060 flow [2022-12-13 16:06:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:06:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 16:06:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1397 transitions. [2022-12-13 16:06:06,194 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3686015831134565 [2022-12-13 16:06:06,195 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1397 transitions. [2022-12-13 16:06:06,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1397 transitions. [2022-12-13 16:06:06,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:06:06,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1397 transitions. [2022-12-13 16:06:06,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 139.7) internal successors, (1397), 10 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:06,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 379.0) internal successors, (4169), 11 states have internal predecessors, (4169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:06,211 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 379.0) internal successors, (4169), 11 states have internal predecessors, (4169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:06,211 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 355 flow. Second operand 10 states and 1397 transitions. [2022-12-13 16:06:06,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 145 transitions, 1060 flow [2022-12-13 16:06:06,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 145 transitions, 1034 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 16:06:06,519 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 668 flow [2022-12-13 16:06:06,519 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=668, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2022-12-13 16:06:06,520 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -20 predicate places. [2022-12-13 16:06:06,520 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 668 flow [2022-12-13 16:06:06,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 130.88888888888889) internal successors, (1178), 9 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:06,521 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:06:06,521 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:06,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:06:06,521 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:06:06,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -962148710, now seen corresponding path program 1 times [2022-12-13 16:06:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:06,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284824757] [2022-12-13 16:06:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:06:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284824757] [2022-12-13 16:06:06,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284824757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:06:06,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:06:06,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:06:06,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542017913] [2022-12-13 16:06:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:06:06,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:06:06,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:06:06,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:06:06,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:06:06,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 379 [2022-12-13 16:06:06,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 668 flow. Second operand has 7 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:06,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:06:06,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 379 [2022-12-13 16:06:06,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:06:12,912 INFO L130 PetriNetUnfolder]: 32802/47003 cut-off events. [2022-12-13 16:06:12,913 INFO L131 PetriNetUnfolder]: For 45644/45734 co-relation queries the response was YES. [2022-12-13 16:06:13,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161481 conditions, 47003 events. 32802/47003 cut-off events. For 45644/45734 co-relation queries the response was YES. Maximal size of possible extension queue 2645. Compared 322937 event pairs, 10268 based on Foata normal form. 504/43363 useless extension candidates. Maximal degree in co-relation 161465. Up to 17697 conditions per place. [2022-12-13 16:06:13,207 INFO L137 encePairwiseOnDemand]: 361/379 looper letters, 103 selfloop transitions, 30 changer transitions 0/136 dead transitions. [2022-12-13 16:06:13,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 136 transitions, 1179 flow [2022-12-13 16:06:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:06:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:06:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2022-12-13 16:06:13,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3970976253298153 [2022-12-13 16:06:13,210 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2022-12-13 16:06:13,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2022-12-13 16:06:13,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:06:13,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2022-12-13 16:06:13,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:13,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 379.0) internal successors, (2653), 7 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:13,214 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 379.0) internal successors, (2653), 7 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:13,214 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 668 flow. Second operand 6 states and 903 transitions. [2022-12-13 16:06:13,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 136 transitions, 1179 flow [2022-12-13 16:06:15,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 136 transitions, 1160 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 16:06:15,318 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 867 flow [2022-12-13 16:06:15,318 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=867, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2022-12-13 16:06:15,318 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -15 predicate places. [2022-12-13 16:06:15,319 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 99 transitions, 867 flow [2022-12-13 16:06:15,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:15,319 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:06:15,319 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:15,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:06:15,319 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:06:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash -471996907, now seen corresponding path program 1 times [2022-12-13 16:06:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:15,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135442591] [2022-12-13 16:06:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:06:15,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135442591] [2022-12-13 16:06:15,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135442591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:06:15,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:06:15,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:06:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602693926] [2022-12-13 16:06:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:06:15,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:06:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:06:15,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:06:15,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:06:15,923 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 379 [2022-12-13 16:06:15,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 99 transitions, 867 flow. Second operand has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:15,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:06:15,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 379 [2022-12-13 16:06:15,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:06:27,677 INFO L130 PetriNetUnfolder]: 59291/85010 cut-off events. [2022-12-13 16:06:27,677 INFO L131 PetriNetUnfolder]: For 145125/145290 co-relation queries the response was YES. [2022-12-13 16:06:28,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323057 conditions, 85010 events. 59291/85010 cut-off events. For 145125/145290 co-relation queries the response was YES. Maximal size of possible extension queue 5326. Compared 640052 event pairs, 25937 based on Foata normal form. 247/76800 useless extension candidates. Maximal degree in co-relation 323039. Up to 44153 conditions per place. [2022-12-13 16:06:28,300 INFO L137 encePairwiseOnDemand]: 370/379 looper letters, 157 selfloop transitions, 34 changer transitions 0/194 dead transitions. [2022-12-13 16:06:28,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 194 transitions, 2015 flow [2022-12-13 16:06:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:06:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:06:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 805 transitions. [2022-12-13 16:06:28,302 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42480211081794195 [2022-12-13 16:06:28,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 805 transitions. [2022-12-13 16:06:28,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 805 transitions. [2022-12-13 16:06:28,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:06:28,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 805 transitions. [2022-12-13 16:06:28,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:28,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:28,306 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:28,306 INFO L175 Difference]: Start difference. First operand has 85 places, 99 transitions, 867 flow. Second operand 5 states and 805 transitions. [2022-12-13 16:06:28,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 194 transitions, 2015 flow [2022-12-13 16:06:36,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 194 transitions, 1980 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:06:36,147 INFO L231 Difference]: Finished difference. Result has 88 places, 118 transitions, 1143 flow [2022-12-13 16:06:36,148 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1143, PETRI_PLACES=88, PETRI_TRANSITIONS=118} [2022-12-13 16:06:36,148 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -12 predicate places. [2022-12-13 16:06:36,148 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 118 transitions, 1143 flow [2022-12-13 16:06:36,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:36,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:06:36,148 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:36,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:06:36,149 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:06:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1211357535, now seen corresponding path program 1 times [2022-12-13 16:06:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:36,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814175163] [2022-12-13 16:06:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:36,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:06:36,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814175163] [2022-12-13 16:06:36,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814175163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:06:36,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:06:36,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:06:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712019927] [2022-12-13 16:06:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:06:36,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:06:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:06:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:06:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:06:36,300 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 379 [2022-12-13 16:06:36,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 118 transitions, 1143 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:36,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:06:36,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 379 [2022-12-13 16:06:36,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:06:43,217 INFO L130 PetriNetUnfolder]: 33443/50701 cut-off events. [2022-12-13 16:06:43,217 INFO L131 PetriNetUnfolder]: For 101920/102696 co-relation queries the response was YES. [2022-12-13 16:06:43,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208022 conditions, 50701 events. 33443/50701 cut-off events. For 101920/102696 co-relation queries the response was YES. Maximal size of possible extension queue 3519. Compared 396329 event pairs, 11395 based on Foata normal form. 412/45519 useless extension candidates. Maximal degree in co-relation 208001. Up to 48388 conditions per place. [2022-12-13 16:06:43,584 INFO L137 encePairwiseOnDemand]: 373/379 looper letters, 122 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2022-12-13 16:06:43,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 146 transitions, 1550 flow [2022-12-13 16:06:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:06:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:06:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2022-12-13 16:06:43,586 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43799472295514513 [2022-12-13 16:06:43,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2022-12-13 16:06:43,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2022-12-13 16:06:43,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:06:43,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2022-12-13 16:06:43,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:43,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:43,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 379.0) internal successors, (1516), 4 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:43,589 INFO L175 Difference]: Start difference. First operand has 88 places, 118 transitions, 1143 flow. Second operand 3 states and 498 transitions. [2022-12-13 16:06:43,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 146 transitions, 1550 flow [2022-12-13 16:06:47,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 146 transitions, 1549 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:06:47,098 INFO L231 Difference]: Finished difference. Result has 90 places, 122 transitions, 1175 flow [2022-12-13 16:06:47,098 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=90, PETRI_TRANSITIONS=122} [2022-12-13 16:06:47,099 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -10 predicate places. [2022-12-13 16:06:47,099 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 122 transitions, 1175 flow [2022-12-13 16:06:47,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:47,099 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:06:47,099 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:47,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 16:06:47,099 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:06:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 737499899, now seen corresponding path program 1 times [2022-12-13 16:06:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:47,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650591614] [2022-12-13 16:06:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:06:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650591614] [2022-12-13 16:06:47,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650591614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:06:47,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:06:47,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:06:47,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993393888] [2022-12-13 16:06:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:06:47,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:06:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:06:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:06:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:06:47,276 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 379 [2022-12-13 16:06:47,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 122 transitions, 1175 flow. Second operand has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:47,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:06:47,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 379 [2022-12-13 16:06:47,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:06:49,998 INFO L130 PetriNetUnfolder]: 10488/17632 cut-off events. [2022-12-13 16:06:49,998 INFO L131 PetriNetUnfolder]: For 34928/35352 co-relation queries the response was YES. [2022-12-13 16:06:50,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77951 conditions, 17632 events. 10488/17632 cut-off events. For 34928/35352 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 136794 event pairs, 2523 based on Foata normal form. 444/16164 useless extension candidates. Maximal degree in co-relation 77929. Up to 15307 conditions per place. [2022-12-13 16:06:50,095 INFO L137 encePairwiseOnDemand]: 373/379 looper letters, 131 selfloop transitions, 9 changer transitions 0/156 dead transitions. [2022-12-13 16:06:50,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 156 transitions, 1557 flow [2022-12-13 16:06:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:06:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:06:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 661 transitions. [2022-12-13 16:06:50,098 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43601583113456466 [2022-12-13 16:06:50,098 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 661 transitions. [2022-12-13 16:06:50,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 661 transitions. [2022-12-13 16:06:50,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:06:50,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 661 transitions. [2022-12-13 16:06:50,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:50,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:50,101 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 379.0) internal successors, (1895), 5 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:50,101 INFO L175 Difference]: Start difference. First operand has 90 places, 122 transitions, 1175 flow. Second operand 4 states and 661 transitions. [2022-12-13 16:06:50,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 156 transitions, 1557 flow [2022-12-13 16:06:50,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 156 transitions, 1544 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 16:06:50,427 INFO L231 Difference]: Finished difference. Result has 90 places, 111 transitions, 1023 flow [2022-12-13 16:06:50,427 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1023, PETRI_PLACES=90, PETRI_TRANSITIONS=111} [2022-12-13 16:06:50,428 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -10 predicate places. [2022-12-13 16:06:50,428 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 111 transitions, 1023 flow [2022-12-13 16:06:50,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:50,428 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:06:50,429 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:50,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 16:06:50,429 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:06:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1744100153, now seen corresponding path program 1 times [2022-12-13 16:06:50,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:50,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080146664] [2022-12-13 16:06:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:50,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:06:50,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080146664] [2022-12-13 16:06:50,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080146664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:06:50,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:06:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:06:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224265313] [2022-12-13 16:06:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:06:50,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:06:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:06:50,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:06:50,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:06:50,680 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 379 [2022-12-13 16:06:50,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 111 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:50,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:06:50,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 379 [2022-12-13 16:06:50,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:06:51,856 INFO L130 PetriNetUnfolder]: 2793/4981 cut-off events. [2022-12-13 16:06:51,857 INFO L131 PetriNetUnfolder]: For 10467/10725 co-relation queries the response was YES. [2022-12-13 16:06:51,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22222 conditions, 4981 events. 2793/4981 cut-off events. For 10467/10725 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 32973 event pairs, 403 based on Foata normal form. 329/5022 useless extension candidates. Maximal degree in co-relation 22200. Up to 2138 conditions per place. [2022-12-13 16:06:51,889 INFO L137 encePairwiseOnDemand]: 373/379 looper letters, 128 selfloop transitions, 13 changer transitions 1/154 dead transitions. [2022-12-13 16:06:51,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 154 transitions, 1460 flow [2022-12-13 16:06:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:06:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:06:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2022-12-13 16:06:51,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43324538258575196 [2022-12-13 16:06:51,893 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2022-12-13 16:06:51,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2022-12-13 16:06:51,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:06:51,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2022-12-13 16:06:51,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 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-12-13 16:06:51,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:51,899 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:51,900 INFO L175 Difference]: Start difference. First operand has 90 places, 111 transitions, 1023 flow. Second operand 5 states and 821 transitions. [2022-12-13 16:06:51,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 154 transitions, 1460 flow [2022-12-13 16:06:51,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 154 transitions, 1392 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-13 16:06:51,948 INFO L231 Difference]: Finished difference. Result has 89 places, 97 transitions, 804 flow [2022-12-13 16:06:51,948 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=804, PETRI_PLACES=89, PETRI_TRANSITIONS=97} [2022-12-13 16:06:51,949 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -11 predicate places. [2022-12-13 16:06:51,949 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 97 transitions, 804 flow [2022-12-13 16:06:51,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:51,949 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:06:51,949 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-12-13 16:06:51,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 16:06:51,949 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:06:51,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash 625563363, now seen corresponding path program 1 times [2022-12-13 16:06:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:51,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143699923] [2022-12-13 16:06:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:52,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:06:52,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143699923] [2022-12-13 16:06:52,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143699923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:06:52,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:06:52,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:06:52,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396748679] [2022-12-13 16:06:52,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:06:52,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:06:52,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:06:52,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:06:52,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:06:52,249 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 379 [2022-12-13 16:06:52,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 97 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:52,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:06:52,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 379 [2022-12-13 16:06:52,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:06:53,243 INFO L130 PetriNetUnfolder]: 1989/3211 cut-off events. [2022-12-13 16:06:53,243 INFO L131 PetriNetUnfolder]: For 7403/7643 co-relation queries the response was YES. [2022-12-13 16:06:53,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14197 conditions, 3211 events. 1989/3211 cut-off events. For 7403/7643 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 18731 event pairs, 229 based on Foata normal form. 173/3324 useless extension candidates. Maximal degree in co-relation 14176. Up to 1186 conditions per place. [2022-12-13 16:06:53,266 INFO L137 encePairwiseOnDemand]: 373/379 looper letters, 90 selfloop transitions, 17 changer transitions 1/116 dead transitions. [2022-12-13 16:06:53,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 116 transitions, 961 flow [2022-12-13 16:06:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:06:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:06:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 963 transitions. [2022-12-13 16:06:53,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4234828496042216 [2022-12-13 16:06:53,270 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 963 transitions. [2022-12-13 16:06:53,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 963 transitions. [2022-12-13 16:06:53,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:06:53,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 963 transitions. [2022-12-13 16:06:53,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:53,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 379.0) internal successors, (2653), 7 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:53,277 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 379.0) internal successors, (2653), 7 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:53,277 INFO L175 Difference]: Start difference. First operand has 89 places, 97 transitions, 804 flow. Second operand 6 states and 963 transitions. [2022-12-13 16:06:53,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 116 transitions, 961 flow [2022-12-13 16:06:53,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 116 transitions, 875 flow, removed 17 selfloop flow, removed 14 redundant places. [2022-12-13 16:06:53,339 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 376 flow [2022-12-13 16:06:53,340 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2022-12-13 16:06:53,340 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2022-12-13 16:06:53,340 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 376 flow [2022-12-13 16:06:53,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:06:53,340 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:06:53,341 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-12-13 16:06:53,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 16:06:53,341 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:06:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1945395311, now seen corresponding path program 1 times [2022-12-13 16:06:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:53,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694419953] [2022-12-13 16:06:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:06:53,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:06:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:06:53,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:06:53,591 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:06:53,592 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2022-12-13 16:06:53,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2022-12-13 16:06:53,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2022-12-13 16:06:53,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2022-12-13 16:06:53,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2022-12-13 16:06:53,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2022-12-13 16:06:53,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2022-12-13 16:06:53,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2022-12-13 16:06:53,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2022-12-13 16:06:53,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2022-12-13 16:06:53,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2022-12-13 16:06:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2022-12-13 16:06:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2022-12-13 16:06:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2022-12-13 16:06:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2022-12-13 16:06:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2022-12-13 16:06:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2022-12-13 16:06:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2022-12-13 16:06:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2022-12-13 16:06:53,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2022-12-13 16:06:53,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2022-12-13 16:06:53,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2022-12-13 16:06:53,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2022-12-13 16:06:53,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2022-12-13 16:06:53,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2022-12-13 16:06:53,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2022-12-13 16:06:53,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2022-12-13 16:06:53,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2022-12-13 16:06:53,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2022-12-13 16:06:53,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (32 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2022-12-13 16:06:53,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2022-12-13 16:06:53,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2022-12-13 16:06:53,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2022-12-13 16:06:53,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2022-12-13 16:06:53,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2022-12-13 16:06:53,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2022-12-13 16:06:53,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2022-12-13 16:06:53,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2022-12-13 16:06:53,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2022-12-13 16:06:53,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2022-12-13 16:06:53,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 16:06:53,604 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:53,610 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:06:53,610 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:06:53,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:06:53 BasicIcfg [2022-12-13 16:06:53,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:06:53,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:06:53,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:06:53,683 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:06:53,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:04:16" (3/4) ... [2022-12-13 16:06:53,685 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:06:53,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:06:53,686 INFO L158 Benchmark]: Toolchain (without parser) took 159065.14ms. Allocated memory was 151.0MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 113.9MB in the beginning and 814.7MB in the end (delta: -700.8MB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2022-12-13 16:06:53,686 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:06:53,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.40ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 85.0MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 16:06:53,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 151.0MB. Free memory was 85.0MB in the beginning and 81.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:06:53,686 INFO L158 Benchmark]: Boogie Preprocessor took 33.57ms. Allocated memory is still 151.0MB. Free memory was 81.9MB in the beginning and 79.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:06:53,687 INFO L158 Benchmark]: RCFGBuilder took 1135.32ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 79.4MB in the beginning and 140.6MB in the end (delta: -61.2MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2022-12-13 16:06:53,687 INFO L158 Benchmark]: TraceAbstraction took 157484.77ms. Allocated memory was 182.5MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 140.6MB in the beginning and 815.7MB in the end (delta: -675.1MB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2022-12-13 16:06:53,687 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 5.0GB. Free memory was 815.7MB in the beginning and 814.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:06:53,688 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.18ms. Allocated memory is still 151.0MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.40ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 85.0MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 151.0MB. Free memory was 85.0MB in the beginning and 81.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.57ms. Allocated memory is still 151.0MB. Free memory was 81.9MB in the beginning and 79.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1135.32ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 79.4MB in the beginning and 140.6MB in the end (delta: -61.2MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. * TraceAbstraction took 157484.77ms. Allocated memory was 182.5MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 140.6MB in the beginning and 815.7MB in the end (delta: -675.1MB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 5.0GB. Free memory was 815.7MB in the beginning and 814.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.0s, 214 PlacesBefore, 100 PlacesAfterwards, 203 TransitionsBefore, 88 TransitionsAfterwards, 9308 CoEnabledTransitionPairs, 7 FixpointIterations, 78 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 172 TotalNumberOfCompositions, 42391 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11286, independent: 10584, independent conditional: 0, independent unconditional: 10584, dependent: 702, dependent conditional: 0, dependent unconditional: 702, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3763, independent: 3666, independent conditional: 0, independent unconditional: 3666, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11286, independent: 6918, independent conditional: 0, independent unconditional: 6918, dependent: 605, dependent conditional: 0, dependent unconditional: 605, unknown: 3763, unknown conditional: 0, unknown unconditional: 3763] , Statistics on independence cache: Total cache size (in pairs): 611, Positive cache size: 558, Positive conditional cache size: 0, Positive unconditional cache size: 558, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2145, ((void *)0), P0, ((void *)0))=2, t2145={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2146; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={4:0}, t2146={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2146, ((void *)0), P1, ((void *)0))=3, t2145={4:0}, t2146={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2147; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={4:0}, t2146={6:0}, t2147={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2147, ((void *)0), P2, ((void *)0))=4, t2145={4:0}, t2146={6:0}, t2147={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2148; [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2148, ((void *)0), P3, ((void *)0))=5, t2145={4:0}, t2146={6:0}, t2147={7:0}, t2148={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] EXPR 1 \read(y) [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=1, main$tmp_guard1=0, t2145={4:0}, t2146={6:0}, t2147={7:0}, t2148={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 266 locations, 88 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: 157.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 131.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1753 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1308 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3163 IncrementalHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 127 mSDtfsCounter, 3163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1175occurred in iteration=16, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 2208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:06:53,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a45428c1422efa85fd947d764edf0847add56b17c38e18f54072b18b642fedaf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:06:55,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:06:55,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:06:55,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:06:55,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:06:55,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:06:55,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:06:55,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:06:55,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:06:55,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:06:55,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:06:55,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:06:55,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:06:55,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:06:55,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:06:55,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:06:55,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:06:55,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:06:55,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:06:55,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:06:55,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:06:55,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:06:55,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:06:55,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:06:55,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:06:55,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:06:55,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:06:55,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:06:55,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:06:55,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:06:55,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:06:55,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:06:55,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:06:55,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:06:55,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:06:55,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:06:55,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:06:55,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:06:55,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:06:55,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:06:55,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:06:55,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 16:06:55,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:06:55,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:06:55,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:06:55,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:06:55,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:06:55,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:06:55,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:06:55,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:06:55,671 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:06:55,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:06:55,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:06:55,671 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:06:55,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:06:55,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:06:55,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:06:55,672 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:06:55,672 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:06:55,672 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:06:55,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:06:55,672 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:06:55,672 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:06:55,673 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:06:55,673 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:06:55,673 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:06:55,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:06:55,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:06:55,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:06:55,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:06:55,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:06:55,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:06:55,674 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:06:55,674 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:06:55,674 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:06:55,674 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:06:55,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:06:55,674 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:06:55,674 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:06:55,674 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_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a45428c1422efa85fd947d764edf0847add56b17c38e18f54072b18b642fedaf [2022-12-13 16:06:55,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:06:55,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:06:55,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:06:55,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:06:55,912 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:06:55,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i [2022-12-13 16:06:58,526 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:06:58,731 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:06:58,732 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i [2022-12-13 16:06:58,748 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/data/e3619de06/640d7a11270248098fa0736108b626a7/FLAG2a5007cb6 [2022-12-13 16:06:58,759 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/data/e3619de06/640d7a11270248098fa0736108b626a7 [2022-12-13 16:06:58,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:06:58,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:06:58,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:06:58,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:06:58,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:06:58,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:06:58" (1/1) ... [2022-12-13 16:06:58,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ece3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:58, skipping insertion in model container [2022-12-13 16:06:58,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:06:58" (1/1) ... [2022-12-13 16:06:58,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:06:58,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:06:58,928 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_9212d86f-59d1-40de-930d-c8164dcf3560/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i[995,1008] [2022-12-13 16:06:59,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:06:59,079 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:06:59,089 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_9212d86f-59d1-40de-930d-c8164dcf3560/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i[995,1008] [2022-12-13 16:06:59,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:06:59,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:06:59,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:06:59,151 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:06:59,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59 WrapperNode [2022-12-13 16:06:59,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:06:59,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:06:59,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:06:59,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:06:59,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,193 INFO L138 Inliner]: procedures = 181, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2022-12-13 16:06:59,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:06:59,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:06:59,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:06:59,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:06:59,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,214 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:06:59,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:06:59,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:06:59,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:06:59,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (1/1) ... [2022-12-13 16:06:59,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:06:59,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:06:59,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:06:59,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 16:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 16:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:06:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 16:06:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:06:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:06:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:06:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:06:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:06:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:06:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 16:06:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 16:06:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:06:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:06:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:06:59,269 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:06:59,408 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:06:59,409 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:07:00,001 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:07:00,604 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:07:00,604 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:07:00,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:07:00 BoogieIcfgContainer [2022-12-13 16:07:00,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:07:00,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:07:00,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:07:00,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:07:00,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:06:58" (1/3) ... [2022-12-13 16:07:00,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc713a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:07:00, skipping insertion in model container [2022-12-13 16:07:00,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:06:59" (2/3) ... [2022-12-13 16:07:00,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc713a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:07:00, skipping insertion in model container [2022-12-13 16:07:00,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:07:00" (3/3) ... [2022-12-13 16:07:00,613 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2022-12-13 16:07:00,627 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:07:00,627 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-12-13 16:07:00,628 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:07:00,758 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:07:00,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 208 transitions, 436 flow [2022-12-13 16:07:00,893 INFO L130 PetriNetUnfolder]: 2/204 cut-off events. [2022-12-13 16:07:00,894 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:07:00,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 2/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 314 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-12-13 16:07:00,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 208 transitions, 436 flow [2022-12-13 16:07:00,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 204 transitions, 420 flow [2022-12-13 16:07:00,910 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:07:00,920 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 204 transitions, 420 flow [2022-12-13 16:07:00,923 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 204 transitions, 420 flow [2022-12-13 16:07:00,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 204 transitions, 420 flow [2022-12-13 16:07:00,985 INFO L130 PetriNetUnfolder]: 2/204 cut-off events. [2022-12-13 16:07:00,985 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:07:00,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 2/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 314 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-12-13 16:07:00,991 INFO L119 LiptonReduction]: Number of co-enabled transitions 9308 [2022-12-13 16:07:09,716 WARN L233 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 222 DAG size of output: 220 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 16:07:51,167 INFO L134 LiptonReduction]: Checked pairs total: 48009 [2022-12-13 16:07:51,167 INFO L136 LiptonReduction]: Total number of compositions: 170 [2022-12-13 16:07:51,179 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:07:51,183 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@478a371, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:07:51,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2022-12-13 16:07:51,185 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:07:51,185 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:07:51,185 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:51,185 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:07:51,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:07:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2022-12-13 16:07:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:07:51,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957534490] [2022-12-13 16:07:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:51,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:07:51,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:07:51,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:07:51,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 16:07:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:51,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 16:07:51,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:07:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:51,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:07:51,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:07:51,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957534490] [2022-12-13 16:07:51,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957534490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:51,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:51,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:07:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099063162] [2022-12-13 16:07:51,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:51,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:07:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:07:51,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:07:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:07:51,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 378 [2022-12-13 16:07:51,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 188 flow. Second operand has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:51,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:51,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 378 [2022-12-13 16:07:51,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:08:04,884 INFO L130 PetriNetUnfolder]: 69461/91513 cut-off events. [2022-12-13 16:08:04,884 INFO L131 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2022-12-13 16:08:05,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183163 conditions, 91513 events. 69461/91513 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 6115. Compared 599357 event pairs, 69461 based on Foata normal form. 0/46827 useless extension candidates. Maximal degree in co-relation 183151. Up to 91363 conditions per place. [2022-12-13 16:08:05,339 INFO L137 encePairwiseOnDemand]: 345/378 looper letters, 49 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2022-12-13 16:08:05,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 218 flow [2022-12-13 16:08:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:08:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:08:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 390 transitions. [2022-12-13 16:08:05,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2022-12-13 16:08:05,352 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 390 transitions. [2022-12-13 16:08:05,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 390 transitions. [2022-12-13 16:08:05,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:08:05,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 390 transitions. [2022-12-13 16:08:05,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 195.0) internal successors, (390), 2 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:05,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:05,361 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:05,363 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 188 flow. Second operand 2 states and 390 transitions. [2022-12-13 16:08:05,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 218 flow [2022-12-13 16:08:05,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 16:08:05,373 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 116 flow [2022-12-13 16:08:05,375 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=116, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2022-12-13 16:08:05,378 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2022-12-13 16:08:05,378 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 116 flow [2022-12-13 16:08:05,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:05,378 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:08:05,378 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 16:08:05,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:08:05,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:05,580 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:08:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1268618, now seen corresponding path program 1 times [2022-12-13 16:08:05,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:05,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918569719] [2022-12-13 16:08:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:05,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:05,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:05,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:08:05,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 16:08:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:05,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:08:05,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:08:05,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:05,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 16:08:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:08:05,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:08:05,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:08:05,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918569719] [2022-12-13 16:08:05,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918569719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:08:05,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:08:05,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:08:05,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261628701] [2022-12-13 16:08:05,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:08:05,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:08:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:08:05,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:08:05,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:08:05,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 378 [2022-12-13 16:08:05,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:05,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:08:05,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 378 [2022-12-13 16:08:05,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:08:11,279 INFO L130 PetriNetUnfolder]: 23371/31209 cut-off events. [2022-12-13 16:08:11,279 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:08:11,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62514 conditions, 31209 events. 23371/31209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1789. Compared 182540 event pairs, 23371 based on Foata normal form. 1284/21194 useless extension candidates. Maximal degree in co-relation 62511. Up to 31124 conditions per place. [2022-12-13 16:08:11,424 INFO L137 encePairwiseOnDemand]: 367/378 looper letters, 39 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2022-12-13 16:08:11,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 176 flow [2022-12-13 16:08:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:08:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:08:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2022-12-13 16:08:11,427 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4462081128747795 [2022-12-13 16:08:11,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2022-12-13 16:08:11,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2022-12-13 16:08:11,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:08:11,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2022-12-13 16:08:11,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:11,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:11,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:11,431 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 116 flow. Second operand 3 states and 506 transitions. [2022-12-13 16:08:11,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 176 flow [2022-12-13 16:08:11,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:08:11,432 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2022-12-13 16:08:11,432 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-13 16:08:11,432 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2022-12-13 16:08:11,433 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2022-12-13 16:08:11,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:11,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:08:11,433 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 16:08:11,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 16:08:11,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:11,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:08:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1268617, now seen corresponding path program 1 times [2022-12-13 16:08:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:11,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809811368] [2022-12-13 16:08:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:11,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:11,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:11,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:08:11,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 16:08:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:11,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:08:11,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:08:11,780 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 16:08:11,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 16:08:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:08:11,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:08:11,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:08:11,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809811368] [2022-12-13 16:08:11,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809811368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:08:11,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:08:11,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:08:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967855772] [2022-12-13 16:08:11,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:08:11,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:08:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:08:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:08:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:08:11,875 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 378 [2022-12-13 16:08:11,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:11,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:08:11,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 378 [2022-12-13 16:08:11,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:08:14,204 INFO L130 PetriNetUnfolder]: 11666/15760 cut-off events. [2022-12-13 16:08:14,204 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:08:14,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31586 conditions, 15760 events. 11666/15760 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 84806 event pairs, 5716 based on Foata normal form. 270/12165 useless extension candidates. Maximal degree in co-relation 31582. Up to 11702 conditions per place. [2022-12-13 16:08:14,274 INFO L137 encePairwiseOnDemand]: 366/378 looper letters, 46 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-12-13 16:08:14,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 208 flow [2022-12-13 16:08:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:08:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:08:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-12-13 16:08:14,276 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4426807760141093 [2022-12-13 16:08:14,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-12-13 16:08:14,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-12-13 16:08:14,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:08:14,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-12-13 16:08:14,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:14,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:14,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:14,280 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 3 states and 502 transitions. [2022-12-13 16:08:14,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 208 flow [2022-12-13 16:08:14,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:08:14,281 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 111 flow [2022-12-13 16:08:14,281 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-12-13 16:08:14,282 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2022-12-13 16:08:14,282 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 111 flow [2022-12-13 16:08:14,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:14,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:08:14,282 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:08:14,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 16:08:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:14,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:08:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:14,484 INFO L85 PathProgramCache]: Analyzing trace with hash 39287252, now seen corresponding path program 1 times [2022-12-13 16:08:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:14,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765458090] [2022-12-13 16:08:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:14,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:14,485 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:08:14,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 16:08:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:14,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:08:14,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:08:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:08:14,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:08:14,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:08:14,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765458090] [2022-12-13 16:08:14,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765458090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:08:14,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:08:14,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:08:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827384745] [2022-12-13 16:08:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:08:14,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:08:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:08:14,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:08:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:08:14,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 378 [2022-12-13 16:08:14,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 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-12-13 16:08:14,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:08:14,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 378 [2022-12-13 16:08:14,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:08:16,273 INFO L130 PetriNetUnfolder]: 6557/9383 cut-off events. [2022-12-13 16:08:16,273 INFO L131 PetriNetUnfolder]: For 809/947 co-relation queries the response was YES. [2022-12-13 16:08:16,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20663 conditions, 9383 events. 6557/9383 cut-off events. For 809/947 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 53232 event pairs, 2501 based on Foata normal form. 144/8288 useless extension candidates. Maximal degree in co-relation 20658. Up to 8668 conditions per place. [2022-12-13 16:08:16,306 INFO L137 encePairwiseOnDemand]: 371/378 looper letters, 50 selfloop transitions, 5 changer transitions 21/80 dead transitions. [2022-12-13 16:08:16,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 347 flow [2022-12-13 16:08:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:08:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:08:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 803 transitions. [2022-12-13 16:08:16,308 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4248677248677249 [2022-12-13 16:08:16,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 803 transitions. [2022-12-13 16:08:16,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 803 transitions. [2022-12-13 16:08:16,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:08:16,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 803 transitions. [2022-12-13 16:08:16,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:16,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:16,314 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:16,314 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 111 flow. Second operand 5 states and 803 transitions. [2022-12-13 16:08:16,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 347 flow [2022-12-13 16:08:16,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:08:16,317 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 152 flow [2022-12-13 16:08:16,318 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2022-12-13 16:08:16,318 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -40 predicate places. [2022-12-13 16:08:16,318 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 152 flow [2022-12-13 16:08:16,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 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-12-13 16:08:16,319 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:08:16,319 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:08:16,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 16:08:16,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:16,521 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:08:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1996345538, now seen corresponding path program 1 times [2022-12-13 16:08:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:16,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676584972] [2022-12-13 16:08:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:16,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:08:16,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 16:08:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:16,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:08:16,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:08:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:08:16,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:08:16,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:08:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676584972] [2022-12-13 16:08:16,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676584972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:08:16,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:08:16,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:08:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574354943] [2022-12-13 16:08:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:08:16,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:08:16,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:08:16,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:08:16,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:08:16,714 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 378 [2022-12-13 16:08:16,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:16,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:08:16,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 378 [2022-12-13 16:08:16,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:08:17,739 INFO L130 PetriNetUnfolder]: 2125/3359 cut-off events. [2022-12-13 16:08:17,739 INFO L131 PetriNetUnfolder]: For 1867/1903 co-relation queries the response was YES. [2022-12-13 16:08:17,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9090 conditions, 3359 events. 2125/3359 cut-off events. For 1867/1903 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18205 event pairs, 581 based on Foata normal form. 108/3074 useless extension candidates. Maximal degree in co-relation 9082. Up to 2518 conditions per place. [2022-12-13 16:08:17,751 INFO L137 encePairwiseOnDemand]: 371/378 looper letters, 61 selfloop transitions, 9 changer transitions 21/95 dead transitions. [2022-12-13 16:08:17,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 494 flow [2022-12-13 16:08:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:08:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:08:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 963 transitions. [2022-12-13 16:08:17,753 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2022-12-13 16:08:17,753 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 963 transitions. [2022-12-13 16:08:17,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 963 transitions. [2022-12-13 16:08:17,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:08:17,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 963 transitions. [2022-12-13 16:08:17,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:17,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 378.0) internal successors, (2646), 7 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:17,757 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 378.0) internal successors, (2646), 7 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:17,757 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 152 flow. Second operand 6 states and 963 transitions. [2022-12-13 16:08:17,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 494 flow [2022-12-13 16:08:17,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 487 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 16:08:17,760 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 217 flow [2022-12-13 16:08:17,760 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2022-12-13 16:08:17,761 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2022-12-13 16:08:17,761 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 217 flow [2022-12-13 16:08:17,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:17,761 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:08:17,761 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:08:17,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 16:08:17,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:17,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:08:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash -204496451, now seen corresponding path program 1 times [2022-12-13 16:08:17,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:17,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528055507] [2022-12-13 16:08:17,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:17,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:17,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:17,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:08:17,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 16:08:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:18,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:08:18,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:08:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:08:18,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:08:18,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:08:18,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528055507] [2022-12-13 16:08:18,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528055507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:08:18,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:08:18,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:08:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716498562] [2022-12-13 16:08:18,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:08:18,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:08:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:08:18,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:08:18,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:08:18,258 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 378 [2022-12-13 16:08:18,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:18,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:08:18,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 378 [2022-12-13 16:08:18,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:08:19,072 INFO L130 PetriNetUnfolder]: 664/1134 cut-off events. [2022-12-13 16:08:19,073 INFO L131 PetriNetUnfolder]: For 1369/1372 co-relation queries the response was YES. [2022-12-13 16:08:19,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 1134 events. 664/1134 cut-off events. For 1369/1372 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5034 event pairs, 139 based on Foata normal form. 48/1117 useless extension candidates. Maximal degree in co-relation 3640. Up to 382 conditions per place. [2022-12-13 16:08:19,079 INFO L137 encePairwiseOnDemand]: 371/378 looper letters, 69 selfloop transitions, 13 changer transitions 21/107 dead transitions. [2022-12-13 16:08:19,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 107 transitions, 651 flow [2022-12-13 16:08:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:08:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:08:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1120 transitions. [2022-12-13 16:08:19,081 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2022-12-13 16:08:19,081 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1120 transitions. [2022-12-13 16:08:19,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1120 transitions. [2022-12-13 16:08:19,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:08:19,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1120 transitions. [2022-12-13 16:08:19,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:19,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 378.0) internal successors, (3024), 8 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:19,085 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 378.0) internal successors, (3024), 8 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:19,085 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 217 flow. Second operand 7 states and 1120 transitions. [2022-12-13 16:08:19,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 107 transitions, 651 flow [2022-12-13 16:08:19,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 589 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 16:08:19,091 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 267 flow [2022-12-13 16:08:19,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2022-12-13 16:08:19,091 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -33 predicate places. [2022-12-13 16:08:19,091 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 267 flow [2022-12-13 16:08:19,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:19,092 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:08:19,092 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:08:19,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 16:08:19,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:19,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:08:19,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash -216238825, now seen corresponding path program 1 times [2022-12-13 16:08:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:19,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175531858] [2022-12-13 16:08:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:19,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:19,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:19,300 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:08:19,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 16:08:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:19,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 16:08:19,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:08:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:08:19,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:08:19,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:08:19,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175531858] [2022-12-13 16:08:19,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175531858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:08:19,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:08:19,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:08:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583739765] [2022-12-13 16:08:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:08:19,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:08:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:08:19,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:08:19,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:08:19,541 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 378 [2022-12-13 16:08:19,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 267 flow. Second operand has 7 states, 7 states have (on average 147.85714285714286) internal successors, (1035), 7 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:19,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:08:19,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 378 [2022-12-13 16:08:19,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:08:20,152 INFO L130 PetriNetUnfolder]: 466/758 cut-off events. [2022-12-13 16:08:20,152 INFO L131 PetriNetUnfolder]: For 848/848 co-relation queries the response was YES. [2022-12-13 16:08:20,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 758 events. 466/758 cut-off events. For 848/848 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3075 event pairs, 104 based on Foata normal form. 11/760 useless extension candidates. Maximal degree in co-relation 2394. Up to 302 conditions per place. [2022-12-13 16:08:20,155 INFO L137 encePairwiseOnDemand]: 371/378 looper letters, 58 selfloop transitions, 17 changer transitions 12/90 dead transitions. [2022-12-13 16:08:20,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 559 flow [2022-12-13 16:08:20,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:08:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 16:08:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1249 transitions. [2022-12-13 16:08:20,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4130291005291005 [2022-12-13 16:08:20,157 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1249 transitions. [2022-12-13 16:08:20,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1249 transitions. [2022-12-13 16:08:20,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:08:20,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1249 transitions. [2022-12-13 16:08:20,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.125) internal successors, (1249), 8 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:20,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 378.0) internal successors, (3402), 9 states have internal predecessors, (3402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:20,161 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 378.0) internal successors, (3402), 9 states have internal predecessors, (3402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:20,161 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 267 flow. Second operand 8 states and 1249 transitions. [2022-12-13 16:08:20,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 559 flow [2022-12-13 16:08:20,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 495 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-13 16:08:20,166 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 229 flow [2022-12-13 16:08:20,167 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2022-12-13 16:08:20,167 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2022-12-13 16:08:20,167 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 229 flow [2022-12-13 16:08:20,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 147.85714285714286) internal successors, (1035), 7 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:08:20,167 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:08:20,168 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-12-13 16:08:20,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 16:08:20,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:20,369 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:08:20,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash 791020654, now seen corresponding path program 1 times [2022-12-13 16:08:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:20,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906908131] [2022-12-13 16:08:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:20,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:08:20,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:20,375 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:08:20,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 16:08:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:20,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:08:20,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:09:17,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2022-12-13 16:09:17,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-12-13 16:09:17,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 16:09:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:17,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:09:17,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:09:17,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906908131] [2022-12-13 16:09:17,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906908131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:17,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:17,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229895158] [2022-12-13 16:09:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:17,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:09:17,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:17,916 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 378 [2022-12-13 16:09:17,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:17,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:17,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 378 [2022-12-13 16:09:17,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:18,311 INFO L130 PetriNetUnfolder]: 574/937 cut-off events. [2022-12-13 16:09:18,311 INFO L131 PetriNetUnfolder]: For 1327/1327 co-relation queries the response was YES. [2022-12-13 16:09:18,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 937 events. 574/937 cut-off events. For 1327/1327 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3932 event pairs, 156 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 2825. Up to 662 conditions per place. [2022-12-13 16:09:18,316 INFO L137 encePairwiseOnDemand]: 374/378 looper letters, 62 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2022-12-13 16:09:18,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 456 flow [2022-12-13 16:09:18,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:09:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:09:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2022-12-13 16:09:18,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2022-12-13 16:09:18,318 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2022-12-13 16:09:18,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2022-12-13 16:09:18,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:18,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2022-12-13 16:09:18,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:18,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:18,320 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:18,320 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 229 flow. Second operand 4 states and 636 transitions. [2022-12-13 16:09:18,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 456 flow [2022-12-13 16:09:18,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 377 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-13 16:09:18,324 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 165 flow [2022-12-13 16:09:18,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-13 16:09:18,324 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -47 predicate places. [2022-12-13 16:09:18,324 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 165 flow [2022-12-13 16:09:18,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:18,325 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:18,325 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-12-13 16:09:18,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 16:09:18,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:09:18,526 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:09:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash -890563491, now seen corresponding path program 1 times [2022-12-13 16:09:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:09:18,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449643462] [2022-12-13 16:09:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:18,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:09:18,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:09:18,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:09:18,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 16:09:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:18,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:09:18,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:09:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:18,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:09:18,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:09:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449643462] [2022-12-13 16:09:18,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449643462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:18,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:18,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:09:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242030021] [2022-12-13 16:09:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:09:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:09:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:09:18,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:09:18,746 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 378 [2022-12-13 16:09:18,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:18,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:18,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 378 [2022-12-13 16:09:18,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:19,129 INFO L130 PetriNetUnfolder]: 801/1297 cut-off events. [2022-12-13 16:09:19,129 INFO L131 PetriNetUnfolder]: For 951/951 co-relation queries the response was YES. [2022-12-13 16:09:19,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 1297 events. 801/1297 cut-off events. For 951/951 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5992 event pairs, 386 based on Foata normal form. 0/1283 useless extension candidates. Maximal degree in co-relation 3735. Up to 781 conditions per place. [2022-12-13 16:09:19,137 INFO L137 encePairwiseOnDemand]: 375/378 looper letters, 75 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2022-12-13 16:09:19,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 461 flow [2022-12-13 16:09:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:09:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:09:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2022-12-13 16:09:19,138 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2022-12-13 16:09:19,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2022-12-13 16:09:19,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2022-12-13 16:09:19,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:19,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2022-12-13 16:09:19,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:19,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:19,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:19,140 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 165 flow. Second operand 3 states and 507 transitions. [2022-12-13 16:09:19,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 461 flow [2022-12-13 16:09:19,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:09:19,146 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 174 flow [2022-12-13 16:09:19,146 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2022-12-13 16:09:19,146 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -46 predicate places. [2022-12-13 16:09:19,146 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 174 flow [2022-12-13 16:09:19,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:19,147 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:19,147 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-12-13 16:09:19,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 16:09:19,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:09:19,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 16:09:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:19,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1033422545, now seen corresponding path program 2 times [2022-12-13 16:09:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:09:19,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118578035] [2022-12-13 16:09:19,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:09:19,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:09:19,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:09:19,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:09:19,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 16:09:19,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:09:19,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 16:09:19,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:09:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:09:19,871 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 16:09:19,871 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:09:19,872 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2022-12-13 16:09:19,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2022-12-13 16:09:19,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2022-12-13 16:09:19,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2022-12-13 16:09:19,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (32 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2022-12-13 16:09:19,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2022-12-13 16:09:19,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2022-12-13 16:09:19,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 16:09:20,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:09:20,081 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:20,097 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:09:20,097 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:09:20,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:09:20 BasicIcfg [2022-12-13 16:09:20,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:09:20,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:09:20,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:09:20,162 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:09:20,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:07:00" (3/4) ... [2022-12-13 16:09:20,164 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:09:20,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:09:20,165 INFO L158 Benchmark]: Toolchain (without parser) took 141402.97ms. Allocated memory was 58.7MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 25.9MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-12-13 16:09:20,165 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 58.7MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 81.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:09:20,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.15ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 25.7MB in the beginning and 36.7MB in the end (delta: -11.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-12-13 16:09:20,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 79.7MB. Free memory was 36.7MB in the beginning and 57.4MB in the end (delta: -20.6MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2022-12-13 16:09:20,165 INFO L158 Benchmark]: Boogie Preprocessor took 23.76ms. Allocated memory is still 79.7MB. Free memory was 57.0MB in the beginning and 54.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:09:20,166 INFO L158 Benchmark]: RCFGBuilder took 1388.23ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 54.6MB in the beginning and 54.8MB in the end (delta: -224.8kB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2022-12-13 16:09:20,166 INFO L158 Benchmark]: TraceAbstraction took 139553.67ms. Allocated memory was 96.5MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 54.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-12-13 16:09:20,166 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 4.2GB. Free memory is still 2.4GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:09:20,167 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 58.7MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 81.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.15ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 25.7MB in the beginning and 36.7MB in the end (delta: -11.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 79.7MB. Free memory was 36.7MB in the beginning and 57.4MB in the end (delta: -20.6MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.76ms. Allocated memory is still 79.7MB. Free memory was 57.0MB in the beginning and 54.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1388.23ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 54.6MB in the beginning and 54.8MB in the end (delta: -224.8kB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 139553.67ms. Allocated memory was 96.5MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 54.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 4.2GB. Free memory is still 2.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.2s, 215 PlacesBefore, 100 PlacesAfterwards, 204 TransitionsBefore, 88 TransitionsAfterwards, 9308 CoEnabledTransitionPairs, 8 FixpointIterations, 75 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 170 TotalNumberOfCompositions, 48009 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12830, independent: 12007, independent conditional: 0, independent unconditional: 12007, dependent: 823, dependent conditional: 0, dependent unconditional: 823, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3784, independent: 3685, independent conditional: 0, independent unconditional: 3685, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12830, independent: 8322, independent conditional: 0, independent unconditional: 8322, dependent: 724, dependent conditional: 0, dependent unconditional: 724, unknown: 3784, unknown conditional: 0, unknown unconditional: 3784] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 616, Positive conditional cache size: 0, Positive unconditional cache size: 616, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2145, ((void *)0), P0, ((void *)0))=-1, t2145={-2147483646:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] EXPR 1 \read(y) [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2146; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={-2147483646:0}, t2146={6:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2146, ((void *)0), P1, ((void *)0))=0, t2145={-2147483646:0}, t2146={6:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 1 return 0; [L795] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2147; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={-2147483646:0}, t2146={6:0}, t2147={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2147, ((void *)0), P2, ((void *)0))=1, t2145={-2147483646:0}, t2146={6:0}, t2147={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2148; [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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, pthread_create(&t2148, ((void *)0), P3, ((void *)0))=2, t2145={-2147483646:0}, t2146={6:0}, t2147={8:0}, t2148={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L827] 4 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=1, main$tmp_guard1=0, t2145={-2147483646:0}, t2146={6:0}, t2147={8:0}, t2148={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] EXPR 0 \read(y) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=2, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 267 locations, 88 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: 139.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 50.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 623 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1797 IncrementalHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 32 mSDtfsCounter, 1797 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=6, InterpolantAutomatonStates: 41, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 57.5s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1379 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:09:20,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9212d86f-59d1-40de-930d-c8164dcf3560/bin/uautomizer-uyxdKDjOR8/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 Result: UNKNOWN: Overapproximated counterexample