./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_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_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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_a4a71110-0589-44e5-a05d-851e7551fbe0/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 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b --- 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 15:15:59,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:15:59,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:15:59,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:15:59,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:15:59,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:15:59,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:15:59,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:15:59,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:15:59,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:15:59,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:15:59,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:15:59,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:15:59,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:15:59,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:15:59,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:15:59,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:15:59,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:15:59,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:15:59,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:15:59,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:15:59,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:15:59,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:15:59,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:15:59,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:15:59,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:15:59,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:15:59,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:15:59,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:15:59,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:15:59,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:15:59,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:15:59,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:15:59,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:15:59,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:15:59,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:15:59,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:15:59,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:15:59,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:15:59,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:15:59,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:15:59,154 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 15:15:59,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:15:59,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:15:59,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:15:59,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:15:59,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:15:59,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:15:59,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:15:59,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:15:59,168 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:15:59,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:15:59,169 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:15:59,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:15:59,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:15:59,170 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:15:59,171 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:15:59,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:15:59,171 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:15:59,171 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_a4a71110-0589-44e5-a05d-851e7551fbe0/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_a4a71110-0589-44e5-a05d-851e7551fbe0/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 -> 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b [2022-12-13 15:15:59,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:15:59,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:15:59,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:15:59,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:15:59,363 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:15:59,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2022-12-13 15:16:01,941 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:16:02,127 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:16:02,128 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2022-12-13 15:16:02,136 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/data/bf6222b74/4c9bb8277e734e3e9a3c9ff9680446b9/FLAGa2e768bf8 [2022-12-13 15:16:02,520 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/data/bf6222b74/4c9bb8277e734e3e9a3c9ff9680446b9 [2022-12-13 15:16:02,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:16:02,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:16:02,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:16:02,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:16:02,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:16:02,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@83468f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02, skipping insertion in model container [2022-12-13 15:16:02,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:16:02,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:16:02,693 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_a4a71110-0589-44e5-a05d-851e7551fbe0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2022-12-13 15:16:02,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:16:02,808 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:16:02,816 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_a4a71110-0589-44e5-a05d-851e7551fbe0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2022-12-13 15:16:02,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:02,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:02,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:16:02,873 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:16:02,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02 WrapperNode [2022-12-13 15:16:02,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:16:02,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:16:02,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:16:02,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:16:02,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,905 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-13 15:16:02,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:16:02,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:16:02,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:16:02,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:16:02,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,926 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:16:02,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:16:02,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:16:02,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:16:02,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (1/1) ... [2022-12-13 15:16:02,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:16:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:16:02,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:16:02,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:16:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 15:16:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:16:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:16:02,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:16:02,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:16:02,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:16:02,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:16:02,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:16:02,989 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 15:16:03,105 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:16:03,106 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:16:03,425 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:16:03,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:16:03,677 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:16:03,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:16:03 BoogieIcfgContainer [2022-12-13 15:16:03,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:16:03,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:16:03,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:16:03,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:16:03,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:16:02" (1/3) ... [2022-12-13 15:16:03,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4634159b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:16:03, skipping insertion in model container [2022-12-13 15:16:03,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:02" (2/3) ... [2022-12-13 15:16:03,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4634159b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:16:03, skipping insertion in model container [2022-12-13 15:16:03,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:16:03" (3/3) ... [2022-12-13 15:16:03,684 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2022-12-13 15:16:03,699 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:16:03,699 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-12-13 15:16:03,699 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:16:03,770 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:16:03,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 353 flow [2022-12-13 15:16:03,842 INFO L130 PetriNetUnfolder]: 2/166 cut-off events. [2022-12-13 15:16:03,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:16:03,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 166 events. 2/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 216 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-13 15:16:03,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 169 transitions, 353 flow [2022-12-13 15:16:03,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 166 transitions, 341 flow [2022-12-13 15:16:03,854 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:16:03,866 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 166 transitions, 341 flow [2022-12-13 15:16:03,869 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 166 transitions, 341 flow [2022-12-13 15:16:03,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 166 transitions, 341 flow [2022-12-13 15:16:03,897 INFO L130 PetriNetUnfolder]: 2/166 cut-off events. [2022-12-13 15:16:03,897 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:16:03,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 166 events. 2/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-13 15:16:03,899 INFO L119 LiptonReduction]: Number of co-enabled transitions 5336 [2022-12-13 15:16:13,028 INFO L134 LiptonReduction]: Checked pairs total: 19340 [2022-12-13 15:16:13,029 INFO L136 LiptonReduction]: Total number of compositions: 159 [2022-12-13 15:16:13,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:16:13,044 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;@4b4d3f86, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:16:13,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-12-13 15:16:13,046 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 15:16:13,046 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:16:13,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:13,046 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:16:13,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash 938, now seen corresponding path program 1 times [2022-12-13 15:16:13,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:13,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339767723] [2022-12-13 15:16:13,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:13,135 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 15:16:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:13,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339767723] [2022-12-13 15:16:13,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339767723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:13,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:13,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:16:13,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855374985] [2022-12-13 15:16:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:13,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:16:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:13,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:16:13,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:16:13,161 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 328 [2022-12-13 15:16:13,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:13,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:13,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 328 [2022-12-13 15:16:13,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:14,192 INFO L130 PetriNetUnfolder]: 4396/6524 cut-off events. [2022-12-13 15:16:14,193 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:16:14,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12918 conditions, 6524 events. 4396/6524 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 40926 event pairs, 4396 based on Foata normal form. 0/3578 useless extension candidates. Maximal degree in co-relation 12907. Up to 6348 conditions per place. [2022-12-13 15:16:14,232 INFO L137 encePairwiseOnDemand]: 307/328 looper letters, 35 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2022-12-13 15:16:14,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 159 flow [2022-12-13 15:16:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:16:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:16:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 322 transitions. [2022-12-13 15:16:14,246 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49085365853658536 [2022-12-13 15:16:14,247 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 322 transitions. [2022-12-13 15:16:14,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 322 transitions. [2022-12-13 15:16:14,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:14,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 322 transitions. [2022-12-13 15:16:14,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:14,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:14,260 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:14,262 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 322 transitions. [2022-12-13 15:16:14,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 159 flow [2022-12-13 15:16:14,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:16:14,268 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2022-12-13 15:16:14,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 15:16:14,274 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2022-12-13 15:16:14,274 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2022-12-13 15:16:14,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:14,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:14,275 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:16:14,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:16:14,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash 927277, now seen corresponding path program 1 times [2022-12-13 15:16:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:14,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571914346] [2022-12-13 15:16:14,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:14,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:14,426 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 15:16:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:14,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571914346] [2022-12-13 15:16:14,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571914346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:14,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:14,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:16:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96587445] [2022-12-13 15:16:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:14,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:16:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:14,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:16:14,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:16:14,467 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 328 [2022-12-13 15:16:14,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:14,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:14,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 328 [2022-12-13 15:16:14,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:15,351 INFO L130 PetriNetUnfolder]: 4193/6292 cut-off events. [2022-12-13 15:16:15,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:16:15,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12539 conditions, 6292 events. 4193/6292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 37742 event pairs, 2712 based on Foata normal form. 0/4151 useless extension candidates. Maximal degree in co-relation 12536. Up to 3970 conditions per place. [2022-12-13 15:16:15,394 INFO L137 encePairwiseOnDemand]: 314/328 looper letters, 43 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-13 15:16:15,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 214 flow [2022-12-13 15:16:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-12-13 15:16:15,397 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2022-12-13 15:16:15,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-12-13 15:16:15,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-12-13 15:16:15,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:15,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-12-13 15:16:15,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,402 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 438 transitions. [2022-12-13 15:16:15,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 214 flow [2022-12-13 15:16:15,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 214 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:16:15,404 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 146 flow [2022-12-13 15:16:15,404 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-13 15:16:15,405 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2022-12-13 15:16:15,405 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 146 flow [2022-12-13 15:16:15,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:15,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:16:15,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:16:15,406 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 927278, now seen corresponding path program 1 times [2022-12-13 15:16:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:15,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683064463] [2022-12-13 15:16:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:15,512 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 15:16:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:15,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683064463] [2022-12-13 15:16:15,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683064463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:15,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:16:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640981378] [2022-12-13 15:16:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:15,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:16:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:16:15,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:16:15,542 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 328 [2022-12-13 15:16:15,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:15,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 328 [2022-12-13 15:16:15,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:15,960 INFO L130 PetriNetUnfolder]: 1662/2714 cut-off events. [2022-12-13 15:16:15,960 INFO L131 PetriNetUnfolder]: For 647/692 co-relation queries the response was YES. [2022-12-13 15:16:15,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6816 conditions, 2714 events. 1662/2714 cut-off events. For 647/692 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 16175 event pairs, 1395 based on Foata normal form. 369/2707 useless extension candidates. Maximal degree in co-relation 6811. Up to 2392 conditions per place. [2022-12-13 15:16:15,973 INFO L137 encePairwiseOnDemand]: 321/328 looper letters, 30 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2022-12-13 15:16:15,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 196 flow [2022-12-13 15:16:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2022-12-13 15:16:15,975 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2022-12-13 15:16:15,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2022-12-13 15:16:15,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2022-12-13 15:16:15,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:15,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2022-12-13 15:16:15,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,979 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 146 flow. Second operand 3 states and 426 transitions. [2022-12-13 15:16:15,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 196 flow [2022-12-13 15:16:15,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:15,984 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 120 flow [2022-12-13 15:16:15,984 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-13 15:16:15,984 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2022-12-13 15:16:15,985 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 120 flow [2022-12-13 15:16:15,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:15,985 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:15,985 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:15,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:16:15,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:15,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1078457579, now seen corresponding path program 1 times [2022-12-13 15:16:15,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:15,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688324365] [2022-12-13 15:16:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:16,221 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 15:16:16,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:16,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688324365] [2022-12-13 15:16:16,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688324365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:16,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:16,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:16:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35808137] [2022-12-13 15:16:16,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:16,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:16:16,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:16:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:16:16,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 328 [2022-12-13 15:16:16,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:16,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:16,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 328 [2022-12-13 15:16:16,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:16,678 INFO L130 PetriNetUnfolder]: 1601/2675 cut-off events. [2022-12-13 15:16:16,678 INFO L131 PetriNetUnfolder]: For 263/290 co-relation queries the response was YES. [2022-12-13 15:16:16,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6272 conditions, 2675 events. 1601/2675 cut-off events. For 263/290 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 16535 event pairs, 492 based on Foata normal form. 0/2158 useless extension candidates. Maximal degree in co-relation 6267. Up to 2226 conditions per place. [2022-12-13 15:16:16,686 INFO L137 encePairwiseOnDemand]: 322/328 looper letters, 45 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2022-12-13 15:16:16,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 270 flow [2022-12-13 15:16:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-12-13 15:16:16,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4502032520325203 [2022-12-13 15:16:16,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2022-12-13 15:16:16,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2022-12-13 15:16:16,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:16,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2022-12-13 15:16:16,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:16,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:16,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:16,693 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 120 flow. Second operand 3 states and 443 transitions. [2022-12-13 15:16:16,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 270 flow [2022-12-13 15:16:16,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:16:16,694 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 153 flow [2022-12-13 15:16:16,695 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-13 15:16:16,695 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2022-12-13 15:16:16,695 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 153 flow [2022-12-13 15:16:16,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:16,696 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:16,696 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:16,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:16:16,696 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:16,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:16,697 INFO L85 PathProgramCache]: Analyzing trace with hash 927551709, now seen corresponding path program 1 times [2022-12-13 15:16:16,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:16,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285277985] [2022-12-13 15:16:16,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:16,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:16,930 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 15:16:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:16,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285277985] [2022-12-13 15:16:16,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285277985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:16,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:16,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:16:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819144302] [2022-12-13 15:16:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:16,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:16:16,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:16:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:16:16,937 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 328 [2022-12-13 15:16:16,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:16,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:16,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 328 [2022-12-13 15:16:16,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:17,486 INFO L130 PetriNetUnfolder]: 2265/3501 cut-off events. [2022-12-13 15:16:17,486 INFO L131 PetriNetUnfolder]: For 1567/1763 co-relation queries the response was YES. [2022-12-13 15:16:17,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9153 conditions, 3501 events. 2265/3501 cut-off events. For 1567/1763 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 21811 event pairs, 275 based on Foata normal form. 31/2923 useless extension candidates. Maximal degree in co-relation 9147. Up to 2787 conditions per place. [2022-12-13 15:16:17,496 INFO L137 encePairwiseOnDemand]: 325/328 looper letters, 59 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2022-12-13 15:16:17,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 376 flow [2022-12-13 15:16:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-12-13 15:16:17,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2022-12-13 15:16:17,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-12-13 15:16:17,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-12-13 15:16:17,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:17,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-12-13 15:16:17,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:17,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:17,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:17,500 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 153 flow. Second operand 3 states and 438 transitions. [2022-12-13 15:16:17,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 376 flow [2022-12-13 15:16:17,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:16:17,503 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 157 flow [2022-12-13 15:16:17,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=157, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-12-13 15:16:17,503 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2022-12-13 15:16:17,504 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 157 flow [2022-12-13 15:16:17,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:17,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:17,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:17,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:16:17,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1651685023, now seen corresponding path program 1 times [2022-12-13 15:16:17,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:17,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503323858] [2022-12-13 15:16:17,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:17,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:17,616 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 15:16:17,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:17,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503323858] [2022-12-13 15:16:17,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503323858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:17,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:17,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:16:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980370048] [2022-12-13 15:16:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:17,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:16:17,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:17,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:16:17,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:16:17,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 328 [2022-12-13 15:16:17,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:17,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:17,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 328 [2022-12-13 15:16:17,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:18,078 INFO L130 PetriNetUnfolder]: 1768/2837 cut-off events. [2022-12-13 15:16:18,078 INFO L131 PetriNetUnfolder]: For 1030/1030 co-relation queries the response was YES. [2022-12-13 15:16:18,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7930 conditions, 2837 events. 1768/2837 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 16750 event pairs, 678 based on Foata normal form. 0/2566 useless extension candidates. Maximal degree in co-relation 7923. Up to 1169 conditions per place. [2022-12-13 15:16:18,087 INFO L137 encePairwiseOnDemand]: 320/328 looper letters, 60 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2022-12-13 15:16:18,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 405 flow [2022-12-13 15:16:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:16:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:16:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2022-12-13 15:16:18,089 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4260670731707317 [2022-12-13 15:16:18,089 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2022-12-13 15:16:18,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2022-12-13 15:16:18,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:18,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2022-12-13 15:16:18,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,092 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,092 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 157 flow. Second operand 4 states and 559 transitions. [2022-12-13 15:16:18,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 405 flow [2022-12-13 15:16:18,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:18,094 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 227 flow [2022-12-13 15:16:18,094 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2022-12-13 15:16:18,095 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2022-12-13 15:16:18,095 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 227 flow [2022-12-13 15:16:18,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,096 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:18,096 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:18,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:16:18,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash 927551466, now seen corresponding path program 1 times [2022-12-13 15:16:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:18,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697004992] [2022-12-13 15:16:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:18,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 15:16:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697004992] [2022-12-13 15:16:18,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697004992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:18,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:18,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:16:18,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975785107] [2022-12-13 15:16:18,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:18,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:16:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:18,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:16:18,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:16:18,377 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 328 [2022-12-13 15:16:18,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:18,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 328 [2022-12-13 15:16:18,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:18,887 INFO L130 PetriNetUnfolder]: 1625/2691 cut-off events. [2022-12-13 15:16:18,887 INFO L131 PetriNetUnfolder]: For 2593/2593 co-relation queries the response was YES. [2022-12-13 15:16:18,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 2691 events. 1625/2691 cut-off events. For 2593/2593 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16564 event pairs, 718 based on Foata normal form. 30/2495 useless extension candidates. Maximal degree in co-relation 7844. Up to 1607 conditions per place. [2022-12-13 15:16:18,896 INFO L137 encePairwiseOnDemand]: 325/328 looper letters, 55 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2022-12-13 15:16:18,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 406 flow [2022-12-13 15:16:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:16:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:16:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-12-13 15:16:18,898 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42835365853658536 [2022-12-13 15:16:18,898 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-12-13 15:16:18,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-12-13 15:16:18,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:18,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-12-13 15:16:18,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,900 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,900 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 227 flow. Second operand 4 states and 562 transitions. [2022-12-13 15:16:18,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 406 flow [2022-12-13 15:16:18,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:16:18,910 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 239 flow [2022-12-13 15:16:18,910 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 15:16:18,911 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -17 predicate places. [2022-12-13 15:16:18,911 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 239 flow [2022-12-13 15:16:18,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:18,911 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:16:18,912 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 927647721, now seen corresponding path program 1 times [2022-12-13 15:16:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:18,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729127953] [2022-12-13 15:16:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:18,959 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 15:16:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:18,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729127953] [2022-12-13 15:16:18,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729127953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:18,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:18,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:16:18,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116732838] [2022-12-13 15:16:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:18,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:16:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:18,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:16:18,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:16:18,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 328 [2022-12-13 15:16:18,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:18,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:18,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 328 [2022-12-13 15:16:18,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:19,322 INFO L130 PetriNetUnfolder]: 1388/2324 cut-off events. [2022-12-13 15:16:19,322 INFO L131 PetriNetUnfolder]: For 3453/3462 co-relation queries the response was YES. [2022-12-13 15:16:19,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7055 conditions, 2324 events. 1388/2324 cut-off events. For 3453/3462 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 13722 event pairs, 744 based on Foata normal form. 18/2102 useless extension candidates. Maximal degree in co-relation 7045. Up to 1342 conditions per place. [2022-12-13 15:16:19,330 INFO L137 encePairwiseOnDemand]: 324/328 looper letters, 49 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2022-12-13 15:16:19,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 390 flow [2022-12-13 15:16:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-12-13 15:16:19,332 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4502032520325203 [2022-12-13 15:16:19,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2022-12-13 15:16:19,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2022-12-13 15:16:19,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:19,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2022-12-13 15:16:19,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:19,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:19,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:19,335 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 239 flow. Second operand 3 states and 443 transitions. [2022-12-13 15:16:19,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 390 flow [2022-12-13 15:16:19,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 380 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:16:19,344 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 227 flow [2022-12-13 15:16:19,344 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-13 15:16:19,345 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2022-12-13 15:16:19,345 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 227 flow [2022-12-13 15:16:19,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:19,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:19,345 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:19,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:16:19,345 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1850501839, now seen corresponding path program 1 times [2022-12-13 15:16:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:19,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243204078] [2022-12-13 15:16:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:19,535 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 15:16:19,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:19,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243204078] [2022-12-13 15:16:19,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243204078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:19,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:19,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:16:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417970550] [2022-12-13 15:16:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:19,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:16:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:16:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:16:19,542 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 328 [2022-12-13 15:16:19,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:19,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:19,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 328 [2022-12-13 15:16:19,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:20,044 INFO L130 PetriNetUnfolder]: 1968/3169 cut-off events. [2022-12-13 15:16:20,044 INFO L131 PetriNetUnfolder]: For 3584/3636 co-relation queries the response was YES. [2022-12-13 15:16:20,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9790 conditions, 3169 events. 1968/3169 cut-off events. For 3584/3636 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 18937 event pairs, 849 based on Foata normal form. 36/2869 useless extension candidates. Maximal degree in co-relation 9781. Up to 2073 conditions per place. [2022-12-13 15:16:20,052 INFO L137 encePairwiseOnDemand]: 325/328 looper letters, 63 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2022-12-13 15:16:20,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 507 flow [2022-12-13 15:16:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-12-13 15:16:20,054 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4410569105691057 [2022-12-13 15:16:20,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-12-13 15:16:20,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-12-13 15:16:20,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:20,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-12-13 15:16:20,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,057 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 227 flow. Second operand 3 states and 434 transitions. [2022-12-13 15:16:20,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 507 flow [2022-12-13 15:16:20,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:20,065 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 225 flow [2022-12-13 15:16:20,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 15:16:20,065 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -19 predicate places. [2022-12-13 15:16:20,066 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 225 flow [2022-12-13 15:16:20,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:20,066 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:20,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:16:20,066 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:20,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1310605344, now seen corresponding path program 1 times [2022-12-13 15:16:20,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:20,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022650117] [2022-12-13 15:16:20,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:20,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:20,153 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 15:16:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022650117] [2022-12-13 15:16:20,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022650117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:20,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:20,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:16:20,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311940059] [2022-12-13 15:16:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:20,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:16:20,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:20,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:16:20,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:16:20,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 328 [2022-12-13 15:16:20,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:20,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 328 [2022-12-13 15:16:20,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:20,599 INFO L130 PetriNetUnfolder]: 1494/2367 cut-off events. [2022-12-13 15:16:20,600 INFO L131 PetriNetUnfolder]: For 2334/2334 co-relation queries the response was YES. [2022-12-13 15:16:20,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7636 conditions, 2367 events. 1494/2367 cut-off events. For 2334/2334 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13059 event pairs, 509 based on Foata normal form. 33/2198 useless extension candidates. Maximal degree in co-relation 7626. Up to 925 conditions per place. [2022-12-13 15:16:20,606 INFO L137 encePairwiseOnDemand]: 316/328 looper letters, 48 selfloop transitions, 16 changer transitions 0/66 dead transitions. [2022-12-13 15:16:20,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 456 flow [2022-12-13 15:16:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:16:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:16:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2022-12-13 15:16:20,609 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41310975609756095 [2022-12-13 15:16:20,609 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2022-12-13 15:16:20,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2022-12-13 15:16:20,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:20,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2022-12-13 15:16:20,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,611 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,611 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 225 flow. Second operand 4 states and 542 transitions. [2022-12-13 15:16:20,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 456 flow [2022-12-13 15:16:20,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:20,618 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 348 flow [2022-12-13 15:16:20,618 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-13 15:16:20,619 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2022-12-13 15:16:20,619 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 348 flow [2022-12-13 15:16:20,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,619 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:20,619 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:20,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:16:20,619 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash 422725909, now seen corresponding path program 1 times [2022-12-13 15:16:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:20,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274505581] [2022-12-13 15:16:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:20,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:20,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 15:16:20,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274505581] [2022-12-13 15:16:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274505581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:20,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:20,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:16:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266365133] [2022-12-13 15:16:20,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:20,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:16:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:16:20,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:16:20,743 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 328 [2022-12-13 15:16:20,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:20,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:20,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 328 [2022-12-13 15:16:20,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:21,130 INFO L130 PetriNetUnfolder]: 1272/2135 cut-off events. [2022-12-13 15:16:21,130 INFO L131 PetriNetUnfolder]: For 3258/3270 co-relation queries the response was YES. [2022-12-13 15:16:21,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7508 conditions, 2135 events. 1272/2135 cut-off events. For 3258/3270 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 12453 event pairs, 269 based on Foata normal form. 10/1938 useless extension candidates. Maximal degree in co-relation 7497. Up to 1587 conditions per place. [2022-12-13 15:16:21,137 INFO L137 encePairwiseOnDemand]: 325/328 looper letters, 50 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2022-12-13 15:16:21,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 526 flow [2022-12-13 15:16:21,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-12-13 15:16:21,138 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4369918699186992 [2022-12-13 15:16:21,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2022-12-13 15:16:21,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2022-12-13 15:16:21,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:21,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2022-12-13 15:16:21,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:21,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:21,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:21,141 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 348 flow. Second operand 3 states and 430 transitions. [2022-12-13 15:16:21,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 526 flow [2022-12-13 15:16:21,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 521 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:16:21,150 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 356 flow [2022-12-13 15:16:21,150 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2022-12-13 15:16:21,150 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -14 predicate places. [2022-12-13 15:16:21,151 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 356 flow [2022-12-13 15:16:21,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:21,151 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:21,151 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:21,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:16:21,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1531000828, now seen corresponding path program 1 times [2022-12-13 15:16:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:21,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543849121] [2022-12-13 15:16:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:21,263 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 15:16:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:21,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543849121] [2022-12-13 15:16:21,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543849121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:21,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:21,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:16:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836937416] [2022-12-13 15:16:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:21,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:16:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:16:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:16:21,272 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 328 [2022-12-13 15:16:21,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:21,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:21,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 328 [2022-12-13 15:16:21,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:22,073 INFO L130 PetriNetUnfolder]: 2829/4543 cut-off events. [2022-12-13 15:16:22,073 INFO L131 PetriNetUnfolder]: For 8079/8337 co-relation queries the response was YES. [2022-12-13 15:16:22,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16432 conditions, 4543 events. 2829/4543 cut-off events. For 8079/8337 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 29262 event pairs, 1003 based on Foata normal form. 94/4097 useless extension candidates. Maximal degree in co-relation 16419. Up to 1926 conditions per place. [2022-12-13 15:16:22,088 INFO L137 encePairwiseOnDemand]: 324/328 looper letters, 118 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2022-12-13 15:16:22,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 133 transitions, 1187 flow [2022-12-13 15:16:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:16:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:16:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-12-13 15:16:22,090 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43414634146341463 [2022-12-13 15:16:22,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-12-13 15:16:22,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-12-13 15:16:22,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:22,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-12-13 15:16:22,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 328.0) internal successors, (1968), 6 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,093 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 328.0) internal successors, (1968), 6 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,093 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 356 flow. Second operand 5 states and 712 transitions. [2022-12-13 15:16:22,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 133 transitions, 1187 flow [2022-12-13 15:16:22,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 133 transitions, 1177 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:22,113 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 384 flow [2022-12-13 15:16:22,113 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=384, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2022-12-13 15:16:22,113 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2022-12-13 15:16:22,113 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 384 flow [2022-12-13 15:16:22,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,114 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:22,114 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:22,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:16:22,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:22,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1371727108, now seen corresponding path program 2 times [2022-12-13 15:16:22,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:22,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412815054] [2022-12-13 15:16:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:22,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:22,326 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 15:16:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:22,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412815054] [2022-12-13 15:16:22,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412815054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:22,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:22,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:16:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247335972] [2022-12-13 15:16:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:22,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:16:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:22,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:16:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:16:22,374 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 328 [2022-12-13 15:16:22,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:22,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 328 [2022-12-13 15:16:22,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:22,942 INFO L130 PetriNetUnfolder]: 2128/3672 cut-off events. [2022-12-13 15:16:22,942 INFO L131 PetriNetUnfolder]: For 6895/6923 co-relation queries the response was YES. [2022-12-13 15:16:22,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 3672 events. 2128/3672 cut-off events. For 6895/6923 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 24522 event pairs, 1019 based on Foata normal form. 12/3224 useless extension candidates. Maximal degree in co-relation 13604. Up to 2150 conditions per place. [2022-12-13 15:16:22,955 INFO L137 encePairwiseOnDemand]: 325/328 looper letters, 52 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2022-12-13 15:16:22,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 559 flow [2022-12-13 15:16:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2022-12-13 15:16:22,957 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2022-12-13 15:16:22,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2022-12-13 15:16:22,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2022-12-13 15:16:22,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:22,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2022-12-13 15:16:22,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,959 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 384 flow. Second operand 3 states and 432 transitions. [2022-12-13 15:16:22,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 559 flow [2022-12-13 15:16:22,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:22,983 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 402 flow [2022-12-13 15:16:22,983 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2022-12-13 15:16:22,983 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -9 predicate places. [2022-12-13 15:16:22,983 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 402 flow [2022-12-13 15:16:22,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:22,984 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:22,984 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:22,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 15:16:22,984 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1974062754, now seen corresponding path program 1 times [2022-12-13 15:16:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:22,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914009894] [2022-12-13 15:16:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:22,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:23,252 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 15:16:23,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:23,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914009894] [2022-12-13 15:16:23,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914009894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:23,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:23,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:16:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040754475] [2022-12-13 15:16:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:23,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:16:23,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:16:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:16:23,409 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 328 [2022-12-13 15:16:23,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 402 flow. Second operand has 9 states, 9 states have (on average 119.55555555555556) internal successors, (1076), 9 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:23,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:23,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 328 [2022-12-13 15:16:23,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:24,190 INFO L130 PetriNetUnfolder]: 3005/4878 cut-off events. [2022-12-13 15:16:24,190 INFO L131 PetriNetUnfolder]: For 8872/8882 co-relation queries the response was YES. [2022-12-13 15:16:24,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17877 conditions, 4878 events. 3005/4878 cut-off events. For 8872/8882 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 31825 event pairs, 959 based on Foata normal form. 73/4592 useless extension candidates. Maximal degree in co-relation 17861. Up to 1513 conditions per place. [2022-12-13 15:16:24,208 INFO L137 encePairwiseOnDemand]: 315/328 looper letters, 92 selfloop transitions, 26 changer transitions 0/121 dead transitions. [2022-12-13 15:16:24,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 121 transitions, 1029 flow [2022-12-13 15:16:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:16:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:16:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 915 transitions. [2022-12-13 15:16:24,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3985191637630662 [2022-12-13 15:16:24,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 915 transitions. [2022-12-13 15:16:24,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 915 transitions. [2022-12-13 15:16:24,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:24,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 915 transitions. [2022-12-13 15:16:24,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.71428571428572) internal successors, (915), 7 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:24,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 328.0) internal successors, (2624), 8 states have internal predecessors, (2624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:24,213 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 328.0) internal successors, (2624), 8 states have internal predecessors, (2624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:24,214 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 402 flow. Second operand 7 states and 915 transitions. [2022-12-13 15:16:24,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 121 transitions, 1029 flow [2022-12-13 15:16:24,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 121 transitions, 1005 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:24,245 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 686 flow [2022-12-13 15:16:24,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=686, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2022-12-13 15:16:24,246 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -1 predicate places. [2022-12-13 15:16:24,246 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 686 flow [2022-12-13 15:16:24,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.55555555555556) internal successors, (1076), 9 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:24,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:24,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:24,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 15:16:24,246 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1068227998, now seen corresponding path program 1 times [2022-12-13 15:16:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:24,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721555545] [2022-12-13 15:16:24,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:24,528 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 15:16:24,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:24,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721555545] [2022-12-13 15:16:24,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721555545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:24,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:24,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:16:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441914807] [2022-12-13 15:16:24,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:24,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:16:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:16:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:16:24,775 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 328 [2022-12-13 15:16:24,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 686 flow. Second operand has 8 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:24,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:24,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 328 [2022-12-13 15:16:24,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:25,542 INFO L130 PetriNetUnfolder]: 2181/3667 cut-off events. [2022-12-13 15:16:25,543 INFO L131 PetriNetUnfolder]: For 10223/10289 co-relation queries the response was YES. [2022-12-13 15:16:25,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14820 conditions, 3667 events. 2181/3667 cut-off events. For 10223/10289 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 23876 event pairs, 537 based on Foata normal form. 8/3566 useless extension candidates. Maximal degree in co-relation 14801. Up to 1363 conditions per place. [2022-12-13 15:16:25,555 INFO L137 encePairwiseOnDemand]: 321/328 looper letters, 75 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2022-12-13 15:16:25,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 1023 flow [2022-12-13 15:16:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:16:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:16:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2022-12-13 15:16:25,557 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2022-12-13 15:16:25,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2022-12-13 15:16:25,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2022-12-13 15:16:25,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:25,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2022-12-13 15:16:25,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:25,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 328.0) internal successors, (2624), 8 states have internal predecessors, (2624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:25,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 328.0) internal successors, (2624), 8 states have internal predecessors, (2624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:25,561 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 686 flow. Second operand 7 states and 888 transitions. [2022-12-13 15:16:25,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 1023 flow [2022-12-13 15:16:25,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 103 transitions, 1019 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 15:16:25,594 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 654 flow [2022-12-13 15:16:25,594 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=654, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2022-12-13 15:16:25,594 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2022-12-13 15:16:25,594 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 654 flow [2022-12-13 15:16:25,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:25,594 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:25,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:25,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 15:16:25,595 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash 887907178, now seen corresponding path program 1 times [2022-12-13 15:16:25,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:25,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560449318] [2022-12-13 15:16:25,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:25,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:26,425 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 15:16:26,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560449318] [2022-12-13 15:16:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560449318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:26,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:26,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:16:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243839095] [2022-12-13 15:16:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:26,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:16:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:26,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:16:26,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:16:26,642 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 328 [2022-12-13 15:16:26,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 654 flow. Second operand has 9 states, 9 states have (on average 117.55555555555556) internal successors, (1058), 9 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:26,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:26,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 328 [2022-12-13 15:16:26,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:27,402 INFO L130 PetriNetUnfolder]: 2500/4046 cut-off events. [2022-12-13 15:16:27,402 INFO L131 PetriNetUnfolder]: For 12494/12506 co-relation queries the response was YES. [2022-12-13 15:16:27,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16601 conditions, 4046 events. 2500/4046 cut-off events. For 12494/12506 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 25746 event pairs, 1409 based on Foata normal form. 16/4014 useless extension candidates. Maximal degree in co-relation 16581. Up to 3557 conditions per place. [2022-12-13 15:16:27,417 INFO L137 encePairwiseOnDemand]: 319/328 looper letters, 87 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2022-12-13 15:16:27,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 103 transitions, 1060 flow [2022-12-13 15:16:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:16:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 15:16:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 991 transitions. [2022-12-13 15:16:27,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3776676829268293 [2022-12-13 15:16:27,419 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 991 transitions. [2022-12-13 15:16:27,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 991 transitions. [2022-12-13 15:16:27,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:27,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 991 transitions. [2022-12-13 15:16:27,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:27,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 328.0) internal successors, (2952), 9 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:27,423 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 328.0) internal successors, (2952), 9 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:27,423 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 654 flow. Second operand 8 states and 991 transitions. [2022-12-13 15:16:27,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 103 transitions, 1060 flow [2022-12-13 15:16:27,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 103 transitions, 1020 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 15:16:27,473 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 752 flow [2022-12-13 15:16:27,473 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=752, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2022-12-13 15:16:27,473 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2022-12-13 15:16:27,473 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 752 flow [2022-12-13 15:16:27,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.55555555555556) internal successors, (1058), 9 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:27,474 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:27,474 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:27,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 15:16:27,474 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1661224624, now seen corresponding path program 2 times [2022-12-13 15:16:27,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:27,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600188857] [2022-12-13 15:16:27,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:27,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:28,220 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 15:16:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:28,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600188857] [2022-12-13 15:16:28,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600188857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:28,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:28,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:16:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142358207] [2022-12-13 15:16:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:28,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:16:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:28,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:16:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:16:28,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 328 [2022-12-13 15:16:28,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 752 flow. Second operand has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:28,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:28,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 328 [2022-12-13 15:16:28,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:29,329 INFO L130 PetriNetUnfolder]: 2748/4454 cut-off events. [2022-12-13 15:16:29,329 INFO L131 PetriNetUnfolder]: For 12574/12584 co-relation queries the response was YES. [2022-12-13 15:16:29,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18083 conditions, 4454 events. 2748/4454 cut-off events. For 12574/12584 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 28757 event pairs, 778 based on Foata normal form. 14/4418 useless extension candidates. Maximal degree in co-relation 18059. Up to 3575 conditions per place. [2022-12-13 15:16:29,347 INFO L137 encePairwiseOnDemand]: 319/328 looper letters, 89 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2022-12-13 15:16:29,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 1196 flow [2022-12-13 15:16:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 15:16:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 15:16:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1092 transitions. [2022-12-13 15:16:29,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2022-12-13 15:16:29,351 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1092 transitions. [2022-12-13 15:16:29,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1092 transitions. [2022-12-13 15:16:29,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:29,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1092 transitions. [2022-12-13 15:16:29,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.33333333333333) internal successors, (1092), 9 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:29,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 328.0) internal successors, (3280), 10 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:29,357 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 328.0) internal successors, (3280), 10 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:29,357 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 752 flow. Second operand 9 states and 1092 transitions. [2022-12-13 15:16:29,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 1196 flow [2022-12-13 15:16:29,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 114 transitions, 1192 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 15:16:29,430 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 934 flow [2022-12-13 15:16:29,430 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=934, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2022-12-13 15:16:29,430 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 22 predicate places. [2022-12-13 15:16:29,431 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 934 flow [2022-12-13 15:16:29,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:29,432 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:29,432 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:29,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 15:16:29,432 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1058474622, now seen corresponding path program 3 times [2022-12-13 15:16:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:29,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925492595] [2022-12-13 15:16:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:30,215 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 15:16:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:30,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925492595] [2022-12-13 15:16:30,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925492595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:30,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:30,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:16:30,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695897260] [2022-12-13 15:16:30,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:30,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:16:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:30,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:16:30,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:16:30,443 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 328 [2022-12-13 15:16:30,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 934 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:30,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:30,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 328 [2022-12-13 15:16:30,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:31,400 INFO L130 PetriNetUnfolder]: 2736/4441 cut-off events. [2022-12-13 15:16:31,401 INFO L131 PetriNetUnfolder]: For 15097/15109 co-relation queries the response was YES. [2022-12-13 15:16:31,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18867 conditions, 4441 events. 2736/4441 cut-off events. For 15097/15109 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 28781 event pairs, 278 based on Foata normal form. 16/4414 useless extension candidates. Maximal degree in co-relation 18837. Up to 2969 conditions per place. [2022-12-13 15:16:31,419 INFO L137 encePairwiseOnDemand]: 320/328 looper letters, 94 selfloop transitions, 41 changer transitions 1/139 dead transitions. [2022-12-13 15:16:31,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 139 transitions, 1551 flow [2022-12-13 15:16:31,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:16:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 15:16:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1346 transitions. [2022-12-13 15:16:31,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.373059866962306 [2022-12-13 15:16:31,422 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1346 transitions. [2022-12-13 15:16:31,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1346 transitions. [2022-12-13 15:16:31,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:31,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1346 transitions. [2022-12-13 15:16:31,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.36363636363636) internal successors, (1346), 11 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:31,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 328.0) internal successors, (3936), 12 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:31,426 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 328.0) internal successors, (3936), 12 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:31,426 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 934 flow. Second operand 11 states and 1346 transitions. [2022-12-13 15:16:31,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 139 transitions, 1551 flow [2022-12-13 15:16:31,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 139 transitions, 1529 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:31,500 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 1200 flow [2022-12-13 15:16:31,500 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1200, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2022-12-13 15:16:31,500 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 34 predicate places. [2022-12-13 15:16:31,500 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 1200 flow [2022-12-13 15:16:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:31,500 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:31,501 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 15:16:31,501 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:31,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1066400311, now seen corresponding path program 1 times [2022-12-13 15:16:31,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:31,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484540796] [2022-12-13 15:16:31,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:31,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:31,541 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 15:16:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:31,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484540796] [2022-12-13 15:16:31,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484540796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:31,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:16:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812837101] [2022-12-13 15:16:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:31,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:16:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:16:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:16:31,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 328 [2022-12-13 15:16:31,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 1200 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 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 15:16:31,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:31,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 328 [2022-12-13 15:16:31,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:32,209 INFO L130 PetriNetUnfolder]: 2591/4138 cut-off events. [2022-12-13 15:16:32,209 INFO L131 PetriNetUnfolder]: For 18097/18105 co-relation queries the response was YES. [2022-12-13 15:16:32,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18703 conditions, 4138 events. 2591/4138 cut-off events. For 18097/18105 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 25973 event pairs, 1444 based on Foata normal form. 95/4201 useless extension candidates. Maximal degree in co-relation 18669. Up to 3179 conditions per place. [2022-12-13 15:16:32,226 INFO L137 encePairwiseOnDemand]: 317/328 looper letters, 63 selfloop transitions, 37 changer transitions 2/105 dead transitions. [2022-12-13 15:16:32,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 1453 flow [2022-12-13 15:16:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:16:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:16:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2022-12-13 15:16:32,227 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2022-12-13 15:16:32,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2022-12-13 15:16:32,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2022-12-13 15:16:32,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:32,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2022-12-13 15:16:32,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,229 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,229 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 1200 flow. Second operand 4 states and 536 transitions. [2022-12-13 15:16:32,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 1453 flow [2022-12-13 15:16:32,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 105 transitions, 1405 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 15:16:32,307 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 1307 flow [2022-12-13 15:16:32,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1307, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2022-12-13 15:16:32,307 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 35 predicate places. [2022-12-13 15:16:32,307 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 1307 flow [2022-12-13 15:16:32,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 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 15:16:32,308 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:32,308 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:32,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 15:16:32,308 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:32,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1224198810, now seen corresponding path program 1 times [2022-12-13 15:16:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:32,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942219836] [2022-12-13 15:16:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:32,400 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 15:16:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:32,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942219836] [2022-12-13 15:16:32,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942219836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:32,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:32,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:16:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660143348] [2022-12-13 15:16:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:32,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:16:32,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:32,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:16:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:16:32,405 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 328 [2022-12-13 15:16:32,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 1307 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:32,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 328 [2022-12-13 15:16:32,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:32,756 INFO L130 PetriNetUnfolder]: 1082/2063 cut-off events. [2022-12-13 15:16:32,756 INFO L131 PetriNetUnfolder]: For 13580/13599 co-relation queries the response was YES. [2022-12-13 15:16:32,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9843 conditions, 2063 events. 1082/2063 cut-off events. For 13580/13599 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13560 event pairs, 240 based on Foata normal form. 51/2098 useless extension candidates. Maximal degree in co-relation 9807. Up to 1691 conditions per place. [2022-12-13 15:16:32,765 INFO L137 encePairwiseOnDemand]: 323/328 looper letters, 77 selfloop transitions, 4 changer transitions 19/120 dead transitions. [2022-12-13 15:16:32,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 120 transitions, 1681 flow [2022-12-13 15:16:32,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:16:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:16:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2022-12-13 15:16:32,766 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2022-12-13 15:16:32,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2022-12-13 15:16:32,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2022-12-13 15:16:32,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:32,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2022-12-13 15:16:32,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 328.0) internal successors, (1312), 4 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,768 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 1307 flow. Second operand 3 states and 424 transitions. [2022-12-13 15:16:32,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 120 transitions, 1681 flow [2022-12-13 15:16:32,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 120 transitions, 1643 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:16:32,795 INFO L231 Difference]: Finished difference. Result has 107 places, 80 transitions, 1011 flow [2022-12-13 15:16:32,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1011, PETRI_PLACES=107, PETRI_TRANSITIONS=80} [2022-12-13 15:16:32,796 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 36 predicate places. [2022-12-13 15:16:32,796 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 80 transitions, 1011 flow [2022-12-13 15:16:32,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,796 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:32,796 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 15:16:32,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 15:16:32,796 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1360252090, now seen corresponding path program 1 times [2022-12-13 15:16:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:32,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321636191] [2022-12-13 15:16:32,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:32,906 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 15:16:32,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:32,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321636191] [2022-12-13 15:16:32,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321636191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:32,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:32,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:16:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298706853] [2022-12-13 15:16:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:32,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:16:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:32,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:16:32,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:16:32,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 328 [2022-12-13 15:16:32,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 80 transitions, 1011 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:32,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:32,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 328 [2022-12-13 15:16:32,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:33,132 INFO L130 PetriNetUnfolder]: 351/808 cut-off events. [2022-12-13 15:16:33,132 INFO L131 PetriNetUnfolder]: For 4398/4403 co-relation queries the response was YES. [2022-12-13 15:16:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 808 events. 351/808 cut-off events. For 4398/4403 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4658 event pairs, 44 based on Foata normal form. 59/857 useless extension candidates. Maximal degree in co-relation 3861. Up to 437 conditions per place. [2022-12-13 15:16:33,135 INFO L137 encePairwiseOnDemand]: 323/328 looper letters, 71 selfloop transitions, 7 changer transitions 24/113 dead transitions. [2022-12-13 15:16:33,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 113 transitions, 1453 flow [2022-12-13 15:16:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:16:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:16:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2022-12-13 15:16:33,136 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4291158536585366 [2022-12-13 15:16:33,136 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2022-12-13 15:16:33,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2022-12-13 15:16:33,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:33,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2022-12-13 15:16:33,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,138 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,138 INFO L175 Difference]: Start difference. First operand has 107 places, 80 transitions, 1011 flow. Second operand 4 states and 563 transitions. [2022-12-13 15:16:33,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 113 transitions, 1453 flow [2022-12-13 15:16:33,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 113 transitions, 1351 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 15:16:33,148 INFO L231 Difference]: Finished difference. Result has 104 places, 59 transitions, 551 flow [2022-12-13 15:16:33,148 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=551, PETRI_PLACES=104, PETRI_TRANSITIONS=59} [2022-12-13 15:16:33,149 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 33 predicate places. [2022-12-13 15:16:33,149 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 59 transitions, 551 flow [2022-12-13 15:16:33,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,149 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:33,149 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 15:16:33,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 15:16:33,149 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:33,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1778456539, now seen corresponding path program 1 times [2022-12-13 15:16:33,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:33,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274448638] [2022-12-13 15:16:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:33,253 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 15:16:33,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:33,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274448638] [2022-12-13 15:16:33,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274448638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:33,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:33,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:16:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118790776] [2022-12-13 15:16:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:33,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:16:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:16:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:16:33,260 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 328 [2022-12-13 15:16:33,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 59 transitions, 551 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:33,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 328 [2022-12-13 15:16:33,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:33,586 INFO L130 PetriNetUnfolder]: 739/1571 cut-off events. [2022-12-13 15:16:33,586 INFO L131 PetriNetUnfolder]: For 6098/6100 co-relation queries the response was YES. [2022-12-13 15:16:33,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6814 conditions, 1571 events. 739/1571 cut-off events. For 6098/6100 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9758 event pairs, 171 based on Foata normal form. 11/1570 useless extension candidates. Maximal degree in co-relation 6781. Up to 654 conditions per place. [2022-12-13 15:16:33,591 INFO L137 encePairwiseOnDemand]: 325/328 looper letters, 87 selfloop transitions, 3 changer transitions 15/113 dead transitions. [2022-12-13 15:16:33,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 113 transitions, 1226 flow [2022-12-13 15:16:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:16:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:16:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 567 transitions. [2022-12-13 15:16:33,592 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4321646341463415 [2022-12-13 15:16:33,592 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 567 transitions. [2022-12-13 15:16:33,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 567 transitions. [2022-12-13 15:16:33,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:33,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 567 transitions. [2022-12-13 15:16:33,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,594 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,594 INFO L175 Difference]: Start difference. First operand has 104 places, 59 transitions, 551 flow. Second operand 4 states and 567 transitions. [2022-12-13 15:16:33,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 113 transitions, 1226 flow [2022-12-13 15:16:33,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 1085 flow, removed 8 selfloop flow, removed 15 redundant places. [2022-12-13 15:16:33,604 INFO L231 Difference]: Finished difference. Result has 94 places, 58 transitions, 472 flow [2022-12-13 15:16:33,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=472, PETRI_PLACES=94, PETRI_TRANSITIONS=58} [2022-12-13 15:16:33,605 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 23 predicate places. [2022-12-13 15:16:33,605 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 58 transitions, 472 flow [2022-12-13 15:16:33,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:33,605 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 15:16:33,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 15:16:33,605 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1477606043, now seen corresponding path program 2 times [2022-12-13 15:16:33,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:33,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234859151] [2022-12-13 15:16:33,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:16:33,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:33,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234859151] [2022-12-13 15:16:33,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234859151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:33,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:33,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:16:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567882438] [2022-12-13 15:16:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:33,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:16:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:16:33,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:16:33,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 328 [2022-12-13 15:16:33,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 58 transitions, 472 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:33,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:33,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 328 [2022-12-13 15:16:33,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:34,096 INFO L130 PetriNetUnfolder]: 922/2016 cut-off events. [2022-12-13 15:16:34,096 INFO L131 PetriNetUnfolder]: For 5622/5624 co-relation queries the response was YES. [2022-12-13 15:16:34,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8094 conditions, 2016 events. 922/2016 cut-off events. For 5622/5624 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13549 event pairs, 366 based on Foata normal form. 11/2017 useless extension candidates. Maximal degree in co-relation 8066. Up to 1170 conditions per place. [2022-12-13 15:16:34,102 INFO L137 encePairwiseOnDemand]: 324/328 looper letters, 90 selfloop transitions, 6 changer transitions 20/124 dead transitions. [2022-12-13 15:16:34,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 124 transitions, 1158 flow [2022-12-13 15:16:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:16:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:16:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2022-12-13 15:16:34,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4317073170731707 [2022-12-13 15:16:34,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2022-12-13 15:16:34,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2022-12-13 15:16:34,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:34,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2022-12-13 15:16:34,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:34,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 328.0) internal successors, (1968), 6 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:34,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 328.0) internal successors, (1968), 6 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:34,106 INFO L175 Difference]: Start difference. First operand has 94 places, 58 transitions, 472 flow. Second operand 5 states and 708 transitions. [2022-12-13 15:16:34,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 124 transitions, 1158 flow [2022-12-13 15:16:34,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 1099 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 15:16:34,117 INFO L231 Difference]: Finished difference. Result has 96 places, 61 transitions, 479 flow [2022-12-13 15:16:34,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=479, PETRI_PLACES=96, PETRI_TRANSITIONS=61} [2022-12-13 15:16:34,117 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 25 predicate places. [2022-12-13 15:16:34,117 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 61 transitions, 479 flow [2022-12-13 15:16:34,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:34,117 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:34,117 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 15:16:34,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 15:16:34,118 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1240492419, now seen corresponding path program 3 times [2022-12-13 15:16:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:34,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857830951] [2022-12-13 15:16:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:16:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:16:34,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857830951] [2022-12-13 15:16:34,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857830951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:16:34,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:16:34,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:16:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105124313] [2022-12-13 15:16:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:16:34,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:16:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:16:34,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:16:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:16:34,226 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 328 [2022-12-13 15:16:34,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 61 transitions, 479 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 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 15:16:34,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:16:34,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 328 [2022-12-13 15:16:34,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:16:34,417 INFO L130 PetriNetUnfolder]: 387/887 cut-off events. [2022-12-13 15:16:34,417 INFO L131 PetriNetUnfolder]: For 2470/2584 co-relation queries the response was YES. [2022-12-13 15:16:34,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 887 events. 387/887 cut-off events. For 2470/2584 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5744 event pairs, 43 based on Foata normal form. 158/992 useless extension candidates. Maximal degree in co-relation 3509. Up to 339 conditions per place. [2022-12-13 15:16:34,419 INFO L137 encePairwiseOnDemand]: 323/328 looper letters, 49 selfloop transitions, 10 changer transitions 17/84 dead transitions. [2022-12-13 15:16:34,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 84 transitions, 785 flow [2022-12-13 15:16:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:16:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:16:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2022-12-13 15:16:34,420 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2022-12-13 15:16:34,421 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2022-12-13 15:16:34,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2022-12-13 15:16:34,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:16:34,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2022-12-13 15:16:34,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:34,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 328.0) internal successors, (1968), 6 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:34,423 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 328.0) internal successors, (1968), 6 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:16:34,423 INFO L175 Difference]: Start difference. First operand has 96 places, 61 transitions, 479 flow. Second operand 5 states and 690 transitions. [2022-12-13 15:16:34,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 84 transitions, 785 flow [2022-12-13 15:16:34,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 696 flow, removed 12 selfloop flow, removed 12 redundant places. [2022-12-13 15:16:34,426 INFO L231 Difference]: Finished difference. Result has 82 places, 46 transitions, 335 flow [2022-12-13 15:16:34,426 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=82, PETRI_TRANSITIONS=46} [2022-12-13 15:16:34,426 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, 11 predicate places. [2022-12-13 15:16:34,427 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 46 transitions, 335 flow [2022-12-13 15:16:34,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 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 15:16:34,427 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:16:34,427 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 15:16:34,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 15:16:34,427 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:16:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1660797385, now seen corresponding path program 1 times [2022-12-13 15:16:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:16:34,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047134709] [2022-12-13 15:16:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:16:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:16:34,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:16:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:16:34,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:16:34,522 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:16:34,522 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-12-13 15:16:34,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-12-13 15:16:34,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-12-13 15:16:34,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-12-13 15:16:34,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-12-13 15:16:34,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2022-12-13 15:16:34,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2022-12-13 15:16:34,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2022-12-13 15:16:34,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2022-12-13 15:16:34,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 15:16:34,529 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:34,533 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:16:34,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:16:34,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:16:34 BasicIcfg [2022-12-13 15:16:34,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:16:34,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:16:34,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:16:34,579 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:16:34,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:16:03" (3/4) ... [2022-12-13 15:16:34,581 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:16:34,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:16:34,582 INFO L158 Benchmark]: Toolchain (without parser) took 32057.01ms. Allocated memory was 115.3MB in the beginning and 914.4MB in the end (delta: 799.0MB). Free memory was 78.4MB in the beginning and 723.6MB in the end (delta: -645.2MB). Peak memory consumption was 157.0MB. Max. memory is 16.1GB. [2022-12-13 15:16:34,582 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:16:34,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.81ms. Allocated memory is still 115.3MB. Free memory was 78.4MB in the beginning and 51.8MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 15:16:34,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.75ms. Allocated memory is still 115.3MB. Free memory was 51.8MB in the beginning and 49.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:16:34,582 INFO L158 Benchmark]: Boogie Preprocessor took 23.43ms. Allocated memory is still 115.3MB. Free memory was 49.4MB in the beginning and 47.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:16:34,583 INFO L158 Benchmark]: RCFGBuilder took 748.79ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 47.3MB in the beginning and 84.6MB in the end (delta: -37.3MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2022-12-13 15:16:34,583 INFO L158 Benchmark]: TraceAbstraction took 30898.43ms. Allocated memory was 153.1MB in the beginning and 914.4MB in the end (delta: 761.3MB). Free memory was 83.6MB in the beginning and 724.6MB in the end (delta: -641.0MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. [2022-12-13 15:16:34,583 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 914.4MB. Free memory was 724.6MB in the beginning and 723.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:16:34,584 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.14ms. Allocated memory is still 115.3MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.81ms. Allocated memory is still 115.3MB. Free memory was 78.4MB in the beginning and 51.8MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.75ms. Allocated memory is still 115.3MB. Free memory was 51.8MB in the beginning and 49.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.43ms. Allocated memory is still 115.3MB. Free memory was 49.4MB in the beginning and 47.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 748.79ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 47.3MB in the beginning and 84.6MB in the end (delta: -37.3MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30898.43ms. Allocated memory was 153.1MB in the beginning and 914.4MB in the end (delta: 761.3MB). Free memory was 83.6MB in the beginning and 724.6MB in the end (delta: -641.0MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 914.4MB. Free memory was 724.6MB in the beginning and 723.6MB in the end (delta: 1.1MB). 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: 9.2s, 174 PlacesBefore, 71 PlacesAfterwards, 166 TransitionsBefore, 62 TransitionsAfterwards, 5336 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 159 TotalNumberOfCompositions, 19340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6204, independent: 5815, independent conditional: 0, independent unconditional: 5815, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2414, independent: 2339, independent conditional: 0, independent unconditional: 2339, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6204, independent: 3476, independent conditional: 0, independent unconditional: 3476, dependent: 314, dependent conditional: 0, dependent unconditional: 314, unknown: 2414, unknown conditional: 0, unknown unconditional: 2414] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((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_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$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2097, ((void *)0), P0, ((void *)0))=-3, t2097={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t2098; 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_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$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097={7:0}, t2098={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] 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)))) [L766] EXPR 1 \read(y) [L766] 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)))) [L766] 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)))) [L767] 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)))) [L768] 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)))) [L769] 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)))) [L770] 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)))) [L771] 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)))) [L772] 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)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 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_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$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = 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_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$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] FCALL, FORK 0 pthread_create(&t2098, ((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_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$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2098, ((void *)0), P1, ((void *)0))=-2, t2097={7:0}, t2098={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 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_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$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_p0_EBX=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=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 pthread_t t2099; [L840] FCALL, FORK 0 pthread_create(&t2099, ((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_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$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_p0_EBX=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(&t2099, ((void *)0), P2, ((void *)0))=-1, t2097={7:0}, t2098={8:0}, t2099={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_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$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_p0_EBX=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=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_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$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_p0_EBX=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=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_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$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_p0_EBX=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=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_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$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_p0_EBX=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=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 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; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] 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) [L846] 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) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 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 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 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}, __unbuffered_cnt=3, __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_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$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_p0_EBX=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=1, main$tmp_guard1=0, t2097={7:0}, t2098={8:0}, t2099={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L857] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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_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$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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice1=1, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 215 locations, 61 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: 30.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2370 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1746 mSDsluCounter, 890 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 609 mSDsCounter, 353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4945 IncrementalHoareTripleChecker+Invalid, 5298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 353 mSolverCounterUnsat, 281 mSDtfsCounter, 4945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1307occurred in iteration=19, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 2583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 15:16:34,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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_a4a71110-0589-44e5-a05d-851e7551fbe0/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 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b --- 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 15:16:36,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:16:36,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:16:36,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:16:36,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:16:36,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:16:36,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:16:36,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:16:36,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:16:36,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:16:36,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:16:36,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:16:36,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:16:36,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:16:36,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:16:36,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:16:36,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:16:36,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:16:36,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:16:36,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:16:36,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:16:36,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:16:36,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:16:36,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:16:36,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:16:36,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:16:36,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:16:36,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:16:36,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:16:36,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:16:36,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:16:36,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:16:36,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:16:36,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:16:36,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:16:36,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:16:36,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:16:36,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:16:36,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:16:36,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:16:36,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:16:36,257 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 15:16:36,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:16:36,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:16:36,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:16:36,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:16:36,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:16:36,282 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:16:36,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:16:36,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:16:36,283 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:16:36,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:16:36,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:16:36,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:16:36,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:16:36,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:16:36,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:16:36,284 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:16:36,284 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:16:36,284 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:16:36,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:16:36,285 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:16:36,285 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 15:16:36,285 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 15:16:36,285 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:16:36,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:16:36,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:16:36,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:16:36,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:16:36,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:16:36,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:16:36,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:16:36,286 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 15:16:36,286 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 15:16:36,286 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:16:36,286 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:16:36,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:16:36,287 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 15:16:36,287 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:16:36,287 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_a4a71110-0589-44e5-a05d-851e7551fbe0/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_a4a71110-0589-44e5-a05d-851e7551fbe0/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 -> 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b [2022-12-13 15:16:36,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:16:36,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:16:36,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:16:36,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:16:36,528 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:16:36,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2022-12-13 15:16:39,118 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:16:39,339 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:16:39,339 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2022-12-13 15:16:39,351 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/data/0e9123251/ed1d2dabf2e04c94b5496d1c306dd9e8/FLAGf445e898f [2022-12-13 15:16:39,673 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/data/0e9123251/ed1d2dabf2e04c94b5496d1c306dd9e8 [2022-12-13 15:16:39,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:16:39,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:16:39,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:16:39,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:16:39,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:16:39,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:16:39" (1/1) ... [2022-12-13 15:16:39,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed548cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:39, skipping insertion in model container [2022-12-13 15:16:39,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:16:39" (1/1) ... [2022-12-13 15:16:39,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:16:39,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:16:39,852 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_a4a71110-0589-44e5-a05d-851e7551fbe0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2022-12-13 15:16:39,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:39,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:39,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:39,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:39,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:39,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:39,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:39,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:39,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:39,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:39,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:16:40,032 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:16:40,044 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_a4a71110-0589-44e5-a05d-851e7551fbe0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2022-12-13 15:16:40,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:16:40,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:16:40,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:16:40,142 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:16:40,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40 WrapperNode [2022-12-13 15:16:40,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:16:40,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:16:40,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:16:40,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:16:40,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,178 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 15:16:40,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:16:40,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:16:40,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:16:40,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:16:40,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,199 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:16:40,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:16:40,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:16:40,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:16:40,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (1/1) ... [2022-12-13 15:16:40,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:16:40,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:16:40,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:16:40,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:16:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:16:40,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:16:40,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:16:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:16:40,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:16:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:16:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:16:40,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:16:40,259 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 15:16:40,388 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:16:40,389 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:16:40,840 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:16:41,192 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:16:41,192 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:16:41,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:16:41 BoogieIcfgContainer [2022-12-13 15:16:41,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:16:41,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:16:41,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:16:41,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:16:41,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:16:39" (1/3) ... [2022-12-13 15:16:41,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f6b874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:16:41, skipping insertion in model container [2022-12-13 15:16:41,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:40" (2/3) ... [2022-12-13 15:16:41,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f6b874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:16:41, skipping insertion in model container [2022-12-13 15:16:41,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:16:41" (3/3) ... [2022-12-13 15:16:41,202 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2022-12-13 15:16:41,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:16:41,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-12-13 15:16:41,222 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:16:41,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:16:41,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 170 transitions, 355 flow [2022-12-13 15:16:41,424 INFO L130 PetriNetUnfolder]: 2/167 cut-off events. [2022-12-13 15:16:41,425 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:16:41,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 167 events. 2/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 216 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-13 15:16:41,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 170 transitions, 355 flow [2022-12-13 15:16:41,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 167 transitions, 343 flow [2022-12-13 15:16:41,439 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:16:41,449 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 167 transitions, 343 flow [2022-12-13 15:16:41,452 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 167 transitions, 343 flow [2022-12-13 15:16:41,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 167 transitions, 343 flow [2022-12-13 15:16:41,490 INFO L130 PetriNetUnfolder]: 2/167 cut-off events. [2022-12-13 15:16:41,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:16:41,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 167 events. 2/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-13 15:16:41,493 INFO L119 LiptonReduction]: Number of co-enabled transitions 5336 [2022-12-13 15:16:50,161 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 195 DAG size of output: 194 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 15:16:57,025 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 223 DAG size of output: 221 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 15:17:06,601 INFO L134 LiptonReduction]: Checked pairs total: 21359 [2022-12-13 15:17:06,601 INFO L136 LiptonReduction]: Total number of compositions: 154 [2022-12-13 15:17:06,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:17:06,618 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;@58edd3fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:17:06,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-12-13 15:17:06,620 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 15:17:06,620 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:17:06,620 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:06,621 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:17:06,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash 937, now seen corresponding path program 1 times [2022-12-13 15:17:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:06,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147147714] [2022-12-13 15:17:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:06,638 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 15:17:06,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:06,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:06,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:06,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 15:17:06,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:06,712 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 15:17:06,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:06,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:06,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147147714] [2022-12-13 15:17:06,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147147714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:06,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:06,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:17:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968819276] [2022-12-13 15:17:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:06,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:17:06,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:06,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:17:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:17:06,739 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 324 [2022-12-13 15:17:06,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:06,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:06,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 324 [2022-12-13 15:17:06,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:07,773 INFO L130 PetriNetUnfolder]: 4396/6524 cut-off events. [2022-12-13 15:17:07,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:17:07,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12918 conditions, 6524 events. 4396/6524 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 40904 event pairs, 4396 based on Foata normal form. 0/3578 useless extension candidates. Maximal degree in co-relation 12907. Up to 6348 conditions per place. [2022-12-13 15:17:07,808 INFO L137 encePairwiseOnDemand]: 303/324 looper letters, 35 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2022-12-13 15:17:07,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 159 flow [2022-12-13 15:17:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:17:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:17:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 324 transitions. [2022-12-13 15:17:07,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 15:17:07,818 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 324 transitions. [2022-12-13 15:17:07,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 324 transitions. [2022-12-13 15:17:07,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:07,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 324 transitions. [2022-12-13 15:17:07,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 162.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:07,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:07,828 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:07,829 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 324 transitions. [2022-12-13 15:17:07,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 159 flow [2022-12-13 15:17:07,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:17:07,833 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2022-12-13 15:17:07,835 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 15:17:07,838 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2022-12-13 15:17:07,838 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2022-12-13 15:17:07,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:07,838 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:07,838 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:17:07,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:08,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:08,040 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:08,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash 923496, now seen corresponding path program 1 times [2022-12-13 15:17:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:08,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532876736] [2022-12-13 15:17:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:08,041 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 15:17:08,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:08,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:08,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:08,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:17:08,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:08,217 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:17:08,218 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 15:17:08,240 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 15:17:08,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:08,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:08,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532876736] [2022-12-13 15:17:08,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532876736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:08,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:08,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:17:08,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768780292] [2022-12-13 15:17:08,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:08,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:17:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:17:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:17:08,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 324 [2022-12-13 15:17:08,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:08,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:08,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 324 [2022-12-13 15:17:08,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:09,068 INFO L130 PetriNetUnfolder]: 3050/4477 cut-off events. [2022-12-13 15:17:09,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:17:09,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8969 conditions, 4477 events. 3050/4477 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 25550 event pairs, 1930 based on Foata normal form. 108/2933 useless extension candidates. Maximal degree in co-relation 8966. Up to 2501 conditions per place. [2022-12-13 15:17:09,085 INFO L137 encePairwiseOnDemand]: 316/324 looper letters, 44 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-12-13 15:17:09,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 196 flow [2022-12-13 15:17:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:17:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:17:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 15:17:09,088 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4547325102880658 [2022-12-13 15:17:09,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 15:17:09,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 15:17:09,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:09,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 15:17:09,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:09,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:09,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:09,091 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 442 transitions. [2022-12-13 15:17:09,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 196 flow [2022-12-13 15:17:09,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:17:09,092 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 96 flow [2022-12-13 15:17:09,093 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-12-13 15:17:09,093 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2022-12-13 15:17:09,093 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 96 flow [2022-12-13 15:17:09,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:09,094 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:09,094 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:17:09,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:09,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:09,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash 923497, now seen corresponding path program 1 times [2022-12-13 15:17:09,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:09,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544755197] [2022-12-13 15:17:09,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:09,300 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 15:17:09,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:09,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:09,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:09,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:17:09,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:09,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:17:09,511 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 15:17:09,531 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 15:17:09,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:09,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:09,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544755197] [2022-12-13 15:17:09,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544755197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:09,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:09,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:17:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225051720] [2022-12-13 15:17:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:09,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:17:09,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:17:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:17:09,598 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 324 [2022-12-13 15:17:09,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:09,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:09,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 324 [2022-12-13 15:17:09,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:10,039 INFO L130 PetriNetUnfolder]: 991/1567 cut-off events. [2022-12-13 15:17:10,039 INFO L131 PetriNetUnfolder]: For 60/78 co-relation queries the response was YES. [2022-12-13 15:17:10,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 1567 events. 991/1567 cut-off events. For 60/78 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8166 event pairs, 991 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 3315. Up to 1496 conditions per place. [2022-12-13 15:17:10,044 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 26 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2022-12-13 15:17:10,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 138 flow [2022-12-13 15:17:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:17:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:17:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2022-12-13 15:17:10,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 15:17:10,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2022-12-13 15:17:10,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2022-12-13 15:17:10,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:10,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2022-12-13 15:17:10,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,051 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 96 flow. Second operand 3 states and 432 transitions. [2022-12-13 15:17:10,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 138 flow [2022-12-13 15:17:10,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:17:10,053 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 82 flow [2022-12-13 15:17:10,053 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 15:17:10,053 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -28 predicate places. [2022-12-13 15:17:10,053 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 82 flow [2022-12-13 15:17:10,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:10,054 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:17:10,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:10,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:10,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1262014222, now seen corresponding path program 1 times [2022-12-13 15:17:10,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:10,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967506155] [2022-12-13 15:17:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:10,261 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 15:17:10,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:10,264 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:10,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:10,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:17:10,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:10,468 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 15:17:10,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:10,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:10,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967506155] [2022-12-13 15:17:10,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967506155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:10,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:10,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:17:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913967350] [2022-12-13 15:17:10,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:10,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:17:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:10,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:17:10,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:17:10,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 324 [2022-12-13 15:17:10,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:10,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 324 [2022-12-13 15:17:10,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:10,714 INFO L130 PetriNetUnfolder]: 517/902 cut-off events. [2022-12-13 15:17:10,714 INFO L131 PetriNetUnfolder]: For 25/35 co-relation queries the response was YES. [2022-12-13 15:17:10,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 902 events. 517/902 cut-off events. For 25/35 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4562 event pairs, 160 based on Foata normal form. 12/777 useless extension candidates. Maximal degree in co-relation 1884. Up to 806 conditions per place. [2022-12-13 15:17:10,717 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 36 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-12-13 15:17:10,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 192 flow [2022-12-13 15:17:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:17:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:17:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-12-13 15:17:10,719 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4434156378600823 [2022-12-13 15:17:10,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-12-13 15:17:10,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-12-13 15:17:10,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:10,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-12-13 15:17:10,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,724 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 82 flow. Second operand 3 states and 431 transitions. [2022-12-13 15:17:10,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 192 flow [2022-12-13 15:17:10,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:17:10,725 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 107 flow [2022-12-13 15:17:10,725 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 15:17:10,726 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2022-12-13 15:17:10,726 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 107 flow [2022-12-13 15:17:10,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:10,726 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:10,726 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:17:10,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:10,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:10,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1982292965, now seen corresponding path program 1 times [2022-12-13 15:17:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:10,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769153784] [2022-12-13 15:17:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:10,933 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 15:17:10,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:10,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:10,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:11,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:17:11,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:11,077 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 15:17:11,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:11,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:11,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769153784] [2022-12-13 15:17:11,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769153784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:11,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:11,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:17:11,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730050248] [2022-12-13 15:17:11,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:11,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:17:11,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:11,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:17:11,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:17:11,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 324 [2022-12-13 15:17:11,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:11,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 324 [2022-12-13 15:17:11,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:11,284 INFO L130 PetriNetUnfolder]: 151/324 cut-off events. [2022-12-13 15:17:11,284 INFO L131 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2022-12-13 15:17:11,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 324 events. 151/324 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1279 event pairs, 39 based on Foata normal form. 16/299 useless extension candidates. Maximal degree in co-relation 795. Up to 181 conditions per place. [2022-12-13 15:17:11,285 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2022-12-13 15:17:11,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 259 flow [2022-12-13 15:17:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:17:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:17:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2022-12-13 15:17:11,287 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44058641975308643 [2022-12-13 15:17:11,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2022-12-13 15:17:11,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2022-12-13 15:17:11,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:11,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2022-12-13 15:17:11,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,291 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,291 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 107 flow. Second operand 4 states and 571 transitions. [2022-12-13 15:17:11,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 259 flow [2022-12-13 15:17:11,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:17:11,292 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 143 flow [2022-12-13 15:17:11,292 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2022-12-13 15:17:11,293 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2022-12-13 15:17:11,293 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 143 flow [2022-12-13 15:17:11,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:11,293 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 15:17:11,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:11,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:11,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash -314337670, now seen corresponding path program 1 times [2022-12-13 15:17:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:11,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982011736] [2022-12-13 15:17:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:11,500 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 15:17:11,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:11,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:11,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:11,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:17:11,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:11,669 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 15:17:11,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:11,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:11,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982011736] [2022-12-13 15:17:11,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982011736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:11,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:11,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:17:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236277900] [2022-12-13 15:17:11,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:11,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:17:11,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:11,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:17:11,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:17:11,680 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 324 [2022-12-13 15:17:11,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:11,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 324 [2022-12-13 15:17:11,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:11,889 INFO L130 PetriNetUnfolder]: 82/175 cut-off events. [2022-12-13 15:17:11,889 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-13 15:17:11,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 175 events. 82/175 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 529 event pairs, 24 based on Foata normal form. 7/175 useless extension candidates. Maximal degree in co-relation 499. Up to 70 conditions per place. [2022-12-13 15:17:11,890 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 36 selfloop transitions, 10 changer transitions 1/51 dead transitions. [2022-12-13 15:17:11,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 261 flow [2022-12-13 15:17:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:17:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:17:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2022-12-13 15:17:11,892 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4308641975308642 [2022-12-13 15:17:11,892 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2022-12-13 15:17:11,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2022-12-13 15:17:11,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:11,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2022-12-13 15:17:11,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,896 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,896 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 143 flow. Second operand 5 states and 698 transitions. [2022-12-13 15:17:11,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 261 flow [2022-12-13 15:17:11,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 245 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 15:17:11,897 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2022-12-13 15:17:11,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 15:17:11,898 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2022-12-13 15:17:11,898 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2022-12-13 15:17:11,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:11,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:11,898 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 15:17:11,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:12,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:12,100 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1763665477, now seen corresponding path program 1 times [2022-12-13 15:17:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:12,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319761869] [2022-12-13 15:17:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:12,105 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 15:17:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:12,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:12,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:12,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:17:12,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:12,271 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 15:17:12,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:12,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:12,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319761869] [2022-12-13 15:17:12,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319761869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:12,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:12,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:17:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054716004] [2022-12-13 15:17:12,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:12,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:17:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:17:12,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:17:12,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 324 [2022-12-13 15:17:12,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:12,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:12,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 324 [2022-12-13 15:17:12,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:12,512 INFO L130 PetriNetUnfolder]: 141/292 cut-off events. [2022-12-13 15:17:12,512 INFO L131 PetriNetUnfolder]: For 353/353 co-relation queries the response was YES. [2022-12-13 15:17:12,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 292 events. 141/292 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1156 event pairs, 61 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 855. Up to 164 conditions per place. [2022-12-13 15:17:12,514 INFO L137 encePairwiseOnDemand]: 320/324 looper letters, 61 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2022-12-13 15:17:12,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 443 flow [2022-12-13 15:17:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:17:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:17:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2022-12-13 15:17:12,516 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42901234567901236 [2022-12-13 15:17:12,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2022-12-13 15:17:12,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2022-12-13 15:17:12,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:12,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2022-12-13 15:17:12,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:12,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:12,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:12,519 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 5 states and 695 transitions. [2022-12-13 15:17:12,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 443 flow [2022-12-13 15:17:12,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 381 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 15:17:12,521 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 131 flow [2022-12-13 15:17:12,521 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-13 15:17:12,522 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2022-12-13 15:17:12,522 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 131 flow [2022-12-13 15:17:12,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:12,522 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:12,522 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 15:17:12,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:12,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:12,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:12,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash -689637249, now seen corresponding path program 2 times [2022-12-13 15:17:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:12,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105978180] [2022-12-13 15:17:12,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:17:12,728 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 15:17:12,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:12,731 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:12,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:12,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 15:17:12,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:17:12,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:17:12,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:12,910 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 15:17:12,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:12,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:12,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105978180] [2022-12-13 15:17:12,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105978180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:12,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:12,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:17:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520718406] [2022-12-13 15:17:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:12,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:17:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:17:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:17:12,920 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 324 [2022-12-13 15:17:12,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:12,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:12,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 324 [2022-12-13 15:17:12,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:13,137 INFO L130 PetriNetUnfolder]: 156/334 cut-off events. [2022-12-13 15:17:13,138 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-12-13 15:17:13,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 334 events. 156/334 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1423 event pairs, 26 based on Foata normal form. 1/328 useless extension candidates. Maximal degree in co-relation 997. Up to 157 conditions per place. [2022-12-13 15:17:13,140 INFO L137 encePairwiseOnDemand]: 320/324 looper letters, 56 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2022-12-13 15:17:13,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 363 flow [2022-12-13 15:17:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:17:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:17:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-12-13 15:17:13,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43364197530864196 [2022-12-13 15:17:13,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-12-13 15:17:13,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-12-13 15:17:13,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:13,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-12-13 15:17:13,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:13,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:13,144 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:13,144 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 131 flow. Second operand 4 states and 562 transitions. [2022-12-13 15:17:13,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 363 flow [2022-12-13 15:17:13,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:17:13,146 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 145 flow [2022-12-13 15:17:13,146 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2022-12-13 15:17:13,146 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2022-12-13 15:17:13,146 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 145 flow [2022-12-13 15:17:13,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:13,147 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:13,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] [2022-12-13 15:17:13,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:13,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:13,349 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:13,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1264361120, now seen corresponding path program 1 times [2022-12-13 15:17:13,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:13,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851578756] [2022-12-13 15:17:13,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:13,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 15:17:13,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:13,355 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:13,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:13,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:17:13,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:17:29,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:29,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:29,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851578756] [2022-12-13 15:17:29,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851578756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:29,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:29,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:17:29,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742866996] [2022-12-13 15:17:29,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:29,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:17:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:17:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:17:29,943 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 324 [2022-12-13 15:17:29,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:29,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:29,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 324 [2022-12-13 15:17:29,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:30,097 INFO L130 PetriNetUnfolder]: 141/323 cut-off events. [2022-12-13 15:17:30,098 INFO L131 PetriNetUnfolder]: For 397/397 co-relation queries the response was YES. [2022-12-13 15:17:30,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 323 events. 141/323 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1435 event pairs, 16 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 934. Up to 221 conditions per place. [2022-12-13 15:17:30,100 INFO L137 encePairwiseOnDemand]: 321/324 looper letters, 46 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-12-13 15:17:30,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 310 flow [2022-12-13 15:17:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:17:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:17:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2022-12-13 15:17:30,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2022-12-13 15:17:30,101 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2022-12-13 15:17:30,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2022-12-13 15:17:30,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:30,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2022-12-13 15:17:30,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:30,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:30,103 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:30,104 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 145 flow. Second operand 4 states and 549 transitions. [2022-12-13 15:17:30,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 310 flow [2022-12-13 15:17:30,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 298 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 15:17:30,105 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 140 flow [2022-12-13 15:17:30,105 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-13 15:17:30,106 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2022-12-13 15:17:30,106 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 140 flow [2022-12-13 15:17:30,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:30,106 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:30,106 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 15:17:30,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:30,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:30,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1868869893, now seen corresponding path program 1 times [2022-12-13 15:17:30,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:30,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001462417] [2022-12-13 15:17:30,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:17:30,312 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 15:17:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:30,315 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:30,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:17:30,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:17:30,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:38,422 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 206 treesize of output 198 [2022-12-13 15:17:38,472 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 15:17:38,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:38,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:38,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001462417] [2022-12-13 15:17:38,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001462417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:38,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:38,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:17:38,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376867656] [2022-12-13 15:17:38,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:38,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:17:38,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:38,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:17:38,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:17:38,527 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 324 [2022-12-13 15:17:38,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:38,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:38,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 324 [2022-12-13 15:17:38,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:38,656 INFO L130 PetriNetUnfolder]: 115/285 cut-off events. [2022-12-13 15:17:38,656 INFO L131 PetriNetUnfolder]: For 342/342 co-relation queries the response was YES. [2022-12-13 15:17:38,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 285 events. 115/285 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1292 event pairs, 12 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 836. Up to 188 conditions per place. [2022-12-13 15:17:38,658 INFO L137 encePairwiseOnDemand]: 321/324 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-12-13 15:17:38,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 290 flow [2022-12-13 15:17:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:17:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:17:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2022-12-13 15:17:38,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43287037037037035 [2022-12-13 15:17:38,659 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2022-12-13 15:17:38,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2022-12-13 15:17:38,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:38,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2022-12-13 15:17:38,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:38,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:38,661 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:38,661 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 140 flow. Second operand 4 states and 561 transitions. [2022-12-13 15:17:38,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 290 flow [2022-12-13 15:17:38,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:17:38,663 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 139 flow [2022-12-13 15:17:38,663 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2022-12-13 15:17:38,663 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2022-12-13 15:17:38,664 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 139 flow [2022-12-13 15:17:38,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:38,664 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:38,664 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 15:17:38,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:38,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:38,866 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash -744193121, now seen corresponding path program 3 times [2022-12-13 15:17:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:38,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004127117] [2022-12-13 15:17:38,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:17:38,869 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 15:17:38,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:38,872 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:38,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 (12)] Waiting until timeout for monitored process [2022-12-13 15:17:39,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 15:17:39,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:17:39,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:17:39,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:17:39,041 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 15:17:39,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:17:39,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:17:39,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004127117] [2022-12-13 15:17:39,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004127117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:17:39,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:17:39,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:17:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409834420] [2022-12-13 15:17:39,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:17:39,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:17:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:17:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:17:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:17:39,050 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 324 [2022-12-13 15:17:39,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:39,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:17:39,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 324 [2022-12-13 15:17:39,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:17:39,245 INFO L130 PetriNetUnfolder]: 263/553 cut-off events. [2022-12-13 15:17:39,246 INFO L131 PetriNetUnfolder]: For 489/489 co-relation queries the response was YES. [2022-12-13 15:17:39,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 553 events. 263/553 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2571 event pairs, 82 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 1695. Up to 240 conditions per place. [2022-12-13 15:17:39,248 INFO L137 encePairwiseOnDemand]: 321/324 looper letters, 58 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-12-13 15:17:39,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 382 flow [2022-12-13 15:17:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:17:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:17:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-12-13 15:17:39,250 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43364197530864196 [2022-12-13 15:17:39,250 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-12-13 15:17:39,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-12-13 15:17:39,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:17:39,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-12-13 15:17:39,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:39,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:39,252 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:39,252 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 139 flow. Second operand 4 states and 562 transitions. [2022-12-13 15:17:39,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 382 flow [2022-12-13 15:17:39,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:17:39,254 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 152 flow [2022-12-13 15:17:39,254 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2022-12-13 15:17:39,255 INFO L288 CegarLoopForPetriNet]: 71 programPoint places, -18 predicate places. [2022-12-13 15:17:39,255 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 152 flow [2022-12-13 15:17:39,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:17:39,255 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:17:39,255 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 15:17:39,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 (12)] Ended with exit code 0 [2022-12-13 15:17:39,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:39,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 15:17:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:17:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1679524541, now seen corresponding path program 4 times [2022-12-13 15:17:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:17:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673118255] [2022-12-13 15:17:39,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:17:39,460 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 15:17:39,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:17:39,463 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:39,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 (13)] Waiting until timeout for monitored process [2022-12-13 15:17:39,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:17:39,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 15:17:39,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:17:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:17:39,829 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 15:17:39,829 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:17:39,830 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-12-13 15:17:39,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-12-13 15:17:39,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-12-13 15:17:39,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-12-13 15:17:39,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-12-13 15:17:39,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-12-13 15:17:39,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-12-13 15:17:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-12-13 15:17:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2022-12-13 15:17:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-12-13 15:17:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2022-12-13 15:17:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2022-12-13 15:17:39,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 (13)] Ended with exit code 0 [2022-12-13 15:17:40,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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 15:17:40,038 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:17:40,054 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:17:40,055 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:17:40,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:17:40 BasicIcfg [2022-12-13 15:17:40,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:17:40,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:17:40,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:17:40,122 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:17:40,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:16:41" (3/4) ... [2022-12-13 15:17:40,124 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:17:40,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:17:40,125 INFO L158 Benchmark]: Toolchain (without parser) took 60448.68ms. Allocated memory was 107.0MB in the beginning and 738.2MB in the end (delta: 631.2MB). Free memory was 83.9MB in the beginning and 535.6MB in the end (delta: -451.7MB). Peak memory consumption was 181.0MB. Max. memory is 16.1GB. [2022-12-13 15:17:40,125 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:17:40,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.37ms. Allocated memory is still 107.0MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2022-12-13 15:17:40,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.54ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:17:40,125 INFO L158 Benchmark]: Boogie Preprocessor took 24.80ms. Allocated memory is still 107.0MB. Free memory was 79.7MB in the beginning and 77.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 15:17:40,126 INFO L158 Benchmark]: RCFGBuilder took 990.58ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 77.0MB in the beginning and 72.4MB in the end (delta: 4.6MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-12-13 15:17:40,126 INFO L158 Benchmark]: TraceAbstraction took 58924.68ms. Allocated memory was 130.0MB in the beginning and 738.2MB in the end (delta: 608.2MB). Free memory was 71.6MB in the beginning and 536.6MB in the end (delta: -465.1MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. [2022-12-13 15:17:40,126 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 738.2MB. Free memory was 536.6MB in the beginning and 535.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:17:40,128 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.13ms. Allocated memory is still 62.9MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.37ms. Allocated memory is still 107.0MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.54ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.80ms. Allocated memory is still 107.0MB. Free memory was 79.7MB in the beginning and 77.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 990.58ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 77.0MB in the beginning and 72.4MB in the end (delta: 4.6MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * TraceAbstraction took 58924.68ms. Allocated memory was 130.0MB in the beginning and 738.2MB in the end (delta: 608.2MB). Free memory was 71.6MB in the beginning and 536.6MB in the end (delta: -465.1MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 738.2MB. Free memory was 536.6MB in the beginning and 535.6MB in the end (delta: 1.0MB). 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: 25.1s, 175 PlacesBefore, 71 PlacesAfterwards, 167 TransitionsBefore, 62 TransitionsAfterwards, 5336 CoEnabledTransitionPairs, 8 FixpointIterations, 70 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 154 TotalNumberOfCompositions, 21359 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6439, independent: 5993, independent conditional: 0, independent unconditional: 5993, dependent: 446, dependent conditional: 0, dependent unconditional: 446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2417, independent: 2340, independent conditional: 0, independent unconditional: 2340, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6439, independent: 3653, independent conditional: 0, independent unconditional: 3653, dependent: 369, dependent conditional: 0, dependent unconditional: 369, unknown: 2417, unknown conditional: 0, unknown unconditional: 2417] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 291, Positive conditional cache size: 0, Positive unconditional cache size: 291, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((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_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$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2097, ((void *)0), P0, ((void *)0))=0, t2097={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] 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)))) [L766] EXPR 1 \read(y) [L766] 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)))) [L766] 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)))) [L767] 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)))) [L768] 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)))) [L769] 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)))) [L770] 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)))) [L771] 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)))) [L772] 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)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 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_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$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_p0_EBX=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t2098; 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_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$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097={7:0}, t2098={14: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = 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_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$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_p0_EBX=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L838] FCALL, FORK 0 pthread_create(&t2098, ((void *)0), P1, ((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_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$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2098, ((void *)0), P1, ((void *)0))=1, t2097={7:0}, t2098={14: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 pthread_t t2099; [L792] 2 x = 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_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$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_p0_EBX=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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t2099, ((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_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$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_p0_EBX=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(&t2099, ((void *)0), P2, ((void *)0))=2, t2097={7:0}, t2098={14:0}, t2099={15: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_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$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_p0_EBX=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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L807] 3 __unbuffered_p2_EAX = x 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_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$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_p0_EBX=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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 y = 1 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_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$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_p0_EBX=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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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}, \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_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$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_p0_EBX=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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] 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) [L846] 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) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 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 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 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}, __unbuffered_cnt=3, __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_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$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_p0_EBX=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=1, main$tmp_guard1=0, t2097={7:0}, t2098={14:0}, t2099={15: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L857] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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_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$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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice1=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 216 locations, 61 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: 58.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 486 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 999 IncrementalHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 36 mSDtfsCounter, 999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=11, 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, 24.7s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1540 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 15:17:40,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a71110-0589-44e5-a05d-851e7551fbe0/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