./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R --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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:38:05,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:38:05,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:38:05,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:38:05,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:38:05,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:38:05,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:38:05,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:38:05,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:38:05,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:38:05,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:38:05,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:38:05,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:38:05,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:38:05,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:38:05,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:38:05,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:38:05,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:38:05,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:38:05,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:38:05,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:38:05,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:38:05,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:38:05,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:38:05,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:38:05,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:38:05,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:38:05,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:38:05,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:38:05,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:38:05,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:38:05,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:38:05,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:38:05,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:38:05,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:38:05,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:38:05,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:38:05,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:38:05,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:38:05,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:38:05,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:38:05,309 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:38:05,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:38:05,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:38:05,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:38:05,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:38:05,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:38:05,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:38:05,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:38:05,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:38:05,355 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:38:05,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:38:05,356 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:38:05,357 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:38:05,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:38:05,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:38:05,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:38:05,357 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:38:05,358 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:38:05,358 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:38:05,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:38:05,358 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:38:05,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:38:05,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:38:05,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:38:05,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:38:05,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:38:05,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:38:05,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:38:05,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:38:05,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:38:05,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:38:05,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:38:05,361 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:38:05,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:38:05,362 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-11-25 17:38:05,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:38:05,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:38:05,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:38:05,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:38:05,677 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:38:05,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-11-25 17:38:08,875 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:38:09,141 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:38:09,146 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-11-25 17:38:09,164 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/data/99d6b43ef/3ee4bcabbebe4147a262eb3686e7ea6a/FLAGaa81be307 [2022-11-25 17:38:09,182 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/data/99d6b43ef/3ee4bcabbebe4147a262eb3686e7ea6a [2022-11-25 17:38:09,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:38:09,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:38:09,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:38:09,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:38:09,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:38:09,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca853c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09, skipping insertion in model container [2022-11-25 17:38:09,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:38:09,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:38:09,536 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-11-25 17:38:09,556 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-11-25 17:38:09,559 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-11-25 17:38:09,559 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-11-25 17:38:09,562 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-11-25 17:38:09,563 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-11-25 17:38:09,565 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-11-25 17:38:09,566 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-11-25 17:38:09,568 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-11-25 17:38:09,569 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-11-25 17:38:09,577 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-11-25 17:38:09,581 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-11-25 17:38:09,582 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-11-25 17:38:09,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:38:09,610 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:38:09,664 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-11-25 17:38:09,666 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-11-25 17:38:09,667 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-11-25 17:38:09,668 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-11-25 17:38:09,671 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-11-25 17:38:09,672 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-11-25 17:38:09,674 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-11-25 17:38:09,675 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-11-25 17:38:09,676 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-11-25 17:38:09,677 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-11-25 17:38:09,679 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-11-25 17:38:09,680 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-11-25 17:38:09,680 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_7f1ce3be-8f64-4488-b486-3fbec65c83c5/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-11-25 17:38:09,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:38:09,708 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:38:09,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09 WrapperNode [2022-11-25 17:38:09,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:38:09,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:38:09,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:38:09,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:38:09,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,769 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2022-11-25 17:38:09,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:38:09,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:38:09,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:38:09,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:38:09,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,803 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:38:09,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:38:09,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:38:09,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:38:09,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (1/1) ... [2022-11-25 17:38:09,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:38:09,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:38:09,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:38:09,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:38:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:38:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:38:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:38:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:38:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:38:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:38:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:38:09,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:38:10,046 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:38:10,048 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:38:10,723 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:38:10,731 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:38:10,737 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-25 17:38:10,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:38:10 BoogieIcfgContainer [2022-11-25 17:38:10,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:38:10,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:38:10,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:38:10,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:38:10,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:38:09" (1/3) ... [2022-11-25 17:38:10,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f115e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:38:10, skipping insertion in model container [2022-11-25 17:38:10,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:38:09" (2/3) ... [2022-11-25 17:38:10,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f115e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:38:10, skipping insertion in model container [2022-11-25 17:38:10,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:38:10" (3/3) ... [2022-11-25 17:38:10,752 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-11-25 17:38:10,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:38:10,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-11-25 17:38:10,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:38:10,826 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;@3faad22a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:38:10,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-25 17:38:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 114 states have (on average 2.175438596491228) internal successors, (248), 194 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 17:38:10,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:10,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 17:38:10,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:10,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-25 17:38:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:10,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631244048] [2022-11-25 17:38:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:11,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631244048] [2022-11-25 17:38:11,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631244048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:11,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:11,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:38:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154630790] [2022-11-25 17:38:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:11,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:11,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:11,177 INFO L87 Difference]: Start difference. First operand has 195 states, 114 states have (on average 2.175438596491228) internal successors, (248), 194 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:11,464 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2022-11-25 17:38:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:11,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 17:38:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:11,486 INFO L225 Difference]: With dead ends: 197 [2022-11-25 17:38:11,486 INFO L226 Difference]: Without dead ends: 193 [2022-11-25 17:38:11,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:11,492 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 188 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:11,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 123 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-25 17:38:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2022-11-25 17:38:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 187 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2022-11-25 17:38:11,534 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 3 [2022-11-25 17:38:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:11,534 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2022-11-25 17:38:11,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2022-11-25 17:38:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 17:38:11,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:11,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 17:38:11,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:38:11,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-25 17:38:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:11,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694043711] [2022-11-25 17:38:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:11,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694043711] [2022-11-25 17:38:11,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694043711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:11,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:11,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:38:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514676428] [2022-11-25 17:38:11,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:11,658 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:11,852 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2022-11-25 17:38:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:11,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 17:38:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:11,854 INFO L225 Difference]: With dead ends: 218 [2022-11-25 17:38:11,855 INFO L226 Difference]: Without dead ends: 218 [2022-11-25 17:38:11,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:11,857 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 178 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:11,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 149 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-25 17:38:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2022-11-25 17:38:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.669172932330827) internal successors, (222), 197 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2022-11-25 17:38:11,871 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 3 [2022-11-25 17:38:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:11,872 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2022-11-25 17:38:11,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2022-11-25 17:38:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:38:11,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:11,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:38:11,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:38:11,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2022-11-25 17:38:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:11,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980919522] [2022-11-25 17:38:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980919522] [2022-11-25 17:38:11,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980919522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:11,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:11,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:38:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373886681] [2022-11-25 17:38:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:11,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:11,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:11,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:11,930 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:11,975 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2022-11-25 17:38:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:11,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 17:38:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:11,981 INFO L225 Difference]: With dead ends: 213 [2022-11-25 17:38:11,982 INFO L226 Difference]: Without dead ends: 213 [2022-11-25 17:38:11,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:11,985 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 175 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:11,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 202 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:38:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-25 17:38:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-11-25 17:38:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.6590909090909092) internal successors, (219), 195 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 219 transitions. [2022-11-25 17:38:12,014 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 219 transitions. Word has length 5 [2022-11-25 17:38:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:12,015 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 219 transitions. [2022-11-25 17:38:12,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 219 transitions. [2022-11-25 17:38:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:38:12,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:12,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:12,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:38:12,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:12,022 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2022-11-25 17:38:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:12,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582172128] [2022-11-25 17:38:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:12,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582172128] [2022-11-25 17:38:12,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582172128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:12,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:12,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:38:12,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691289948] [2022-11-25 17:38:12,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:12,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:38:12,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:38:12,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:38:12,316 INFO L87 Difference]: Start difference. First operand 196 states and 219 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:12,548 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2022-11-25 17:38:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:38:12,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 17:38:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:12,550 INFO L225 Difference]: With dead ends: 195 [2022-11-25 17:38:12,550 INFO L226 Difference]: Without dead ends: 195 [2022-11-25 17:38:12,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:12,552 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 5 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:12,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 536 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-25 17:38:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-11-25 17:38:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 194 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2022-11-25 17:38:12,577 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 11 [2022-11-25 17:38:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:12,577 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2022-11-25 17:38:12,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2022-11-25 17:38:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:38:12,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:12,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:12,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:38:12,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2022-11-25 17:38:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:12,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885437057] [2022-11-25 17:38:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:12,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:12,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885437057] [2022-11-25 17:38:12,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885437057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:12,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:12,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:38:12,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255900574] [2022-11-25 17:38:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:12,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:38:12,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:12,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:38:12,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:38:12,818 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:13,022 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2022-11-25 17:38:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:38:13,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 17:38:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:13,023 INFO L225 Difference]: With dead ends: 194 [2022-11-25 17:38:13,024 INFO L226 Difference]: Without dead ends: 194 [2022-11-25 17:38:13,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:13,025 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:13,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 547 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-25 17:38:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-11-25 17:38:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.643939393939394) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2022-11-25 17:38:13,029 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 11 [2022-11-25 17:38:13,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:13,029 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2022-11-25 17:38:13,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2022-11-25 17:38:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:38:13,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:13,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:13,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:38:13,031 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:13,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2022-11-25 17:38:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:13,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568469] [2022-11-25 17:38:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:13,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568469] [2022-11-25 17:38:13,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:13,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:13,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:38:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351076535] [2022-11-25 17:38:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:13,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:13,068 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:13,079 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2022-11-25 17:38:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:13,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 17:38:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:13,081 INFO L225 Difference]: With dead ends: 195 [2022-11-25 17:38:13,081 INFO L226 Difference]: Without dead ends: 195 [2022-11-25 17:38:13,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:13,082 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:13,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:38:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-25 17:38:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-11-25 17:38:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2022-11-25 17:38:13,088 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 13 [2022-11-25 17:38:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:13,089 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2022-11-25 17:38:13,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2022-11-25 17:38:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:38:13,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:13,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:13,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:38:13,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:13,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2022-11-25 17:38:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:13,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933173279] [2022-11-25 17:38:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:13,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-11-25 17:38:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:13,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933173279] [2022-11-25 17:38:13,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933173279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:13,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:13,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:38:13,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986782509] [2022-11-25 17:38:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:13,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:38:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:38:13,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:38:13,429 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:13,732 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2022-11-25 17:38:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:38:13,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 17:38:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:13,733 INFO L225 Difference]: With dead ends: 195 [2022-11-25 17:38:13,734 INFO L226 Difference]: Without dead ends: 195 [2022-11-25 17:38:13,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:38:13,735 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 175 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:13,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 457 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-25 17:38:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2022-11-25 17:38:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 133 states have (on average 1.631578947368421) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2022-11-25 17:38:13,739 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 14 [2022-11-25 17:38:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:13,740 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2022-11-25 17:38:13,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2022-11-25 17:38:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:38:13,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:13,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:13,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:38:13,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2022-11-25 17:38:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:13,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438179734] [2022-11-25 17:38:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:13,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:14,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438179734] [2022-11-25 17:38:14,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438179734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:14,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:14,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:38:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299314335] [2022-11-25 17:38:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:14,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:38:14,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:14,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:38:14,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:38:14,024 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:14,480 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2022-11-25 17:38:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:38:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 17:38:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:14,482 INFO L225 Difference]: With dead ends: 194 [2022-11-25 17:38:14,482 INFO L226 Difference]: Without dead ends: 194 [2022-11-25 17:38:14,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:38:14,483 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 171 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:14,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 495 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:38:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-25 17:38:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2022-11-25 17:38:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-11-25 17:38:14,488 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 14 [2022-11-25 17:38:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:14,488 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-11-25 17:38:14,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-11-25 17:38:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:38:14,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:14,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:14,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:38:14,489 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2022-11-25 17:38:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:14,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588354915] [2022-11-25 17:38:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:14,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588354915] [2022-11-25 17:38:14,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588354915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:14,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:14,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:38:14,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703921185] [2022-11-25 17:38:14,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:14,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:38:14,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:38:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:14,665 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:14,914 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2022-11-25 17:38:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:38:14,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 17:38:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:14,916 INFO L225 Difference]: With dead ends: 285 [2022-11-25 17:38:14,916 INFO L226 Difference]: Without dead ends: 285 [2022-11-25 17:38:14,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:38:14,917 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 203 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:14,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 724 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:38:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-25 17:38:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 190. [2022-11-25 17:38:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 131 states have (on average 1.6259541984732824) internal successors, (213), 189 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 213 transitions. [2022-11-25 17:38:14,921 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 213 transitions. Word has length 15 [2022-11-25 17:38:14,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:14,922 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 213 transitions. [2022-11-25 17:38:14,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 213 transitions. [2022-11-25 17:38:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:38:14,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:14,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:14,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:38:14,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2022-11-25 17:38:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:14,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549159658] [2022-11-25 17:38:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549159658] [2022-11-25 17:38:15,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549159658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:15,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:15,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:38:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560894611] [2022-11-25 17:38:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:15,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:38:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:38:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:38:15,073 INFO L87 Difference]: Start difference. First operand 190 states and 213 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:15,225 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2022-11-25 17:38:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:38:15,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 17:38:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:15,227 INFO L225 Difference]: With dead ends: 286 [2022-11-25 17:38:15,227 INFO L226 Difference]: Without dead ends: 286 [2022-11-25 17:38:15,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:15,228 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 106 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:15,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 602 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:38:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-25 17:38:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 193. [2022-11-25 17:38:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 134 states have (on average 1.6119402985074627) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-11-25 17:38:15,233 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 17 [2022-11-25 17:38:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:15,234 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-11-25 17:38:15,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-11-25 17:38:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:38:15,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:15,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:15,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:38:15,236 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:15,236 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2022-11-25 17:38:15,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:15,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731964628] [2022-11-25 17:38:15,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:15,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:15,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:15,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731964628] [2022-11-25 17:38:15,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731964628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:15,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:15,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:38:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756580910] [2022-11-25 17:38:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:15,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:38:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:38:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:38:15,379 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:15,706 INFO L93 Difference]: Finished difference Result 258 states and 275 transitions. [2022-11-25 17:38:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:38:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 17:38:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:15,708 INFO L225 Difference]: With dead ends: 258 [2022-11-25 17:38:15,708 INFO L226 Difference]: Without dead ends: 258 [2022-11-25 17:38:15,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:15,709 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 462 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:15,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 262 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:38:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-25 17:38:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 219. [2022-11-25 17:38:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.61875) internal successors, (259), 218 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2022-11-25 17:38:15,715 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 19 [2022-11-25 17:38:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:15,715 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2022-11-25 17:38:15,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2022-11-25 17:38:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:38:15,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:15,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:15,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:38:15,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2022-11-25 17:38:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:15,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531910234] [2022-11-25 17:38:15,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:15,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:15,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531910234] [2022-11-25 17:38:15,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531910234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:15,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:15,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:38:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244958197] [2022-11-25 17:38:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:15,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:38:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:38:15,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:38:15,777 INFO L87 Difference]: Start difference. First operand 219 states and 259 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:15,912 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2022-11-25 17:38:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:38:15,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 17:38:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:15,915 INFO L225 Difference]: With dead ends: 253 [2022-11-25 17:38:15,915 INFO L226 Difference]: Without dead ends: 253 [2022-11-25 17:38:15,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:38:15,916 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 247 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:15,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 289 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:38:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-25 17:38:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 217. [2022-11-25 17:38:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 159 states have (on average 1.610062893081761) internal successors, (256), 216 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2022-11-25 17:38:15,923 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 21 [2022-11-25 17:38:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:15,924 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2022-11-25 17:38:15,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2022-11-25 17:38:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:38:15,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:15,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:15,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:38:15,928 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:15,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2022-11-25 17:38:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:15,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764964382] [2022-11-25 17:38:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764964382] [2022-11-25 17:38:16,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764964382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:16,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:16,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:38:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809621907] [2022-11-25 17:38:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:16,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:38:16,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:16,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:38:16,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:38:16,086 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:16,348 INFO L93 Difference]: Finished difference Result 206 states and 243 transitions. [2022-11-25 17:38:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:38:16,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 17:38:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:16,349 INFO L225 Difference]: With dead ends: 206 [2022-11-25 17:38:16,350 INFO L226 Difference]: Without dead ends: 206 [2022-11-25 17:38:16,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:38:16,350 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:16,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 443 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-25 17:38:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2022-11-25 17:38:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 159 states have (on average 1.5220125786163523) internal successors, (242), 204 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 242 transitions. [2022-11-25 17:38:16,355 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 242 transitions. Word has length 23 [2022-11-25 17:38:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:16,355 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 242 transitions. [2022-11-25 17:38:16,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 242 transitions. [2022-11-25 17:38:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:38:16,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:16,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:16,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:38:16,357 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2022-11-25 17:38:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:16,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892105440] [2022-11-25 17:38:16,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:16,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:16,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892105440] [2022-11-25 17:38:16,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892105440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:16,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:16,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:38:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920040131] [2022-11-25 17:38:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:16,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:38:16,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:16,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:38:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:38:16,561 INFO L87 Difference]: Start difference. First operand 205 states and 242 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:16,870 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2022-11-25 17:38:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:38:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 17:38:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:16,871 INFO L225 Difference]: With dead ends: 198 [2022-11-25 17:38:16,872 INFO L226 Difference]: Without dead ends: 198 [2022-11-25 17:38:16,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:38:16,872 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 41 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:16,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 510 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-25 17:38:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2022-11-25 17:38:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.474025974025974) internal successors, (227), 190 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2022-11-25 17:38:16,877 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 23 [2022-11-25 17:38:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:16,877 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2022-11-25 17:38:16,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2022-11-25 17:38:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 17:38:16,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:16,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:16,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:38:16,878 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2022-11-25 17:38:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:16,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919240039] [2022-11-25 17:38:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:16,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919240039] [2022-11-25 17:38:16,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919240039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:16,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:16,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:38:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354015711] [2022-11-25 17:38:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:16,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:38:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:38:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:38:16,976 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:17,147 INFO L93 Difference]: Finished difference Result 194 states and 231 transitions. [2022-11-25 17:38:17,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:38:17,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 17:38:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:17,149 INFO L225 Difference]: With dead ends: 194 [2022-11-25 17:38:17,149 INFO L226 Difference]: Without dead ends: 194 [2022-11-25 17:38:17,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:38:17,150 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 38 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:17,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 621 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:38:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-25 17:38:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2022-11-25 17:38:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 186 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2022-11-25 17:38:17,154 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 25 [2022-11-25 17:38:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:17,155 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2022-11-25 17:38:17,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2022-11-25 17:38:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 17:38:17,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:17,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:17,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:38:17,157 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:17,157 INFO L85 PathProgramCache]: Analyzing trace with hash 476921774, now seen corresponding path program 1 times [2022-11-25 17:38:17,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:17,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125654074] [2022-11-25 17:38:17,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:17,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:17,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:17,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125654074] [2022-11-25 17:38:17,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125654074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:17,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:17,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:38:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822872174] [2022-11-25 17:38:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:17,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:17,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:17,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:17,205 INFO L87 Difference]: Start difference. First operand 187 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:17,218 INFO L93 Difference]: Finished difference Result 260 states and 311 transitions. [2022-11-25 17:38:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:17,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 17:38:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:17,219 INFO L225 Difference]: With dead ends: 260 [2022-11-25 17:38:17,220 INFO L226 Difference]: Without dead ends: 260 [2022-11-25 17:38:17,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:17,221 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:17,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:38:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-25 17:38:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2022-11-25 17:38:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 192 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 231 transitions. [2022-11-25 17:38:17,225 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 231 transitions. Word has length 27 [2022-11-25 17:38:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:17,226 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 231 transitions. [2022-11-25 17:38:17,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2022-11-25 17:38:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 17:38:17,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:17,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:17,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:38:17,228 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2022-11-25 17:38:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:17,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913540876] [2022-11-25 17:38:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:17,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:17,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913540876] [2022-11-25 17:38:17,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913540876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:17,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:17,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:38:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255968001] [2022-11-25 17:38:17,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:17,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:17,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:17,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:17,265 INFO L87 Difference]: Start difference. First operand 193 states and 231 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:17,288 INFO L93 Difference]: Finished difference Result 191 states and 228 transitions. [2022-11-25 17:38:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:17,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-25 17:38:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:17,289 INFO L225 Difference]: With dead ends: 191 [2022-11-25 17:38:17,290 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 17:38:17,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:17,291 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:17,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:38:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 17:38:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-11-25 17:38:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.4522292993630572) internal successors, (228), 190 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2022-11-25 17:38:17,295 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 28 [2022-11-25 17:38:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:17,295 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2022-11-25 17:38:17,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2022-11-25 17:38:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:38:17,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:17,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:17,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:38:17,297 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:17,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2022-11-25 17:38:17,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:17,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130187659] [2022-11-25 17:38:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:17,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130187659] [2022-11-25 17:38:17,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130187659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:17,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:17,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:38:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125115042] [2022-11-25 17:38:17,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:17,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:38:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:38:17,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:38:17,575 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:18,038 INFO L93 Difference]: Finished difference Result 321 states and 359 transitions. [2022-11-25 17:38:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:38:18,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 17:38:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:18,041 INFO L225 Difference]: With dead ends: 321 [2022-11-25 17:38:18,041 INFO L226 Difference]: Without dead ends: 321 [2022-11-25 17:38:18,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:38:18,041 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 575 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:18,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 737 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:38:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-25 17:38:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 224. [2022-11-25 17:38:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 190 states have (on average 1.4) internal successors, (266), 223 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 266 transitions. [2022-11-25 17:38:18,047 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 266 transitions. Word has length 29 [2022-11-25 17:38:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:18,047 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 266 transitions. [2022-11-25 17:38:18,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 266 transitions. [2022-11-25 17:38:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 17:38:18,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:18,049 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:18,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:38:18,049 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1491142186, now seen corresponding path program 1 times [2022-11-25 17:38:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:18,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805065978] [2022-11-25 17:38:18,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:18,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:18,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805065978] [2022-11-25 17:38:18,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805065978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:38:18,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283156669] [2022-11-25 17:38:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:18,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:18,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:38:18,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:38:18,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:38:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:18,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 17:38:18,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:38:18,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:38:18,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:38:18,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:38:18,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-25 17:38:18,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:38:18,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-25 17:38:18,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:38:18,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:38:18,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:38:18,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:38:18,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-11-25 17:38:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:18,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:38:19,573 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 10 treesize of output 8 [2022-11-25 17:38:19,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-25 17:38:19,589 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 10 treesize of output 8 [2022-11-25 17:38:19,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:38:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:19,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283156669] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:38:19,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:38:19,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-11-25 17:38:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137741941] [2022-11-25 17:38:19,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:38:19,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 17:38:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:19,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 17:38:19,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:38:19,608 INFO L87 Difference]: Start difference. First operand 224 states and 266 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:20,047 INFO L93 Difference]: Finished difference Result 323 states and 362 transitions. [2022-11-25 17:38:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:38:20,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 17:38:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:20,049 INFO L225 Difference]: With dead ends: 323 [2022-11-25 17:38:20,049 INFO L226 Difference]: Without dead ends: 323 [2022-11-25 17:38:20,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:38:20,050 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 633 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:20,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 677 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:38:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-25 17:38:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 262. [2022-11-25 17:38:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 261 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 320 transitions. [2022-11-25 17:38:20,056 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 320 transitions. Word has length 31 [2022-11-25 17:38:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:20,056 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 320 transitions. [2022-11-25 17:38:20,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 320 transitions. [2022-11-25 17:38:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 17:38:20,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:20,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:20,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:38:20,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:20,264 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2022-11-25 17:38:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:20,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749495721] [2022-11-25 17:38:20,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:20,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:20,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749495721] [2022-11-25 17:38:20,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749495721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:20,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:20,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:38:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391975639] [2022-11-25 17:38:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:20,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:38:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:38:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:38:20,405 INFO L87 Difference]: Start difference. First operand 262 states and 320 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:20,562 INFO L93 Difference]: Finished difference Result 261 states and 319 transitions. [2022-11-25 17:38:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:38:20,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-25 17:38:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:20,563 INFO L225 Difference]: With dead ends: 261 [2022-11-25 17:38:20,563 INFO L226 Difference]: Without dead ends: 261 [2022-11-25 17:38:20,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:20,564 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 5 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:20,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 426 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:38:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-25 17:38:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-11-25 17:38:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 228 states have (on average 1.3991228070175439) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 319 transitions. [2022-11-25 17:38:20,569 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 319 transitions. Word has length 33 [2022-11-25 17:38:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:20,570 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 319 transitions. [2022-11-25 17:38:20,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 319 transitions. [2022-11-25 17:38:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 17:38:20,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:20,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:20,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:38:20,573 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2022-11-25 17:38:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:20,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479604945] [2022-11-25 17:38:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479604945] [2022-11-25 17:38:20,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479604945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:20,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:20,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:38:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595635775] [2022-11-25 17:38:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:20,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:38:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:20,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:38:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:38:20,813 INFO L87 Difference]: Start difference. First operand 261 states and 319 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:20,999 INFO L93 Difference]: Finished difference Result 260 states and 318 transitions. [2022-11-25 17:38:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:38:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-25 17:38:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:21,000 INFO L225 Difference]: With dead ends: 260 [2022-11-25 17:38:21,001 INFO L226 Difference]: Without dead ends: 260 [2022-11-25 17:38:21,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:21,001 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:21,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 429 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-25 17:38:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-11-25 17:38:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.394736842105263) internal successors, (318), 259 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2022-11-25 17:38:21,006 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 33 [2022-11-25 17:38:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:21,008 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2022-11-25 17:38:21,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2022-11-25 17:38:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 17:38:21,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:21,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:21,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:38:21,009 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2022-11-25 17:38:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:21,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122133253] [2022-11-25 17:38:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:21,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:21,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122133253] [2022-11-25 17:38:21,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122133253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:21,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:21,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 17:38:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017900714] [2022-11-25 17:38:21,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:21,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:38:21,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:21,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:38:21,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:38:21,306 INFO L87 Difference]: Start difference. First operand 260 states and 318 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:22,060 INFO L93 Difference]: Finished difference Result 377 states and 424 transitions. [2022-11-25 17:38:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:38:22,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-25 17:38:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:22,066 INFO L225 Difference]: With dead ends: 377 [2022-11-25 17:38:22,066 INFO L226 Difference]: Without dead ends: 377 [2022-11-25 17:38:22,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-11-25 17:38:22,067 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 529 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:22,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 939 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:38:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-25 17:38:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 261. [2022-11-25 17:38:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 231 states have (on average 1.367965367965368) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2022-11-25 17:38:22,077 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 34 [2022-11-25 17:38:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:22,077 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2022-11-25 17:38:22,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2022-11-25 17:38:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 17:38:22,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:22,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:22,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 17:38:22,081 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2022-11-25 17:38:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427253788] [2022-11-25 17:38:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:22,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427253788] [2022-11-25 17:38:22,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427253788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:22,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:22,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 17:38:22,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811365736] [2022-11-25 17:38:22,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:22,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 17:38:22,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:22,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 17:38:22,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:38:22,694 INFO L87 Difference]: Start difference. First operand 261 states and 316 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:23,587 INFO L93 Difference]: Finished difference Result 441 states and 482 transitions. [2022-11-25 17:38:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:38:23,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-25 17:38:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:23,589 INFO L225 Difference]: With dead ends: 441 [2022-11-25 17:38:23,589 INFO L226 Difference]: Without dead ends: 441 [2022-11-25 17:38:23,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:38:23,590 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 615 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:23,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 947 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:38:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-11-25 17:38:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 267. [2022-11-25 17:38:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 266 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 323 transitions. [2022-11-25 17:38:23,596 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 323 transitions. Word has length 34 [2022-11-25 17:38:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:23,596 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 323 transitions. [2022-11-25 17:38:23,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 323 transitions. [2022-11-25 17:38:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 17:38:23,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:23,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:23,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:38:23,598 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2022-11-25 17:38:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:23,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620087491] [2022-11-25 17:38:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:23,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:23,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620087491] [2022-11-25 17:38:23,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620087491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:23,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:23,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:38:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724093452] [2022-11-25 17:38:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:23,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:23,639 INFO L87 Difference]: Start difference. First operand 267 states and 323 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:23,648 INFO L93 Difference]: Finished difference Result 269 states and 325 transitions. [2022-11-25 17:38:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:23,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-25 17:38:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:23,650 INFO L225 Difference]: With dead ends: 269 [2022-11-25 17:38:23,650 INFO L226 Difference]: Without dead ends: 269 [2022-11-25 17:38:23,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:23,651 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:23,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:38:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-25 17:38:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-11-25 17:38:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.3598326359832635) internal successors, (325), 268 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 325 transitions. [2022-11-25 17:38:23,657 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 325 transitions. Word has length 35 [2022-11-25 17:38:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:23,657 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 325 transitions. [2022-11-25 17:38:23,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 325 transitions. [2022-11-25 17:38:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:38:23,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:23,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:23,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 17:38:23,659 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2022-11-25 17:38:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:23,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138496938] [2022-11-25 17:38:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:24,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:24,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138496938] [2022-11-25 17:38:24,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138496938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:24,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:24,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 17:38:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728602123] [2022-11-25 17:38:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:24,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:38:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:38:24,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:38:24,380 INFO L87 Difference]: Start difference. First operand 269 states and 325 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:25,521 INFO L93 Difference]: Finished difference Result 433 states and 474 transitions. [2022-11-25 17:38:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:38:25,521 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 17:38:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:25,523 INFO L225 Difference]: With dead ends: 433 [2022-11-25 17:38:25,523 INFO L226 Difference]: Without dead ends: 433 [2022-11-25 17:38:25,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:38:25,524 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 599 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:25,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1316 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:38:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-25 17:38:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 269. [2022-11-25 17:38:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 268 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-11-25 17:38:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 324 transitions. [2022-11-25 17:38:25,531 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 324 transitions. Word has length 36 [2022-11-25 17:38:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:25,531 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 324 transitions. [2022-11-25 17:38:25,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 324 transitions. [2022-11-25 17:38:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:38:25,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:25,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:25,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 17:38:25,533 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash -339896365, now seen corresponding path program 1 times [2022-11-25 17:38:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:25,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75049494] [2022-11-25 17:38:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:25,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75049494] [2022-11-25 17:38:25,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75049494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:25,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:25,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:38:25,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023420858] [2022-11-25 17:38:25,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:25,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:38:25,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:25,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:38:25,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:25,673 INFO L87 Difference]: Start difference. First operand 269 states and 324 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:25,935 INFO L93 Difference]: Finished difference Result 284 states and 339 transitions. [2022-11-25 17:38:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:38:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 17:38:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:25,937 INFO L225 Difference]: With dead ends: 284 [2022-11-25 17:38:25,937 INFO L226 Difference]: Without dead ends: 284 [2022-11-25 17:38:25,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:38:25,938 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 29 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:25,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 641 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-25 17:38:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2022-11-25 17:38:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 248 states have (on average 1.342741935483871) internal successors, (333), 277 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 333 transitions. [2022-11-25 17:38:25,944 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 333 transitions. Word has length 36 [2022-11-25 17:38:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:25,945 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 333 transitions. [2022-11-25 17:38:25,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 333 transitions. [2022-11-25 17:38:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:38:25,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:25,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:25,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 17:38:25,946 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:25,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2022-11-25 17:38:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:25,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065265758] [2022-11-25 17:38:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:26,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065265758] [2022-11-25 17:38:26,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065265758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:26,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:26,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 17:38:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161774640] [2022-11-25 17:38:26,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:26,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:38:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:26,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:38:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:38:26,264 INFO L87 Difference]: Start difference. First operand 278 states and 333 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:26,727 INFO L93 Difference]: Finished difference Result 278 states and 333 transitions. [2022-11-25 17:38:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:38:26,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 17:38:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:26,729 INFO L225 Difference]: With dead ends: 278 [2022-11-25 17:38:26,729 INFO L226 Difference]: Without dead ends: 278 [2022-11-25 17:38:26,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:38:26,729 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 85 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:26,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 753 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:38:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-25 17:38:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2022-11-25 17:38:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 248 states have (on average 1.3387096774193548) internal successors, (332), 276 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 332 transitions. [2022-11-25 17:38:26,735 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 332 transitions. Word has length 36 [2022-11-25 17:38:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:26,736 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 332 transitions. [2022-11-25 17:38:26,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 332 transitions. [2022-11-25 17:38:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:38:26,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:26,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:26,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 17:38:26,737 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2022-11-25 17:38:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:26,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935343976] [2022-11-25 17:38:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:27,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-11-25 17:38:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:27,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935343976] [2022-11-25 17:38:27,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935343976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:27,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:27,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 17:38:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298885981] [2022-11-25 17:38:27,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:27,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:38:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:27,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:38:27,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:38:27,217 INFO L87 Difference]: Start difference. First operand 277 states and 332 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:27,671 INFO L93 Difference]: Finished difference Result 277 states and 332 transitions. [2022-11-25 17:38:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:38:27,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 17:38:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:27,672 INFO L225 Difference]: With dead ends: 277 [2022-11-25 17:38:27,672 INFO L226 Difference]: Without dead ends: 277 [2022-11-25 17:38:27,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:38:27,673 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 81 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:27,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 667 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:38:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-25 17:38:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2022-11-25 17:38:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 275 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 331 transitions. [2022-11-25 17:38:27,679 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 331 transitions. Word has length 36 [2022-11-25 17:38:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:27,679 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 331 transitions. [2022-11-25 17:38:27,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 331 transitions. [2022-11-25 17:38:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:38:27,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:27,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:27,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 17:38:27,680 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2022-11-25 17:38:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:27,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656358632] [2022-11-25 17:38:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:27,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656358632] [2022-11-25 17:38:27,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656358632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:27,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:27,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:38:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014607965] [2022-11-25 17:38:27,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:27,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:38:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:27,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:38:27,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:38:27,826 INFO L87 Difference]: Start difference. First operand 276 states and 331 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:28,059 INFO L93 Difference]: Finished difference Result 286 states and 342 transitions. [2022-11-25 17:38:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:38:28,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-25 17:38:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:28,061 INFO L225 Difference]: With dead ends: 286 [2022-11-25 17:38:28,061 INFO L226 Difference]: Without dead ends: 286 [2022-11-25 17:38:28,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:38:28,061 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 29 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:28,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 592 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:38:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-25 17:38:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 272. [2022-11-25 17:38:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 271 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 326 transitions. [2022-11-25 17:38:28,067 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 326 transitions. Word has length 37 [2022-11-25 17:38:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:28,067 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 326 transitions. [2022-11-25 17:38:28,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 326 transitions. [2022-11-25 17:38:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 17:38:28,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:28,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:28,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 17:38:28,068 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:28,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash -160017480, now seen corresponding path program 1 times [2022-11-25 17:38:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:28,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287438959] [2022-11-25 17:38:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:28,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287438959] [2022-11-25 17:38:28,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287438959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:28,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:28,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:38:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88172653] [2022-11-25 17:38:28,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:28,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:28,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:28,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:28,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:28,125 INFO L87 Difference]: Start difference. First operand 272 states and 326 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:28,168 INFO L93 Difference]: Finished difference Result 285 states and 330 transitions. [2022-11-25 17:38:28,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:28,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-25 17:38:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:28,170 INFO L225 Difference]: With dead ends: 285 [2022-11-25 17:38:28,170 INFO L226 Difference]: Without dead ends: 285 [2022-11-25 17:38:28,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:28,172 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 97 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:28,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 150 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:38:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-25 17:38:28,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2022-11-25 17:38:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 327 transitions. [2022-11-25 17:38:28,177 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 327 transitions. Word has length 38 [2022-11-25 17:38:28,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:28,178 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 327 transitions. [2022-11-25 17:38:28,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 327 transitions. [2022-11-25 17:38:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 17:38:28,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:28,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:28,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 17:38:28,179 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:28,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2022-11-25 17:38:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:28,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805146456] [2022-11-25 17:38:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:29,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:29,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805146456] [2022-11-25 17:38:29,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805146456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:29,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:29,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 17:38:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769455583] [2022-11-25 17:38:29,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:29,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:38:29,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:38:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:38:29,022 INFO L87 Difference]: Start difference. First operand 273 states and 327 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:29,998 INFO L93 Difference]: Finished difference Result 435 states and 475 transitions. [2022-11-25 17:38:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:38:29,998 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-25 17:38:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:30,000 INFO L225 Difference]: With dead ends: 435 [2022-11-25 17:38:30,000 INFO L226 Difference]: Without dead ends: 435 [2022-11-25 17:38:30,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:38:30,001 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 875 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:30,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1097 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:38:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-11-25 17:38:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 273. [2022-11-25 17:38:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 272 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 326 transitions. [2022-11-25 17:38:30,006 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 326 transitions. Word has length 39 [2022-11-25 17:38:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:30,006 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 326 transitions. [2022-11-25 17:38:30,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 326 transitions. [2022-11-25 17:38:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 17:38:30,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:30,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:30,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 17:38:30,008 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:30,009 INFO L85 PathProgramCache]: Analyzing trace with hash -862296903, now seen corresponding path program 1 times [2022-11-25 17:38:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:30,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429240650] [2022-11-25 17:38:30,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:30,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:30,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429240650] [2022-11-25 17:38:30,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429240650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:30,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:30,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:38:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229211541] [2022-11-25 17:38:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:30,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:38:30,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:30,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:38:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:30,052 INFO L87 Difference]: Start difference. First operand 273 states and 326 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:30,111 INFO L93 Difference]: Finished difference Result 275 states and 327 transitions. [2022-11-25 17:38:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:38:30,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 17:38:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:30,113 INFO L225 Difference]: With dead ends: 275 [2022-11-25 17:38:30,113 INFO L226 Difference]: Without dead ends: 275 [2022-11-25 17:38:30,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:38:30,115 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:30,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 165 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:38:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-25 17:38:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2022-11-25 17:38:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 245 states have (on average 1.3183673469387756) internal successors, (323), 270 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 323 transitions. [2022-11-25 17:38:30,123 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 323 transitions. Word has length 41 [2022-11-25 17:38:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:30,123 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 323 transitions. [2022-11-25 17:38:30,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 323 transitions. [2022-11-25 17:38:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 17:38:30,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:30,124 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:30,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 17:38:30,124 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:30,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash 333412926, now seen corresponding path program 1 times [2022-11-25 17:38:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:30,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055436088] [2022-11-25 17:38:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:38:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:30,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055436088] [2022-11-25 17:38:30,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055436088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:38:30,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593762377] [2022-11-25 17:38:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:30,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:30,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:38:30,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:38:30,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:38:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:30,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:38:30,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:38:30,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:38:30,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:38:30,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2022-11-25 17:38:30,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-25 17:38:30,676 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 15 treesize of output 7 [2022-11-25 17:38:30,681 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 15 treesize of output 7 [2022-11-25 17:38:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:30,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:38:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:30,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593762377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:38:30,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:38:30,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-11-25 17:38:30,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036549593] [2022-11-25 17:38:30,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:38:30,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:38:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:30,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:38:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:38:30,856 INFO L87 Difference]: Start difference. First operand 271 states and 323 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:31,363 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2022-11-25 17:38:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:38:31,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 17:38:31,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:31,365 INFO L225 Difference]: With dead ends: 372 [2022-11-25 17:38:31,366 INFO L226 Difference]: Without dead ends: 372 [2022-11-25 17:38:31,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:38:31,366 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 202 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:31,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 872 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:38:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-11-25 17:38:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 295. [2022-11-25 17:38:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 294 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 357 transitions. [2022-11-25 17:38:31,372 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 357 transitions. Word has length 41 [2022-11-25 17:38:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:31,373 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 357 transitions. [2022-11-25 17:38:31,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 357 transitions. [2022-11-25 17:38:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 17:38:31,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:31,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:31,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:38:31,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:31,579 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash -961395774, now seen corresponding path program 1 times [2022-11-25 17:38:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:31,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987947869] [2022-11-25 17:38:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987947869] [2022-11-25 17:38:31,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987947869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:31,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:31,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:38:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4212505] [2022-11-25 17:38:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:31,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:38:31,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:38:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:38:31,866 INFO L87 Difference]: Start difference. First operand 295 states and 357 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:32,313 INFO L93 Difference]: Finished difference Result 361 states and 415 transitions. [2022-11-25 17:38:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:38:32,314 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 17:38:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:32,315 INFO L225 Difference]: With dead ends: 361 [2022-11-25 17:38:32,315 INFO L226 Difference]: Without dead ends: 361 [2022-11-25 17:38:32,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:38:32,316 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 384 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:32,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 559 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:38:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-25 17:38:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 302. [2022-11-25 17:38:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 276 states have (on average 1.326086956521739) internal successors, (366), 301 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 366 transitions. [2022-11-25 17:38:32,321 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 366 transitions. Word has length 42 [2022-11-25 17:38:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:32,321 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 366 transitions. [2022-11-25 17:38:32,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 366 transitions. [2022-11-25 17:38:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 17:38:32,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:32,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:32,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 17:38:32,323 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash -961395773, now seen corresponding path program 1 times [2022-11-25 17:38:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:32,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865983358] [2022-11-25 17:38:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:32,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:32,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865983358] [2022-11-25 17:38:32,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865983358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:38:32,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:38:32,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:38:32,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10105678] [2022-11-25 17:38:32,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:38:32,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:38:32,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:32,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:38:32,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:38:32,759 INFO L87 Difference]: Start difference. First operand 302 states and 366 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:33,257 INFO L93 Difference]: Finished difference Result 361 states and 415 transitions. [2022-11-25 17:38:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:38:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 17:38:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:33,259 INFO L225 Difference]: With dead ends: 361 [2022-11-25 17:38:33,259 INFO L226 Difference]: Without dead ends: 361 [2022-11-25 17:38:33,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:38:33,260 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 326 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:33,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 539 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:38:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-25 17:38:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 308. [2022-11-25 17:38:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 282 states have (on average 1.322695035460993) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 373 transitions. [2022-11-25 17:38:33,265 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 373 transitions. Word has length 42 [2022-11-25 17:38:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:33,266 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 373 transitions. [2022-11-25 17:38:33,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 373 transitions. [2022-11-25 17:38:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 17:38:33,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:33,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:33,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 17:38:33,269 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1745867301, now seen corresponding path program 1 times [2022-11-25 17:38:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:33,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224684332] [2022-11-25 17:38:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:33,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:33,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224684332] [2022-11-25 17:38:33,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224684332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:38:33,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36858419] [2022-11-25 17:38:33,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:33,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:33,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:38:33,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:38:33,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:38:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:33,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:38:33,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:38:33,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:38:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:33,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:38:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:38:33,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36858419] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:38:33,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:38:33,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-25 17:38:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849077009] [2022-11-25 17:38:33,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:38:33,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:38:33,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:38:33,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:38:33,707 INFO L87 Difference]: Start difference. First operand 308 states and 373 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:33,880 INFO L93 Difference]: Finished difference Result 339 states and 404 transitions. [2022-11-25 17:38:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:38:33,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 17:38:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:33,882 INFO L225 Difference]: With dead ends: 339 [2022-11-25 17:38:33,882 INFO L226 Difference]: Without dead ends: 315 [2022-11-25 17:38:33,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:38:33,883 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:33,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 394 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:38:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-25 17:38:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-11-25 17:38:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 289 states have (on average 1.314878892733564) internal successors, (380), 314 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 380 transitions. [2022-11-25 17:38:33,890 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 380 transitions. Word has length 42 [2022-11-25 17:38:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:33,891 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 380 transitions. [2022-11-25 17:38:33,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:38:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 380 transitions. [2022-11-25 17:38:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 17:38:33,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:33,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:33,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:38:34,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:34,103 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-11-25 17:38:34,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:34,103 INFO L85 PathProgramCache]: Analyzing trace with hash -377971448, now seen corresponding path program 1 times [2022-11-25 17:38:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:34,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731953159] [2022-11-25 17:38:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:38:34,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:38:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:38:34,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:38:34,169 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:38:34,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 80 remaining) [2022-11-25 17:38:34,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-11-25 17:38:34,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-11-25 17:38:34,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (76 of 80 remaining) [2022-11-25 17:38:34,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-11-25 17:38:34,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-11-25 17:38:34,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-11-25 17:38:34,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-11-25 17:38:34,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-11-25 17:38:34,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2022-11-25 17:38:34,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-11-25 17:38:34,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-11-25 17:38:34,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-11-25 17:38:34,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-11-25 17:38:34,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2022-11-25 17:38:34,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-11-25 17:38:34,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-11-25 17:38:34,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-11-25 17:38:34,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-11-25 17:38:34,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-11-25 17:38:34,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (59 of 80 remaining) [2022-11-25 17:38:34,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2022-11-25 17:38:34,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-11-25 17:38:34,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-11-25 17:38:34,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-11-25 17:38:34,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-11-25 17:38:34,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-11-25 17:38:34,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (52 of 80 remaining) [2022-11-25 17:38:34,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (51 of 80 remaining) [2022-11-25 17:38:34,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-11-25 17:38:34,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-11-25 17:38:34,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-11-25 17:38:34,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-11-25 17:38:34,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-11-25 17:38:34,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-11-25 17:38:34,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-11-25 17:38:34,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-11-25 17:38:34,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-11-25 17:38:34,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-11-25 17:38:34,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2022-11-25 17:38:34,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-11-25 17:38:34,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2022-11-25 17:38:34,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-11-25 17:38:34,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-11-25 17:38:34,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-11-25 17:38:34,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (34 of 80 remaining) [2022-11-25 17:38:34,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (33 of 80 remaining) [2022-11-25 17:38:34,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2022-11-25 17:38:34,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2022-11-25 17:38:34,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (30 of 80 remaining) [2022-11-25 17:38:34,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2022-11-25 17:38:34,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-11-25 17:38:34,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (27 of 80 remaining) [2022-11-25 17:38:34,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-11-25 17:38:34,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-11-25 17:38:34,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (24 of 80 remaining) [2022-11-25 17:38:34,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-11-25 17:38:34,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-11-25 17:38:34,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-11-25 17:38:34,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (20 of 80 remaining) [2022-11-25 17:38:34,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-11-25 17:38:34,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-11-25 17:38:34,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2022-11-25 17:38:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2022-11-25 17:38:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (15 of 80 remaining) [2022-11-25 17:38:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-11-25 17:38:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-11-25 17:38:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK (12 of 80 remaining) [2022-11-25 17:38:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-11-25 17:38:34,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-11-25 17:38:34,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK (9 of 80 remaining) [2022-11-25 17:38:34,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE (8 of 80 remaining) [2022-11-25 17:38:34,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE (7 of 80 remaining) [2022-11-25 17:38:34,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (6 of 80 remaining) [2022-11-25 17:38:34,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-11-25 17:38:34,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-11-25 17:38:34,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (3 of 80 remaining) [2022-11-25 17:38:34,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (2 of 80 remaining) [2022-11-25 17:38:34,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE (1 of 80 remaining) [2022-11-25 17:38:34,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2022-11-25 17:38:34,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 17:38:34,194 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:38:34,200 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:38:34,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:38:34 BoogieIcfgContainer [2022-11-25 17:38:34,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:38:34,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:38:34,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:38:34,265 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:38:34,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:38:10" (3/4) ... [2022-11-25 17:38:34,269 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:38:34,326 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:38:34,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:38:34,327 INFO L158 Benchmark]: Toolchain (without parser) took 25140.24ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 132.0MB in the beginning and 124.2MB in the end (delta: 7.8MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. [2022-11-25 17:38:34,327 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 127.9MB. Free memory was 93.9MB in the beginning and 93.9MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:38:34,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.41ms. Allocated memory is still 174.1MB. Free memory was 131.6MB in the beginning and 111.7MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:38:34,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.81ms. Allocated memory is still 174.1MB. Free memory was 111.7MB in the beginning and 109.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:38:34,333 INFO L158 Benchmark]: Boogie Preprocessor took 37.45ms. Allocated memory is still 174.1MB. Free memory was 109.4MB in the beginning and 106.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:38:34,335 INFO L158 Benchmark]: RCFGBuilder took 933.72ms. Allocated memory is still 174.1MB. Free memory was 106.8MB in the beginning and 126.7MB in the end (delta: -19.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2022-11-25 17:38:34,336 INFO L158 Benchmark]: TraceAbstraction took 23520.14ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 125.6MB in the beginning and 127.4MB in the end (delta: -1.8MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2022-11-25 17:38:34,337 INFO L158 Benchmark]: Witness Printer took 61.00ms. Allocated memory is still 302.0MB. Free memory was 127.4MB in the beginning and 124.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:38:34,338 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.28ms. Allocated memory is still 127.9MB. Free memory was 93.9MB in the beginning and 93.9MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.41ms. Allocated memory is still 174.1MB. Free memory was 131.6MB in the beginning and 111.7MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.81ms. Allocated memory is still 174.1MB. Free memory was 111.7MB in the beginning and 109.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.45ms. Allocated memory is still 174.1MB. Free memory was 109.4MB in the beginning and 106.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 933.72ms. Allocated memory is still 174.1MB. Free memory was 106.8MB in the beginning and 126.7MB in the end (delta: -19.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23520.14ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 125.6MB in the beginning and 127.4MB in the end (delta: -1.8MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. * Witness Printer took 61.00ms. Allocated memory is still 302.0MB. Free memory was 127.4MB in the beginning and 124.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - 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: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free 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: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 195 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 37, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7321 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7321 mSDsluCounter, 19061 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14166 mSDsCounter, 287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9491 IncrementalHoareTripleChecker+Invalid, 9778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 287 mSolverCounterUnsat, 4895 mSDtfsCounter, 9491 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=36, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 1390 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1124 NumberOfCodeBlocks, 1124 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1153 ConstructedInterpolants, 19 QuantifiedInterpolants, 10663 SizeOfPredicates, 16 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 42 InterpolantComputations, 33 PerfectInterpolantSequences, 16/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:38:34,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f1ce3be-8f64-4488-b486-3fbec65c83c5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)