./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8 --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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- 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-e04fb08 [2022-11-16 12:50:20,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:50:20,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:50:20,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:50:20,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:50:20,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:50:20,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:50:20,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:50:20,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:50:20,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:50:20,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:50:20,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:50:20,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:50:20,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:50:20,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:50:20,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:50:20,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:50:20,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:50:20,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:50:20,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:50:20,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:50:20,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:50:20,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:50:20,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:50:20,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:50:20,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:50:20,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:50:20,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:50:20,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:50:20,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:50:20,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:50:20,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:50:20,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:50:20,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:50:20,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:50:20,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:50:20,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:50:20,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:50:20,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:50:20,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:50:20,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:50:20,360 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:50:20,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:50:20,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:50:20,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:50:20,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:50:20,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:50:20,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:50:20,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:50:20,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:50:20,386 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:50:20,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:50:20,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:50:20,387 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:50:20,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:50:20,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:50:20,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:50:20,388 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:50:20,388 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:50:20,389 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:50:20,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:50:20,389 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:50:20,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:50:20,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:50:20,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:50:20,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:50:20,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:50:20,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:50:20,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:50:20,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:50:20,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:50:20,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:50:20,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/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_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-11-16 12:50:20,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:50:20,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:50:20,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:50:20,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:50:20,663 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:50:20,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-11-16 12:50:20,745 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/data/c41f650b5/30b157069f9b49749a4920cda187a7d7/FLAG22d73e6ac [2022-11-16 12:50:21,223 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:50:21,224 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-11-16 12:50:21,248 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/data/c41f650b5/30b157069f9b49749a4920cda187a7d7/FLAG22d73e6ac [2022-11-16 12:50:21,552 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/data/c41f650b5/30b157069f9b49749a4920cda187a7d7 [2022-11-16 12:50:21,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:50:21,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:50:21,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:50:21,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:50:21,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:50:21,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:50:21" (1/1) ... [2022-11-16 12:50:21,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ce6fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:21, skipping insertion in model container [2022-11-16 12:50:21,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:50:21" (1/1) ... [2022-11-16 12:50:21,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:50:21,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:50:21,965 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-11-16 12:50:21,970 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-11-16 12:50:21,972 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-11-16 12:50:21,973 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-11-16 12:50:21,975 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-11-16 12:50:21,977 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-11-16 12:50:21,978 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-11-16 12:50:21,979 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-11-16 12:50:21,980 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-11-16 12:50:21,981 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-11-16 12:50:21,983 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-11-16 12:50:21,984 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-11-16 12:50:21,985 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-11-16 12:50:21,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:50:21,997 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:50:22,033 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-11-16 12:50:22,047 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-11-16 12:50:22,048 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-11-16 12:50:22,049 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-11-16 12:50:22,050 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-11-16 12:50:22,051 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-11-16 12:50:22,052 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-11-16 12:50:22,053 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-11-16 12:50:22,053 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-11-16 12:50:22,054 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-11-16 12:50:22,056 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-11-16 12:50:22,057 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-11-16 12:50:22,058 WARN L229 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_afcba490-528f-4604-b1ee-108965e6a638/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-11-16 12:50:22,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:50:22,083 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:50:22,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22 WrapperNode [2022-11-16 12:50:22,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:50:22,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:50:22,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:50:22,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:50:22,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,135 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2022-11-16 12:50:22,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:50:22,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:50:22,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:50:22,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:50:22,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,173 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:50:22,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:50:22,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:50:22,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:50:22,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (1/1) ... [2022-11-16 12:50:22,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:50:22,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:22,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:50:22,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:50:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:50:22,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:50:22,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:50:22,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:50:22,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:50:22,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:50:22,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:50:22,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:50:22,426 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:50:22,428 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:50:23,010 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:50:23,021 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:50:23,021 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-16 12:50:23,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:23 BoogieIcfgContainer [2022-11-16 12:50:23,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:50:23,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:50:23,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:50:23,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:50:23,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:50:21" (1/3) ... [2022-11-16 12:50:23,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf78a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:50:23, skipping insertion in model container [2022-11-16 12:50:23,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:22" (2/3) ... [2022-11-16 12:50:23,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf78a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:50:23, skipping insertion in model container [2022-11-16 12:50:23,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:23" (3/3) ... [2022-11-16 12:50:23,047 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-11-16 12:50:23,079 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:50:23,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-11-16 12:50:23,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:50:23,166 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=FINITE_AUTOMATA, 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;@4cf9b48a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:50:23,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2022-11-16 12:50:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 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-16 12:50:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:50:23,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:23,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:50:23,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-16 12:50:23,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:23,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352880562] [2022-11-16 12:50:23,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:23,427 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-16 12:50:23,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:23,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352880562] [2022-11-16 12:50:23,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352880562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:23,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:23,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732529553] [2022-11-16 12:50:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:23,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:23,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:23,481 INFO L87 Difference]: Start difference. First operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 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) 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-16 12:50:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:23,654 INFO L93 Difference]: Finished difference Result 192 states and 201 transitions. [2022-11-16 12:50:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:23,656 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-16 12:50:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:23,669 INFO L225 Difference]: With dead ends: 192 [2022-11-16 12:50:23,669 INFO L226 Difference]: Without dead ends: 188 [2022-11-16 12:50:23,671 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-16 12:50:23,676 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:23,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 119 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-16 12:50:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2022-11-16 12:50:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 182 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-16 12:50:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-11-16 12:50:23,731 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 3 [2022-11-16 12:50:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:23,731 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-11-16 12:50:23,732 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-16 12:50:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-11-16 12:50:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:50:23,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:23,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:50:23,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:50:23,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:23,734 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-16 12:50:23,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:23,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702499444] [2022-11-16 12:50:23,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:23,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:23,807 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-16 12:50:23,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702499444] [2022-11-16 12:50:23,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702499444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:23,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:23,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278078418] [2022-11-16 12:50:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:23,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:23,810 INFO L87 Difference]: Start difference. First operand 183 states and 195 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-16 12:50:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:23,943 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2022-11-16 12:50:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:23,944 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-16 12:50:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:23,945 INFO L225 Difference]: With dead ends: 213 [2022-11-16 12:50:23,946 INFO L226 Difference]: Without dead ends: 213 [2022-11-16 12:50:23,946 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-16 12:50:23,947 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:23,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 145 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-16 12:50:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2022-11-16 12:50:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.6615384615384616) 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-16 12:50:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-11-16 12:50:23,958 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 3 [2022-11-16 12:50:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:23,958 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-11-16 12:50:23,959 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-16 12:50:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-11-16 12:50:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:50:23,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:23,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:50:23,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:50:23,960 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2022-11-16 12:50:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:23,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676421467] [2022-11-16 12:50:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:24,014 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-16 12:50:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:24,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676421467] [2022-11-16 12:50:24,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676421467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:24,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:24,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601422340] [2022-11-16 12:50:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:24,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:24,017 INFO L87 Difference]: Start difference. First operand 193 states and 216 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-16 12:50:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:24,081 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2022-11-16 12:50:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:24,081 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-16 12:50:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:24,084 INFO L225 Difference]: With dead ends: 208 [2022-11-16 12:50:24,084 INFO L226 Difference]: Without dead ends: 208 [2022-11-16 12:50:24,084 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-16 12:50:24,088 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 169 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 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-16 12:50:24,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-16 12:50:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-11-16 12:50:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 190 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-16 12:50:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2022-11-16 12:50:24,106 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 5 [2022-11-16 12:50:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:24,106 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2022-11-16 12:50:24,106 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-16 12:50:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2022-11-16 12:50:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:50:24,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:24,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:50:24,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2022-11-16 12:50:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844341346] [2022-11-16 12:50:24,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:24,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:24,371 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-16 12:50:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:24,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844341346] [2022-11-16 12:50:24,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844341346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:24,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:24,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:50:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993616853] [2022-11-16 12:50:24,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:24,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:50:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:50:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:24,374 INFO L87 Difference]: Start difference. First operand 191 states and 213 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-16 12:50:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:24,568 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-11-16 12:50:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:50:24,568 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-16 12:50:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:24,569 INFO L225 Difference]: With dead ends: 190 [2022-11-16 12:50:24,569 INFO L226 Difference]: Without dead ends: 190 [2022-11-16 12:50:24,570 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-16 12:50:24,573 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 5 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:24,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 518 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-16 12:50:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-16 12:50:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-16 12:50:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-11-16 12:50:24,593 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 11 [2022-11-16 12:50:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:24,593 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-11-16 12:50:24,594 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-16 12:50:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-11-16 12:50:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:50:24,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:24,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:24,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:50:24,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2022-11-16 12:50:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:24,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162467933] [2022-11-16 12:50:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:24,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:24,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162467933] [2022-11-16 12:50:24,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162467933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:24,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:24,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:50:24,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039312183] [2022-11-16 12:50:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:24,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:50:24,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:24,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:50:24,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:24,882 INFO L87 Difference]: Start difference. First operand 190 states and 212 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-16 12:50:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:25,095 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2022-11-16 12:50:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:50:25,100 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-16 12:50:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:25,101 INFO L225 Difference]: With dead ends: 189 [2022-11-16 12:50:25,101 INFO L226 Difference]: Without dead ends: 189 [2022-11-16 12:50:25,102 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-16 12:50:25,103 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:25,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-16 12:50:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-11-16 12:50:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-16 12:50:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-11-16 12:50:25,111 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 11 [2022-11-16 12:50:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:25,112 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-11-16 12:50:25,112 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-16 12:50:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-11-16 12:50:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:50:25,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:25,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:25,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:50:25,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:25,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2022-11-16 12:50:25,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:25,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361285618] [2022-11-16 12:50:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:25,177 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-16 12:50:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:25,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361285618] [2022-11-16 12:50:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361285618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:25,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:25,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813290370] [2022-11-16 12:50:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:25,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:25,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:25,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:25,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:25,183 INFO L87 Difference]: Start difference. First operand 189 states and 211 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-16 12:50:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:25,194 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-11-16 12:50:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:25,194 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-16 12:50:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:25,195 INFO L225 Difference]: With dead ends: 190 [2022-11-16 12:50:25,196 INFO L226 Difference]: Without dead ends: 190 [2022-11-16 12:50:25,196 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-16 12:50:25,200 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 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-16 12:50:25,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-16 12:50:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-16 12:50:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.6307692307692307) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-16 12:50:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-11-16 12:50:25,207 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 13 [2022-11-16 12:50:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:25,207 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-11-16 12:50:25,208 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-16 12:50:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-11-16 12:50:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:50:25,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:25,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:25,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:50:25,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2022-11-16 12:50:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:25,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404414582] [2022-11-16 12:50:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:25,475 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-16 12:50:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:25,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404414582] [2022-11-16 12:50:25,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404414582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:25,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:25,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841144967] [2022-11-16 12:50:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:25,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:25,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:25,478 INFO L87 Difference]: Start difference. First operand 190 states and 212 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-16 12:50:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:25,767 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2022-11-16 12:50:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:50:25,768 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-16 12:50:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:25,768 INFO L225 Difference]: With dead ends: 190 [2022-11-16 12:50:25,769 INFO L226 Difference]: Without dead ends: 190 [2022-11-16 12:50:25,769 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-16 12:50:25,769 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 171 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:25,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 441 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-16 12:50:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2022-11-16 12:50:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.623076923076923) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-16 12:50:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-11-16 12:50:25,774 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 14 [2022-11-16 12:50:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:25,774 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-11-16 12:50:25,774 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-16 12:50:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-11-16 12:50:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:50:25,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:25,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:25,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:50:25,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2022-11-16 12:50:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:25,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969645155] [2022-11-16 12:50:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:26,187 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-16 12:50:26,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:26,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969645155] [2022-11-16 12:50:26,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969645155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:26,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:26,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051304285] [2022-11-16 12:50:26,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:26,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:26,197 INFO L87 Difference]: Start difference. First operand 189 states and 211 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-16 12:50:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:26,622 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2022-11-16 12:50:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:50:26,623 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-16 12:50:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:26,624 INFO L225 Difference]: With dead ends: 189 [2022-11-16 12:50:26,624 INFO L226 Difference]: Without dead ends: 189 [2022-11-16 12:50:26,624 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-16 12:50:26,625 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 165 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:26,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 479 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:50:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-16 12:50:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2022-11-16 12:50:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-16 12:50:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-11-16 12:50:26,629 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 14 [2022-11-16 12:50:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:26,630 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-11-16 12:50:26,630 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-16 12:50:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-11-16 12:50:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:50:26,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:26,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:50:26,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2022-11-16 12:50:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:26,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718589417] [2022-11-16 12:50:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:26,742 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-16 12:50:26,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:26,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718589417] [2022-11-16 12:50:26,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718589417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:26,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:26,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:26,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973499891] [2022-11-16 12:50:26,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:26,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:50:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:26,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:50:26,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:50:26,744 INFO L87 Difference]: Start difference. First operand 188 states and 210 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-16 12:50:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:26,999 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2022-11-16 12:50:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:50:26,999 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-16 12:50:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:27,001 INFO L225 Difference]: With dead ends: 275 [2022-11-16 12:50:27,001 INFO L226 Difference]: Without dead ends: 275 [2022-11-16 12:50:27,001 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-16 12:50:27,002 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 194 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:27,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 699 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-16 12:50:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2022-11-16 12:50:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.6171875) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-16 12:50:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-11-16 12:50:27,006 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 15 [2022-11-16 12:50:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:27,007 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-11-16 12:50:27,007 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-16 12:50:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-11-16 12:50:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:50:27,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:27,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:27,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:50:27,009 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:27,009 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2022-11-16 12:50:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:27,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681421018] [2022-11-16 12:50:27,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:27,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:27,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-16 12:50:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:27,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681421018] [2022-11-16 12:50:27,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681421018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:27,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:27,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:50:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83352674] [2022-11-16 12:50:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:27,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:50:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:27,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:50:27,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:27,119 INFO L87 Difference]: Start difference. First operand 185 states and 207 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-16 12:50:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:27,278 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2022-11-16 12:50:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:50:27,278 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-16 12:50:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:27,280 INFO L225 Difference]: With dead ends: 276 [2022-11-16 12:50:27,280 INFO L226 Difference]: Without dead ends: 276 [2022-11-16 12:50:27,280 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-16 12:50:27,281 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:27,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 582 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-16 12:50:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 188. [2022-11-16 12:50:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 131 states have (on average 1.6030534351145038) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-16 12:50:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-11-16 12:50:27,286 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 17 [2022-11-16 12:50:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:27,286 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-11-16 12:50:27,287 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-16 12:50:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-11-16 12:50:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 12:50:27,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:27,288 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-16 12:50:27,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:50:27,288 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2022-11-16 12:50:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:27,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747129724] [2022-11-16 12:50:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:27,487 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-16 12:50:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:27,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747129724] [2022-11-16 12:50:27,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747129724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:27,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:27,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:50:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214667698] [2022-11-16 12:50:27,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:27,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:50:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:27,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:50:27,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:27,489 INFO L87 Difference]: Start difference. First operand 188 states and 210 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-16 12:50:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:27,747 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2022-11-16 12:50:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:50:27,747 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-16 12:50:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:27,748 INFO L225 Difference]: With dead ends: 248 [2022-11-16 12:50:27,748 INFO L226 Difference]: Without dead ends: 248 [2022-11-16 12:50:27,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:50:27,749 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 491 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:27,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 186 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-16 12:50:27,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2022-11-16 12:50:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.603896103896104) internal successors, (247), 210 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-16 12:50:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2022-11-16 12:50:27,754 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 247 transitions. Word has length 19 [2022-11-16 12:50:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:27,754 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 247 transitions. [2022-11-16 12:50:27,755 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-16 12:50:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 247 transitions. [2022-11-16 12:50:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 12:50:27,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:27,757 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-16 12:50:27,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:50:27,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2022-11-16 12:50:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:27,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442568412] [2022-11-16 12:50:27,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:27,807 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-16 12:50:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442568412] [2022-11-16 12:50:27,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442568412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:27,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:27,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:50:27,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963866242] [2022-11-16 12:50:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:27,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:50:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:50:27,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:50:27,810 INFO L87 Difference]: Start difference. First operand 211 states and 247 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-16 12:50:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:27,941 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2022-11-16 12:50:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:50:27,942 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-16 12:50:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:27,943 INFO L225 Difference]: With dead ends: 243 [2022-11-16 12:50:27,943 INFO L226 Difference]: Without dead ends: 243 [2022-11-16 12:50:27,943 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-16 12:50:27,944 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 229 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 277 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-16 12:50:27,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 277 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-16 12:50:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2022-11-16 12:50:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.5947712418300655) internal successors, (244), 208 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-16 12:50:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2022-11-16 12:50:27,951 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 21 [2022-11-16 12:50:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:27,952 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2022-11-16 12:50:27,952 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-16 12:50:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2022-11-16 12:50:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 12:50:27,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:27,956 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-16 12:50:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:50:27,957 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2022-11-16 12:50:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:27,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081110777] [2022-11-16 12:50:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:28,061 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-16 12:50:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:28,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081110777] [2022-11-16 12:50:28,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081110777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:28,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:28,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:50:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187168100] [2022-11-16 12:50:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:28,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:50:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:28,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:50:28,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:28,063 INFO L87 Difference]: Start difference. First operand 209 states and 244 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-16 12:50:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:28,315 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-11-16 12:50:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:50:28,316 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-16 12:50:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:28,316 INFO L225 Difference]: With dead ends: 198 [2022-11-16 12:50:28,317 INFO L226 Difference]: Without dead ends: 198 [2022-11-16 12:50:28,317 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-16 12:50:28,317 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 98 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:28,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 427 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-16 12:50:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-11-16 12:50:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 196 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-16 12:50:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2022-11-16 12:50:28,322 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 23 [2022-11-16 12:50:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:28,322 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2022-11-16 12:50:28,322 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-16 12:50:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2022-11-16 12:50:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 12:50:28,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:28,323 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-16 12:50:28,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:50:28,323 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:28,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2022-11-16 12:50:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:28,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336953087] [2022-11-16 12:50:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:28,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:28,554 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-16 12:50:28,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:28,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336953087] [2022-11-16 12:50:28,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336953087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:28,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:28,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:50:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380860308] [2022-11-16 12:50:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:28,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:50:28,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:28,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:50:28,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:28,557 INFO L87 Difference]: Start difference. First operand 197 states and 230 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-16 12:50:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:28,847 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2022-11-16 12:50:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:50:28,847 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-16 12:50:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:28,848 INFO L225 Difference]: With dead ends: 190 [2022-11-16 12:50:28,848 INFO L226 Difference]: Without dead ends: 190 [2022-11-16 12:50:28,848 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-16 12:50:28,849 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:28,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 488 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-16 12:50:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2022-11-16 12:50:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-16 12:50:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-11-16 12:50:28,854 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2022-11-16 12:50:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:28,854 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-11-16 12:50:28,854 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-16 12:50:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-11-16 12:50:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:50:28,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:28,855 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-16 12:50:28,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:50:28,855 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2022-11-16 12:50:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:28,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970838016] [2022-11-16 12:50:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:28,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:28,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970838016] [2022-11-16 12:50:28,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970838016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:28,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:28,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:50:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216470316] [2022-11-16 12:50:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:28,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:50:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:50:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:28,963 INFO L87 Difference]: Start difference. First operand 183 states and 215 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-16 12:50:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:29,126 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2022-11-16 12:50:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:50:29,126 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-16 12:50:29,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:29,127 INFO L225 Difference]: With dead ends: 186 [2022-11-16 12:50:29,127 INFO L226 Difference]: Without dead ends: 186 [2022-11-16 12:50:29,127 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-16 12:50:29,128 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 38 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:29,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-16 12:50:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2022-11-16 12:50:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 178 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-16 12:50:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2022-11-16 12:50:29,132 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 25 [2022-11-16 12:50:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:29,132 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2022-11-16 12:50:29,132 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-16 12:50:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2022-11-16 12:50:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:50:29,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:29,133 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-16 12:50:29,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:50:29,133 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash 476921454, now seen corresponding path program 1 times [2022-11-16 12:50:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:29,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50659187] [2022-11-16 12:50:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:29,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:29,164 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-16 12:50:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:29,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50659187] [2022-11-16 12:50:29,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50659187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:29,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:29,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733594933] [2022-11-16 12:50:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:29,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:29,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:29,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:29,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:29,166 INFO L87 Difference]: Start difference. First operand 179 states and 211 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-16 12:50:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:29,177 INFO L93 Difference]: Finished difference Result 252 states and 299 transitions. [2022-11-16 12:50:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:29,177 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-16 12:50:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:29,178 INFO L225 Difference]: With dead ends: 252 [2022-11-16 12:50:29,179 INFO L226 Difference]: Without dead ends: 252 [2022-11-16 12:50:29,179 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-16 12:50:29,180 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 50 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:29,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-16 12:50:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2022-11-16 12:50:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 184 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-16 12:50:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2022-11-16 12:50:29,185 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 27 [2022-11-16 12:50:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:29,185 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2022-11-16 12:50:29,186 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-16 12:50:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-11-16 12:50:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:50:29,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:29,186 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-16 12:50:29,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:50:29,187 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:29,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:29,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2022-11-16 12:50:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:29,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203784722] [2022-11-16 12:50:29,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:29,241 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-16 12:50:29,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:29,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203784722] [2022-11-16 12:50:29,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203784722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:29,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:29,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:29,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420873915] [2022-11-16 12:50:29,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:29,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:29,245 INFO L87 Difference]: Start difference. First operand 185 states and 219 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-16 12:50:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:29,262 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-11-16 12:50:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:29,263 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-16 12:50:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:29,264 INFO L225 Difference]: With dead ends: 183 [2022-11-16 12:50:29,264 INFO L226 Difference]: Without dead ends: 183 [2022-11-16 12:50:29,264 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-16 12:50:29,265 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:29,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-16 12:50:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-16 12:50:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.4304635761589404) internal successors, (216), 182 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-16 12:50:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2022-11-16 12:50:29,269 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 28 [2022-11-16 12:50:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:29,269 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2022-11-16 12:50:29,270 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-16 12:50:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-11-16 12:50:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 12:50:29,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:29,270 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-16 12:50:29,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:50:29,271 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2022-11-16 12:50:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:29,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740728926] [2022-11-16 12:50:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:29,538 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-16 12:50:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:29,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740728926] [2022-11-16 12:50:29,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740728926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:29,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:29,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:50:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999250593] [2022-11-16 12:50:29,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:29,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:50:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:29,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:50:29,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:50:29,541 INFO L87 Difference]: Start difference. First operand 183 states and 216 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-16 12:50:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:30,020 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2022-11-16 12:50:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:50:30,021 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-16 12:50:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:30,022 INFO L225 Difference]: With dead ends: 308 [2022-11-16 12:50:30,022 INFO L226 Difference]: Without dead ends: 308 [2022-11-16 12:50:30,022 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-16 12:50:30,023 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 396 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:30,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 784 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:50:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-16 12:50:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2022-11-16 12:50:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-16 12:50:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2022-11-16 12:50:30,028 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 29 [2022-11-16 12:50:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:30,028 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2022-11-16 12:50:30,028 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-16 12:50:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2022-11-16 12:50:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:50:30,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:30,029 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-16 12:50:30,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:50:30,029 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976426, now seen corresponding path program 1 times [2022-11-16 12:50:30,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:30,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789779533] [2022-11-16 12:50:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:30,213 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-16 12:50:30,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:30,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789779533] [2022-11-16 12:50:30,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789779533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:30,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167809434] [2022-11-16 12:50:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:30,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:30,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:30,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:30,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:50:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:30,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 12:50:30,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:30,412 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-16 12:50:30,432 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-16 12:50:30,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:30,520 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-16 12:50:30,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:30,527 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-16 12:50:30,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:50:30,747 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-16 12:50:30,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:50:30,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:50:30,760 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-16 12:50:30,802 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-16 12:50:30,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:31,492 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-16 12:50:31,501 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-16 12:50:31,510 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-16 12:50:31,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:31,526 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-16 12:50:31,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167809434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:31,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:50:31,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-11-16 12:50:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094821093] [2022-11-16 12:50:31,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:31,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:50:31,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:31,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:50:31,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:50:31,530 INFO L87 Difference]: Start difference. First operand 216 states and 254 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-16 12:50:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:32,021 INFO L93 Difference]: Finished difference Result 500 states and 570 transitions. [2022-11-16 12:50:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:50:32,022 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-16 12:50:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:32,025 INFO L225 Difference]: With dead ends: 500 [2022-11-16 12:50:32,025 INFO L226 Difference]: Without dead ends: 500 [2022-11-16 12:50:32,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:50:32,026 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 670 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:32,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 934 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 339 Invalid, 0 Unknown, 85 Unchecked, 0.3s Time] [2022-11-16 12:50:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-11-16 12:50:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 251. [2022-11-16 12:50:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 250 states have internal predecessors, (302), 0 states have call successors, (0), 0 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-16 12:50:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2022-11-16 12:50:32,033 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 31 [2022-11-16 12:50:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:32,033 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2022-11-16 12:50:32,033 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-16 12:50:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2022-11-16 12:50:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 12:50:32,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:32,034 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-16 12:50:32,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:32,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:32,240 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:32,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2022-11-16 12:50:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:32,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064265495] [2022-11-16 12:50:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:32,361 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-16 12:50:32,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:32,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064265495] [2022-11-16 12:50:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064265495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:32,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:32,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:50:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295271516] [2022-11-16 12:50:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:32,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:50:32,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:50:32,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:32,364 INFO L87 Difference]: Start difference. First operand 251 states and 302 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-16 12:50:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:32,545 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2022-11-16 12:50:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:50:32,546 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-16 12:50:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:32,547 INFO L225 Difference]: With dead ends: 250 [2022-11-16 12:50:32,547 INFO L226 Difference]: Without dead ends: 250 [2022-11-16 12:50:32,547 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-16 12:50:32,548 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 5 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:32,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 408 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-16 12:50:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-16 12:50:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 249 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-16 12:50:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2022-11-16 12:50:32,558 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 33 [2022-11-16 12:50:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:32,559 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2022-11-16 12:50:32,559 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-16 12:50:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2022-11-16 12:50:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 12:50:32,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:32,561 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-16 12:50:32,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:50:32,561 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:32,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2022-11-16 12:50:32,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:32,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188792111] [2022-11-16 12:50:32,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:32,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:32,754 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-16 12:50:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188792111] [2022-11-16 12:50:32,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188792111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:32,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:32,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:50:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698544785] [2022-11-16 12:50:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:32,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:50:32,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:32,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:50:32,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:32,758 INFO L87 Difference]: Start difference. First operand 250 states and 301 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-16 12:50:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:32,928 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2022-11-16 12:50:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:50:32,929 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-16 12:50:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:32,930 INFO L225 Difference]: With dead ends: 249 [2022-11-16 12:50:32,930 INFO L226 Difference]: Without dead ends: 249 [2022-11-16 12:50:32,930 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-16 12:50:32,930 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 3 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:32,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 411 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-16 12:50:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-11-16 12:50:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.36986301369863) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:50:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2022-11-16 12:50:32,936 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 33 [2022-11-16 12:50:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:32,936 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2022-11-16 12:50:32,936 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-16 12:50:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2022-11-16 12:50:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 12:50:32,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:32,937 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-16 12:50:32,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:50:32,938 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2022-11-16 12:50:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:32,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426248984] [2022-11-16 12:50:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:32,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:33,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:33,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426248984] [2022-11-16 12:50:33,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426248984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:33,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:33,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:50:33,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388570274] [2022-11-16 12:50:33,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:33,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:50:33,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:33,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:50:33,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:50:33,238 INFO L87 Difference]: Start difference. First operand 249 states and 300 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-16 12:50:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:33,855 INFO L93 Difference]: Finished difference Result 364 states and 406 transitions. [2022-11-16 12:50:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:50:33,856 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-16 12:50:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:33,857 INFO L225 Difference]: With dead ends: 364 [2022-11-16 12:50:33,858 INFO L226 Difference]: Without dead ends: 364 [2022-11-16 12:50:33,858 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-16 12:50:33,858 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 501 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:33,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 837 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:50:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-16 12:50:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 250. [2022-11-16 12:50:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 249 states have internal predecessors, (298), 0 states have call successors, (0), 0 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-16 12:50:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2022-11-16 12:50:33,864 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 34 [2022-11-16 12:50:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:33,864 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2022-11-16 12:50:33,864 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-16 12:50:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2022-11-16 12:50:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 12:50:33,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:33,865 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-16 12:50:33,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 12:50:33,865 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:33,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2022-11-16 12:50:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:33,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016804746] [2022-11-16 12:50:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:33,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:34,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016804746] [2022-11-16 12:50:34,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016804746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:34,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:34,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:50:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166997725] [2022-11-16 12:50:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:34,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:50:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:50:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:50:34,383 INFO L87 Difference]: Start difference. First operand 250 states and 298 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-16 12:50:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:35,325 INFO L93 Difference]: Finished difference Result 428 states and 464 transitions. [2022-11-16 12:50:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:50:35,325 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-16 12:50:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:35,327 INFO L225 Difference]: With dead ends: 428 [2022-11-16 12:50:35,327 INFO L226 Difference]: Without dead ends: 428 [2022-11-16 12:50:35,328 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-16 12:50:35,328 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 461 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:35,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1024 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:50:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-11-16 12:50:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 256. [2022-11-16 12:50:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.337719298245614) internal successors, (305), 255 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-16 12:50:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 305 transitions. [2022-11-16 12:50:35,334 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 305 transitions. Word has length 34 [2022-11-16 12:50:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:35,335 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 305 transitions. [2022-11-16 12:50:35,335 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-16 12:50:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 305 transitions. [2022-11-16 12:50:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:50:35,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:35,336 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-16 12:50:35,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 12:50:35,336 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2022-11-16 12:50:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:35,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295006477] [2022-11-16 12:50:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:35,372 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-16 12:50:35,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:35,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295006477] [2022-11-16 12:50:35,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295006477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:35,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:35,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554275474] [2022-11-16 12:50:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:35,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:35,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:35,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:35,374 INFO L87 Difference]: Start difference. First operand 256 states and 305 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-16 12:50:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:35,383 INFO L93 Difference]: Finished difference Result 258 states and 307 transitions. [2022-11-16 12:50:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:35,384 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-16 12:50:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:35,385 INFO L225 Difference]: With dead ends: 258 [2022-11-16 12:50:35,385 INFO L226 Difference]: Without dead ends: 258 [2022-11-16 12:50:35,386 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-16 12:50:35,387 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 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-16 12:50:35,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-16 12:50:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-16 12:50:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3347826086956522) internal successors, (307), 257 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:50:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2022-11-16 12:50:35,393 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 35 [2022-11-16 12:50:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:35,394 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2022-11-16 12:50:35,394 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-16 12:50:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2022-11-16 12:50:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:50:35,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:35,395 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-16 12:50:35,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 12:50:35,397 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:35,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2022-11-16 12:50:35,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:35,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687175006] [2022-11-16 12:50:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:35,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:36,103 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-16 12:50:36,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:36,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687175006] [2022-11-16 12:50:36,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687175006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:36,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:36,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 12:50:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001676415] [2022-11-16 12:50:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:36,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:50:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:50:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:50:36,105 INFO L87 Difference]: Start difference. First operand 258 states and 307 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-16 12:50:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:37,061 INFO L93 Difference]: Finished difference Result 420 states and 456 transitions. [2022-11-16 12:50:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:50:37,061 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-16 12:50:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:37,063 INFO L225 Difference]: With dead ends: 420 [2022-11-16 12:50:37,063 INFO L226 Difference]: Without dead ends: 420 [2022-11-16 12:50:37,063 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-16 12:50:37,064 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 738 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:37,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1072 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:50:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-16 12:50:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 258. [2022-11-16 12:50:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 257 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-16 12:50:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-11-16 12:50:37,075 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 36 [2022-11-16 12:50:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:37,075 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-11-16 12:50:37,076 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-16 12:50:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-11-16 12:50:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:50:37,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:37,077 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-16 12:50:37,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 12:50:37,077 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:37,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1529477485, now seen corresponding path program 1 times [2022-11-16 12:50:37,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:37,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612632394] [2022-11-16 12:50:37,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:37,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:37,208 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-16 12:50:37,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:37,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612632394] [2022-11-16 12:50:37,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612632394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:37,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:37,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:37,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738340187] [2022-11-16 12:50:37,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:37,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:50:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:37,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:50:37,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:50:37,211 INFO L87 Difference]: Start difference. First operand 258 states and 306 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-16 12:50:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:37,479 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2022-11-16 12:50:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:50:37,480 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-16 12:50:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:37,481 INFO L225 Difference]: With dead ends: 273 [2022-11-16 12:50:37,481 INFO L226 Difference]: Without dead ends: 273 [2022-11-16 12:50:37,481 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-16 12:50:37,482 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 60 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:37,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 516 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-16 12:50:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2022-11-16 12:50:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 266 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-16 12:50:37,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2022-11-16 12:50:37,487 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 36 [2022-11-16 12:50:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:37,487 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2022-11-16 12:50:37,487 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-16 12:50:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2022-11-16 12:50:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:50:37,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:37,488 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-16 12:50:37,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 12:50:37,488 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:37,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2022-11-16 12:50:37,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:37,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700434252] [2022-11-16 12:50:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:37,792 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-16 12:50:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:37,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700434252] [2022-11-16 12:50:37,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700434252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:37,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:37,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:50:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950565013] [2022-11-16 12:50:37,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:37,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:50:37,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:37,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:50:37,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:50:37,794 INFO L87 Difference]: Start difference. First operand 267 states and 315 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-16 12:50:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:38,166 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2022-11-16 12:50:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:50:38,166 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-16 12:50:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:38,167 INFO L225 Difference]: With dead ends: 267 [2022-11-16 12:50:38,167 INFO L226 Difference]: Without dead ends: 267 [2022-11-16 12:50:38,168 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-16 12:50:38,168 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 81 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:38,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 647 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-16 12:50:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2022-11-16 12:50:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 265 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-16 12:50:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2022-11-16 12:50:38,173 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 36 [2022-11-16 12:50:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:38,174 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2022-11-16 12:50:38,174 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-16 12:50:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2022-11-16 12:50:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:50:38,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:38,175 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-16 12:50:38,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 12:50:38,175 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:38,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2022-11-16 12:50:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:38,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193644732] [2022-11-16 12:50:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:38,632 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-16 12:50:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:38,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193644732] [2022-11-16 12:50:38,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193644732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:38,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:38,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:50:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072907532] [2022-11-16 12:50:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:38,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:50:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:50:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:50:38,635 INFO L87 Difference]: Start difference. First operand 266 states and 314 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-16 12:50:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:39,101 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2022-11-16 12:50:39,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:50:39,102 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-16 12:50:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:39,103 INFO L225 Difference]: With dead ends: 266 [2022-11-16 12:50:39,103 INFO L226 Difference]: Without dead ends: 266 [2022-11-16 12:50:39,103 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-16 12:50:39,104 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 75 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:39,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 714 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:50:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-16 12:50:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2022-11-16 12:50:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 264 states have internal predecessors, (313), 0 states have call successors, (0), 0 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-16 12:50:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 313 transitions. [2022-11-16 12:50:39,108 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 313 transitions. Word has length 36 [2022-11-16 12:50:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:39,108 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 313 transitions. [2022-11-16 12:50:39,109 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-16 12:50:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 313 transitions. [2022-11-16 12:50:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:50:39,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:39,109 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-16 12:50:39,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 12:50:39,109 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2022-11-16 12:50:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:39,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794984263] [2022-11-16 12:50:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:39,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:39,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794984263] [2022-11-16 12:50:39,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794984263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:39,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:39,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:50:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065863313] [2022-11-16 12:50:39,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:39,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:50:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:50:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:50:39,243 INFO L87 Difference]: Start difference. First operand 265 states and 313 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-16 12:50:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:39,513 INFO L93 Difference]: Finished difference Result 275 states and 324 transitions. [2022-11-16 12:50:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:50:39,514 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-16 12:50:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:39,515 INFO L225 Difference]: With dead ends: 275 [2022-11-16 12:50:39,515 INFO L226 Difference]: Without dead ends: 275 [2022-11-16 12:50:39,515 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-16 12:50:39,515 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 23 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:39,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 639 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-16 12:50:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-11-16 12:50:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 260 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-16 12:50:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2022-11-16 12:50:39,521 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 37 [2022-11-16 12:50:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:39,521 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2022-11-16 12:50:39,521 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-16 12:50:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2022-11-16 12:50:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 12:50:39,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:39,522 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-16 12:50:39,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 12:50:39,522 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -886173384, now seen corresponding path program 1 times [2022-11-16 12:50:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:39,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651069704] [2022-11-16 12:50:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:39,558 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-16 12:50:39,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:39,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651069704] [2022-11-16 12:50:39,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651069704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:39,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:39,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:39,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465184698] [2022-11-16 12:50:39,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:39,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:39,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:39,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:39,561 INFO L87 Difference]: Start difference. First operand 261 states and 308 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-16 12:50:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:39,601 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2022-11-16 12:50:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:39,601 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-16 12:50:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:39,603 INFO L225 Difference]: With dead ends: 274 [2022-11-16 12:50:39,603 INFO L226 Difference]: Without dead ends: 274 [2022-11-16 12:50:39,603 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-16 12:50:39,604 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 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-16 12:50:39,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-16 12:50:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2022-11-16 12:50:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.3037974683544304) internal successors, (309), 261 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:50:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 309 transitions. [2022-11-16 12:50:39,618 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 309 transitions. Word has length 38 [2022-11-16 12:50:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:39,619 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 309 transitions. [2022-11-16 12:50:39,619 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-16 12:50:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 309 transitions. [2022-11-16 12:50:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:50:39,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:39,620 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-16 12:50:39,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-16 12:50:39,620 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:39,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2022-11-16 12:50:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:39,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347402287] [2022-11-16 12:50:39,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:39,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:40,485 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-16 12:50:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:40,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347402287] [2022-11-16 12:50:40,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347402287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:40,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:40,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:50:40,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017343279] [2022-11-16 12:50:40,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:40,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:50:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:40,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:50:40,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:50:40,487 INFO L87 Difference]: Start difference. First operand 262 states and 309 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-16 12:50:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:41,498 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2022-11-16 12:50:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:50:41,498 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-16 12:50:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:41,499 INFO L225 Difference]: With dead ends: 422 [2022-11-16 12:50:41,500 INFO L226 Difference]: Without dead ends: 422 [2022-11-16 12:50:41,500 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-16 12:50:41,501 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 479 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:41,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1142 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:50:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-16 12:50:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 262. [2022-11-16 12:50:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 261 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-16 12:50:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2022-11-16 12:50:41,506 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 39 [2022-11-16 12:50:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:41,507 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2022-11-16 12:50:41,508 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-16 12:50:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2022-11-16 12:50:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:50:41,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:41,509 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-16 12:50:41,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-16 12:50:41,509 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:41,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2051878023, now seen corresponding path program 1 times [2022-11-16 12:50:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:41,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355518526] [2022-11-16 12:50:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:41,552 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-16 12:50:41,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:41,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355518526] [2022-11-16 12:50:41,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355518526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:41,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:41,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752148908] [2022-11-16 12:50:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:41,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:41,555 INFO L87 Difference]: Start difference. First operand 262 states and 308 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-16 12:50:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:41,610 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2022-11-16 12:50:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:41,610 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-16 12:50:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:41,612 INFO L225 Difference]: With dead ends: 264 [2022-11-16 12:50:41,612 INFO L226 Difference]: Without dead ends: 264 [2022-11-16 12:50:41,613 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-16 12:50:41,614 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 159 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.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:41,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 159 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-16 12:50:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2022-11-16 12:50:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 259 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-16 12:50:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2022-11-16 12:50:41,625 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 41 [2022-11-16 12:50:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:41,625 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2022-11-16 12:50:41,625 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-16 12:50:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2022-11-16 12:50:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:50:41,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:41,626 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-16 12:50:41,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-16 12:50:41,627 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:41,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1173136884, now seen corresponding path program 1 times [2022-11-16 12:50:41,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:41,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979359595] [2022-11-16 12:50:41,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:41,850 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-16 12:50:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:41,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979359595] [2022-11-16 12:50:41,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979359595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:41,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841057796] [2022-11-16 12:50:41,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:41,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:41,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:41,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:41,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:50:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:41,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:50:42,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:42,014 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-16 12:50:42,019 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-16 12:50:42,049 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-16 12:50:42,059 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-16 12:50:42,163 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-16 12:50:42,165 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-16 12:50:42,182 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-16 12:50:42,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:42,326 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-16 12:50:42,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841057796] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:42,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:50:42,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-11-16 12:50:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96071094] [2022-11-16 12:50:42,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:42,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:50:42,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:50:42,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:50:42,328 INFO L87 Difference]: Start difference. First operand 260 states and 305 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-16 12:50:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:42,809 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2022-11-16 12:50:42,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:50:42,811 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-16 12:50:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:42,812 INFO L225 Difference]: With dead ends: 352 [2022-11-16 12:50:42,812 INFO L226 Difference]: Without dead ends: 352 [2022-11-16 12:50:42,813 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-16 12:50:42,813 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 178 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:42,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 802 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:50:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-16 12:50:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 284. [2022-11-16 12:50:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 283 states have internal predecessors, (339), 0 states have call successors, (0), 0 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-16 12:50:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 339 transitions. [2022-11-16 12:50:42,821 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 339 transitions. Word has length 41 [2022-11-16 12:50:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:42,822 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 339 transitions. [2022-11-16 12:50:42,822 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-16 12:50:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 339 transitions. [2022-11-16 12:50:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:50:42,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:42,823 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-16 12:50:42,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:43,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:43,028 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash 816295160, now seen corresponding path program 1 times [2022-11-16 12:50:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:43,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775625464] [2022-11-16 12:50:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:43,284 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-16 12:50:43,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:43,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775625464] [2022-11-16 12:50:43,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775625464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:43,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:43,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:50:43,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919754609] [2022-11-16 12:50:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:43,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:50:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:43,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:50:43,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:50:43,287 INFO L87 Difference]: Start difference. First operand 284 states and 339 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-16 12:50:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:43,757 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-11-16 12:50:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:50:43,757 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-16 12:50:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:43,759 INFO L225 Difference]: With dead ends: 348 [2022-11-16 12:50:43,759 INFO L226 Difference]: Without dead ends: 348 [2022-11-16 12:50:43,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:50:43,759 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 357 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:43,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 568 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:50:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-16 12:50:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 291. [2022-11-16 12:50:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 267 states have (on average 1.303370786516854) internal successors, (348), 290 states have internal predecessors, (348), 0 states have call successors, (0), 0 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-16 12:50:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2022-11-16 12:50:43,766 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 42 [2022-11-16 12:50:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:43,766 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2022-11-16 12:50:43,766 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-16 12:50:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2022-11-16 12:50:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:50:43,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:43,767 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-16 12:50:43,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-16 12:50:43,767 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash 816295161, now seen corresponding path program 1 times [2022-11-16 12:50:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:43,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683290684] [2022-11-16 12:50:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:44,152 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-16 12:50:44,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:44,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683290684] [2022-11-16 12:50:44,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683290684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:44,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:44,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:50:44,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331949701] [2022-11-16 12:50:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:44,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:50:44,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:44,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:50:44,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:50:44,154 INFO L87 Difference]: Start difference. First operand 291 states and 348 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-16 12:50:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:44,713 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-11-16 12:50:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:50:44,714 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-16 12:50:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:44,715 INFO L225 Difference]: With dead ends: 348 [2022-11-16 12:50:44,715 INFO L226 Difference]: Without dead ends: 348 [2022-11-16 12:50:44,715 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-16 12:50:44,716 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 252 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:44,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 674 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:50:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-16 12:50:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 297. [2022-11-16 12:50:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.3003663003663004) internal successors, (355), 296 states have internal predecessors, (355), 0 states have call successors, (0), 0 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-16 12:50:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2022-11-16 12:50:44,728 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 355 transitions. Word has length 42 [2022-11-16 12:50:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:44,729 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 355 transitions. [2022-11-16 12:50:44,729 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-16 12:50:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2022-11-16 12:50:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:50:44,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:44,730 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-16 12:50:44,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-16 12:50:44,730 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2007506213, now seen corresponding path program 1 times [2022-11-16 12:50:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:44,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433610321] [2022-11-16 12:50:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:44,814 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-16 12:50:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433610321] [2022-11-16 12:50:44,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433610321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535908252] [2022-11-16 12:50:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:44,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:44,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:50:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:44,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 12:50:44,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:45,033 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-16 12:50:45,077 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-16 12:50:45,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:45,148 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-16 12:50:45,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535908252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:45,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:50:45,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-16 12:50:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998968894] [2022-11-16 12:50:45,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:50:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:50:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:45,150 INFO L87 Difference]: Start difference. First operand 297 states and 355 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-16 12:50:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:45,257 INFO L93 Difference]: Finished difference Result 328 states and 386 transitions. [2022-11-16 12:50:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:50:45,257 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-16 12:50:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:45,258 INFO L225 Difference]: With dead ends: 328 [2022-11-16 12:50:45,259 INFO L226 Difference]: Without dead ends: 304 [2022-11-16 12:50:45,259 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-16 12:50:45,259 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:45,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2022-11-16 12:50:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-16 12:50:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-16 12:50:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 280 states have (on average 1.292857142857143) internal successors, (362), 303 states have internal predecessors, (362), 0 states have call successors, (0), 0 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-16 12:50:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 362 transitions. [2022-11-16 12:50:45,267 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 362 transitions. Word has length 42 [2022-11-16 12:50:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:45,267 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 362 transitions. [2022-11-16 12:50:45,267 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-16 12:50:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 362 transitions. [2022-11-16 12:50:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 12:50:45,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:45,270 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, 1] [2022-11-16 12:50:45,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:45,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-16 12:50:45,475 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1167718218, now seen corresponding path program 1 times [2022-11-16 12:50:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:45,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370531867] [2022-11-16 12:50:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:45,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:45,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370531867] [2022-11-16 12:50:45,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370531867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:45,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:45,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259568126] [2022-11-16 12:50:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:45,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:45,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:45,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:45,519 INFO L87 Difference]: Start difference. First operand 304 states and 362 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-16 12:50:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:45,530 INFO L93 Difference]: Finished difference Result 458 states and 556 transitions. [2022-11-16 12:50:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:45,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-11-16 12:50:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:45,533 INFO L225 Difference]: With dead ends: 458 [2022-11-16 12:50:45,533 INFO L226 Difference]: Without dead ends: 458 [2022-11-16 12:50:45,533 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-16 12:50:45,534 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 54 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:45,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-16 12:50:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 340. [2022-11-16 12:50:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3259493670886076) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 0 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-16 12:50:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2022-11-16 12:50:45,542 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 419 transitions. Word has length 44 [2022-11-16 12:50:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:45,542 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 419 transitions. [2022-11-16 12:50:45,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-16 12:50:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 419 transitions. [2022-11-16 12:50:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 12:50:45,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:45,547 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, 1] [2022-11-16 12:50:45,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-16 12:50:45,547 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1519355336, now seen corresponding path program 1 times [2022-11-16 12:50:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:45,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581457525] [2022-11-16 12:50:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:45,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:45,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581457525] [2022-11-16 12:50:45,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581457525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:45,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:45,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:50:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966272769] [2022-11-16 12:50:45,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:45,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:45,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:45,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:45,864 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-16 12:50:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:46,328 INFO L93 Difference]: Finished difference Result 370 states and 439 transitions. [2022-11-16 12:50:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:50:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-11-16 12:50:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:46,330 INFO L225 Difference]: With dead ends: 370 [2022-11-16 12:50:46,330 INFO L226 Difference]: Without dead ends: 370 [2022-11-16 12:50:46,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:50:46,331 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 134 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:46,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 514 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:50:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-16 12:50:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2022-11-16 12:50:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3227848101265822) internal successors, (418), 339 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-16 12:50:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 418 transitions. [2022-11-16 12:50:46,338 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 418 transitions. Word has length 44 [2022-11-16 12:50:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:46,339 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 418 transitions. [2022-11-16 12:50:46,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-16 12:50:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 418 transitions. [2022-11-16 12:50:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:50:46,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:46,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1] [2022-11-16 12:50:46,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-16 12:50:46,340 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1190454621, now seen corresponding path program 1 times [2022-11-16 12:50:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:46,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071020643] [2022-11-16 12:50:46,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:46,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:46,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071020643] [2022-11-16 12:50:46,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071020643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:46,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:46,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:50:46,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433498975] [2022-11-16 12:50:46,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:46,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:50:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:46,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:50:46,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:46,449 INFO L87 Difference]: Start difference. First operand 340 states and 418 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-16 12:50:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:46,573 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2022-11-16 12:50:46,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:50:46,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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 46 [2022-11-16 12:50:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:46,575 INFO L225 Difference]: With dead ends: 287 [2022-11-16 12:50:46,575 INFO L226 Difference]: Without dead ends: 287 [2022-11-16 12:50:46,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:50:46,576 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:46,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-16 12:50:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2022-11-16 12:50:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 263 states have (on average 1.2509505703422052) internal successors, (329), 285 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-16 12:50:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2022-11-16 12:50:46,582 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 46 [2022-11-16 12:50:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:46,583 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2022-11-16 12:50:46,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-16 12:50:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2022-11-16 12:50:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:50:46,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:46,584 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, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:46,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-16 12:50:46,584 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:46,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash 120277254, now seen corresponding path program 1 times [2022-11-16 12:50:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:46,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174963728] [2022-11-16 12:50:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:50:46,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:46,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174963728] [2022-11-16 12:50:46,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174963728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:46,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:46,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:50:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746958400] [2022-11-16 12:50:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:46,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:50:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:46,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:50:46,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:50:46,856 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-16 12:50:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:47,352 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2022-11-16 12:50:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:50:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-11-16 12:50:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:47,354 INFO L225 Difference]: With dead ends: 279 [2022-11-16 12:50:47,354 INFO L226 Difference]: Without dead ends: 279 [2022-11-16 12:50:47,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:50:47,355 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 413 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:47,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 639 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:50:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-16 12:50:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2022-11-16 12:50:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 262 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-16 12:50:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2022-11-16 12:50:47,360 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 49 [2022-11-16 12:50:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:47,360 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2022-11-16 12:50:47,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-16 12:50:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2022-11-16 12:50:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 12:50:47,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:47,361 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:47,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-16 12:50:47,361 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:47,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1590511077, now seen corresponding path program 1 times [2022-11-16 12:50:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:47,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494216508] [2022-11-16 12:50:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:50:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494216508] [2022-11-16 12:50:47,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494216508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:47,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:47,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:50:47,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758016363] [2022-11-16 12:50:47,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:47,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:50:47,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:47,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:50:47,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:50:47,520 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-16 12:50:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:47,639 INFO L93 Difference]: Finished difference Result 277 states and 318 transitions. [2022-11-16 12:50:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:50:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 50 [2022-11-16 12:50:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:47,641 INFO L225 Difference]: With dead ends: 277 [2022-11-16 12:50:47,641 INFO L226 Difference]: Without dead ends: 277 [2022-11-16 12:50:47,641 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-16 12:50:47,642 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 19 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:47,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 474 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-16 12:50:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2022-11-16 12:50:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 265 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-16 12:50:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2022-11-16 12:50:47,647 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 50 [2022-11-16 12:50:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:47,648 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2022-11-16 12:50:47,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-16 12:50:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2022-11-16 12:50:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 12:50:47,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:47,649 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:47,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-16 12:50:47,650 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:47,650 INFO L85 PathProgramCache]: Analyzing trace with hash -97333738, now seen corresponding path program 1 times [2022-11-16 12:50:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:47,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819976076] [2022-11-16 12:50:47,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:47,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:47,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:47,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819976076] [2022-11-16 12:50:47,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819976076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:47,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609339803] [2022-11-16 12:50:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:47,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:47,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:47,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:47,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:50:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:48,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:50:48,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:48,168 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 6 treesize of output 5 [2022-11-16 12:50:48,323 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:50:48,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:50:48,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-16 12:50:48,535 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:50:48,535 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-16 12:50:48,634 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:50:48,634 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 12:50:48,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:50:48,881 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 25 treesize of output 13 [2022-11-16 12:50:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:48,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:51,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:50:51,570 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-16 12:50:51,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:50:51,583 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 34 treesize of output 37 [2022-11-16 12:50:51,589 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 11 treesize of output 9 [2022-11-16 12:50:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:56,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609339803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:56,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:50:56,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-16 12:50:56,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610404834] [2022-11-16 12:50:56,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:56,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 12:50:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:56,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 12:50:56,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=736, Unknown=5, NotChecked=0, Total=870 [2022-11-16 12:50:56,472 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-16 12:50:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:57,130 INFO L93 Difference]: Finished difference Result 285 states and 327 transitions. [2022-11-16 12:50:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:50:57,131 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 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 52 [2022-11-16 12:50:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:57,132 INFO L225 Difference]: With dead ends: 285 [2022-11-16 12:50:57,132 INFO L226 Difference]: Without dead ends: 285 [2022-11-16 12:50:57,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=209, Invalid=908, Unknown=5, NotChecked=0, Total=1122 [2022-11-16 12:50:57,133 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 246 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:57,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1167 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 452 Invalid, 0 Unknown, 480 Unchecked, 0.5s Time] [2022-11-16 12:50:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-16 12:50:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2022-11-16 12:50:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 250 states have (on average 1.26) internal successors, (315), 272 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-16 12:50:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 315 transitions. [2022-11-16 12:50:57,138 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 315 transitions. Word has length 52 [2022-11-16 12:50:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:57,139 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 315 transitions. [2022-11-16 12:50:57,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-16 12:50:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2022-11-16 12:50:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 12:50:57,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:57,140 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:57,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:57,354 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:50:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash -97333737, now seen corresponding path program 1 times [2022-11-16 12:50:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593282379] [2022-11-16 12:50:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:57,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:57,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:57,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593282379] [2022-11-16 12:50:57,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593282379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:57,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357560069] [2022-11-16 12:50:57,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:57,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:57,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:57,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:57,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:50:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:58,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 12:50:58,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:58,053 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 6 treesize of output 5 [2022-11-16 12:50:58,231 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:50:58,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-11-16 12:50:58,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:50:58,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-16 12:50:58,310 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-16 12:50:58,515 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:50:58,515 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 12:50:58,527 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 5 treesize of output 3 [2022-11-16 12:50:58,547 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:50:58,547 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-16 12:50:58,691 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:50:58,691 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-16 12:50:58,699 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 18 treesize of output 20 [2022-11-16 12:50:59,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:50:59,006 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 25 treesize of output 13 [2022-11-16 12:50:59,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:50:59,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-16 12:50:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:59,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:51:00,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:00,420 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-16 12:51:00,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:00,433 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 34 treesize of output 37 [2022-11-16 12:51:00,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-16 12:51:00,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:00,498 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-16 12:51:00,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:00,509 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 12:51:00,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:00,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:00,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:00,521 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 27 treesize of output 19 [2022-11-16 12:51:00,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:00,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:00,531 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 20 treesize of output 12 [2022-11-16 12:51:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:01,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357560069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:51:01,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:51:01,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-16 12:51:01,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451662735] [2022-11-16 12:51:01,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:51:01,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 12:51:01,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 12:51:01,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=892, Unknown=4, NotChecked=0, Total=992 [2022-11-16 12:51:01,052 INFO L87 Difference]: Start difference. First operand 273 states and 315 transitions. Second operand has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-16 12:51:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:03,879 INFO L93 Difference]: Finished difference Result 468 states and 512 transitions. [2022-11-16 12:51:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:51:03,879 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 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 52 [2022-11-16 12:51:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:03,881 INFO L225 Difference]: With dead ends: 468 [2022-11-16 12:51:03,882 INFO L226 Difference]: Without dead ends: 468 [2022-11-16 12:51:03,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=473, Invalid=2603, Unknown=4, NotChecked=0, Total=3080 [2022-11-16 12:51:03,883 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 854 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 648 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:03,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1952 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1703 Invalid, 0 Unknown, 648 Unchecked, 1.4s Time] [2022-11-16 12:51:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-16 12:51:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 336. [2022-11-16 12:51:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 313 states have (on average 1.2619808306709266) internal successors, (395), 335 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-16 12:51:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 395 transitions. [2022-11-16 12:51:03,890 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 395 transitions. Word has length 52 [2022-11-16 12:51:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:03,891 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 395 transitions. [2022-11-16 12:51:03,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-16 12:51:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 395 transitions. [2022-11-16 12:51:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:51:03,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:03,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:03,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 12:51:04,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-11-16 12:51:04,098 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:51:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:04,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299753, now seen corresponding path program 1 times [2022-11-16 12:51:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:04,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705468538] [2022-11-16 12:51:04,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:04,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:04,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705468538] [2022-11-16 12:51:04,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705468538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:51:04,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119880118] [2022-11-16 12:51:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:04,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:51:04,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:51:04,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:51:04,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:51:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:05,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 12:51:05,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:51:05,162 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 6 treesize of output 5 [2022-11-16 12:51:05,202 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:51:05,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:51:05,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-16 12:51:05,344 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:05,344 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-16 12:51:05,445 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:05,445 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-16 12:51:05,658 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-11-16 12:51:05,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-11-16 12:51:05,756 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:51:05,757 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 1 case distinctions, treesize of input 43 treesize of output 36 [2022-11-16 12:51:06,284 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:06,284 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 1 case distinctions, treesize of input 118 treesize of output 100 [2022-11-16 12:51:06,664 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:06,664 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 1 case distinctions, treesize of input 118 treesize of output 100 [2022-11-16 12:51:07,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2022-11-16 12:51:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:07,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:51:07,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2022-11-16 12:51:07,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2022-11-16 12:51:07,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2022-11-16 12:51:07,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-11-16 12:51:07,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-11-16 12:51:08,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:08,134 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2022-11-16 12:51:08,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:08,144 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 546 treesize of output 524 [2022-11-16 12:51:08,153 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 596 treesize of output 564 [2022-11-16 12:51:08,171 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 548 treesize of output 508 [2022-11-16 12:51:08,186 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 528 treesize of output 484 [2022-11-16 12:51:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:08,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119880118] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:51:08,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:51:08,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 17] total 42 [2022-11-16 12:51:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296904149] [2022-11-16 12:51:08,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:51:08,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-16 12:51:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:08,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-16 12:51:08,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1183, Unknown=20, NotChecked=380, Total=1806 [2022-11-16 12:51:08,611 INFO L87 Difference]: Start difference. First operand 336 states and 395 transitions. Second operand has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-16 12:51:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:19,502 INFO L93 Difference]: Finished difference Result 716 states and 822 transitions. [2022-11-16 12:51:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-16 12:51:19,502 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 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 55 [2022-11-16 12:51:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:19,504 INFO L225 Difference]: With dead ends: 716 [2022-11-16 12:51:19,504 INFO L226 Difference]: Without dead ends: 716 [2022-11-16 12:51:19,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=579, Invalid=3277, Unknown=70, NotChecked=630, Total=4556 [2022-11-16 12:51:19,506 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 896 mSDsluCounter, 2976 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 4264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3092 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:19,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 3126 Invalid, 4264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1146 Invalid, 0 Unknown, 3092 Unchecked, 1.0s Time] [2022-11-16 12:51:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-11-16 12:51:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 368. [2022-11-16 12:51:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 345 states have (on average 1.2463768115942029) internal successors, (430), 367 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:51:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 430 transitions. [2022-11-16 12:51:19,515 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 430 transitions. Word has length 55 [2022-11-16 12:51:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:19,515 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 430 transitions. [2022-11-16 12:51:19,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-16 12:51:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 430 transitions. [2022-11-16 12:51:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:51:19,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:19,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:19,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:51:19,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-16 12:51:19,723 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:51:19,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299754, now seen corresponding path program 1 times [2022-11-16 12:51:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:19,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877438] [2022-11-16 12:51:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:22,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877438] [2022-11-16 12:51:22,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877438] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:51:22,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846355039] [2022-11-16 12:51:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:51:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:51:22,225 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:51:22,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:51:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:22,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-16 12:51:22,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:51:22,411 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 6 treesize of output 5 [2022-11-16 12:51:22,492 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:51:22,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:51:22,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:51:22,569 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 13 treesize of output 9 [2022-11-16 12:51:22,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-16 12:51:22,749 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:22,750 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-16 12:51:22,764 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 22 treesize of output 24 [2022-11-16 12:51:22,894 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:22,895 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-16 12:51:22,908 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 22 treesize of output 24 [2022-11-16 12:51:23,155 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-16 12:51:23,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 12:51:23,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:51:23,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:23,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-16 12:51:23,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:23,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-16 12:51:23,648 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:23,648 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 1 case distinctions, treesize of input 57 treesize of output 49 [2022-11-16 12:51:23,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:23,660 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 23 treesize of output 23 [2022-11-16 12:51:23,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:51:23,867 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2022-11-16 12:51:23,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-16 12:51:24,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:24,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 12:51:24,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:24,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:24,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-11-16 12:51:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:24,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:51:24,824 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 4))))) is different from false [2022-11-16 12:51:24,898 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) is different from false [2022-11-16 12:51:24,910 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-11-16 12:51:48,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:48,488 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 175 [2022-11-16 12:51:48,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:48,498 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 115 [2022-11-16 12:51:48,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:48,508 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 624 treesize of output 594 [2022-11-16 12:51:48,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:48,527 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 2484 treesize of output 2450 [2022-11-16 12:51:48,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:48,556 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 2346 treesize of output 2218 [2022-11-16 12:51:48,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:48,574 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 2122 treesize of output 1994 [2022-11-16 12:51:48,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:48,592 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 1946 treesize of output 1882 [2022-11-16 12:51:48,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:48,610 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 1842 treesize of output 1774 [2022-11-16 12:51:48,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:48,634 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 1730 treesize of output 1550 [2022-11-16 12:51:48,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:48,654 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 1462 treesize of output 1286 [2022-11-16 12:51:50,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:50,844 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 83 [2022-11-16 12:51:50,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:51:50,854 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 63 [2022-11-16 12:51:50,860 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 108 treesize of output 90 [2022-11-16 12:51:50,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:50,869 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 152 treesize of output 146 [2022-11-16 12:51:50,878 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 98 treesize of output 82 [2022-11-16 12:51:50,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:50,886 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 79 treesize of output 75 [2022-11-16 12:51:50,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:50,892 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 106 treesize of output 94 [2022-11-16 12:51:50,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:51:50,898 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 96 treesize of output 84 [2022-11-16 12:51:51,215 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 83 treesize of output 81 [2022-11-16 12:51:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:51:55,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846355039] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:51:55,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:51:55,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 44 [2022-11-16 12:51:55,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87855606] [2022-11-16 12:51:55,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:51:55,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 12:51:55,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:55,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 12:51:55,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1524, Unknown=32, NotChecked=246, Total=1980 [2022-11-16 12:51:55,356 INFO L87 Difference]: Start difference. First operand 368 states and 430 transitions. Second operand has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-16 12:52:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:04,029 INFO L93 Difference]: Finished difference Result 729 states and 806 transitions. [2022-11-16 12:52:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-16 12:52:04,030 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 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 55 [2022-11-16 12:52:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:04,033 INFO L225 Difference]: With dead ends: 729 [2022-11-16 12:52:04,033 INFO L226 Difference]: Without dead ends: 729 [2022-11-16 12:52:04,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2322 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=1076, Invalid=7088, Unknown=38, NotChecked=540, Total=8742 [2022-11-16 12:52:04,036 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 1309 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2211 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:04,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 2893 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1804 Invalid, 0 Unknown, 2211 Unchecked, 2.1s Time] [2022-11-16 12:52:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-11-16 12:52:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 448. [2022-11-16 12:52:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 426 states have (on average 1.2065727699530517) internal successors, (514), 447 states have internal predecessors, (514), 0 states have call successors, (0), 0 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-16 12:52:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 514 transitions. [2022-11-16 12:52:04,046 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 514 transitions. Word has length 55 [2022-11-16 12:52:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:04,046 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 514 transitions. [2022-11-16 12:52:04,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-16 12:52:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 514 transitions. [2022-11-16 12:52:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:52:04,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:04,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:52:04,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 12:52:04,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:52:04,253 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:52:04,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1738644409, now seen corresponding path program 1 times [2022-11-16 12:52:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:04,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167932100] [2022-11-16 12:52:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:52:05,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:05,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167932100] [2022-11-16 12:52:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167932100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:52:05,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683990832] [2022-11-16 12:52:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:05,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:52:05,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:52:05,472 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:52:05,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:52:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:05,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 12:52:05,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:52:05,674 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 6 treesize of output 5 [2022-11-16 12:52:05,708 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 13 treesize of output 9 [2022-11-16 12:52:05,714 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 13 treesize of output 9 [2022-11-16 12:52:05,881 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:52:05,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:52:05,993 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:52:05,994 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-16 12:52:06,021 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:52:06,021 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-16 12:52:06,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:52:06,442 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 1 case distinctions, treesize of input 82 treesize of output 72 [2022-11-16 12:52:06,459 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:52:06,459 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 1 case distinctions, treesize of input 82 treesize of output 84 [2022-11-16 12:52:06,736 INFO L321 Elim1Store]: treesize reduction 4, result has 94.9 percent of original size [2022-11-16 12:52:06,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 142 [2022-11-16 12:52:07,143 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-11-16 12:52:07,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 67 [2022-11-16 12:52:07,161 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:52:07,161 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 1 case distinctions, treesize of input 106 treesize of output 108 [2022-11-16 12:52:07,474 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:52:07,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 108 [2022-11-16 12:52:07,490 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 98 treesize of output 100 [2022-11-16 12:52:07,843 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-11-16 12:52:07,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 142 [2022-11-16 12:52:07,860 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:52:07,860 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 1 case distinctions, treesize of input 122 treesize of output 124 [2022-11-16 12:52:07,937 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 115 treesize of output 103 [2022-11-16 12:52:14,212 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 58 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:52:14,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:14,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 129 [2022-11-16 12:52:14,845 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 55 treesize of output 47 [2022-11-16 12:52:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:52:15,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:52:15,898 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1465) .cse0 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1466 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse2 .cse0 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1)))))) (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse4 0) (= (select |c_#valid| .cse4) 1)))))) is different from false [2022-11-16 12:52:15,920 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1464))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1464))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1466 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse5 .cse6 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) 1)) (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1465) .cse6 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0))))))))) is different from false [2022-11-16 12:52:15,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:15,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 283 [2022-11-16 12:52:16,273 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse2 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse2 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (or (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse0 0)))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse10 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse10 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) .cse10))) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse7 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= (select (select (store .cse8 .cse7 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~end~0#1.base|) .cse10) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|)))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse15 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse15 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse12 (select (select (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~end~0#1.base|) .cse15) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse12 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse13 (select (select (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~end~0#1.base|) .cse15) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse13 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse12 .cse13) (= .cse13 0))))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse20 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse20 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse18 (select (select (let ((.cse22 (store .cse21 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~end~0#1.base|) .cse20) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse18 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~end~0#1.base|) .cse20) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) .cse18) (= .cse18 0)))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse27 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse27 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse29 (store .cse28 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse23 (select (select .cse29 |c_ULTIMATE.start_main_~end~0#1.base|) .cse27))) (let ((.cse24 (select (select (store .cse29 .cse23 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse23 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= .cse24 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse25 (select (select (let ((.cse26 (store .cse28 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~end~0#1.base|) .cse27) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse25 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse24 .cse25))))))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse32 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse32 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse35 (store .cse33 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_~end~0#1.base|) .cse32))) (let ((.cse30 (select (select (store .cse35 .cse34 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse30 (select (select (let ((.cse31 (store .cse33 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse31 (select (select .cse31 |c_ULTIMATE.start_main_~end~0#1.base|) .cse32) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse34 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= .cse30 |c_ULTIMATE.start_main_~end~0#1.base|)))))))))) is different from false [2022-11-16 12:52:19,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:19,376 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 126 [2022-11-16 12:52:19,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:19,398 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 126 [2022-11-16 12:52:19,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:19,425 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 99 [2022-11-16 12:52:19,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:19,449 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 99 [2022-11-16 12:52:25,029 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-16 12:52:25,029 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 102 [2022-11-16 12:52:25,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:25,049 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 4276 treesize of output 3184 [2022-11-16 12:52:25,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:25,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3148 treesize of output 2296 [2022-11-16 12:52:25,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:25,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 518 treesize of output 446 [2022-11-16 12:52:25,142 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 438 treesize of output 406 [2022-11-16 12:52:25,167 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 1762 treesize of output 1634 [2022-11-16 12:52:25,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:25,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1634 treesize of output 1402 [2022-11-16 12:52:25,609 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-16 12:52:25,610 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 77 [2022-11-16 12:52:25,641 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-16 12:52:25,641 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 102 [2022-11-16 12:52:25,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:25,657 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 615 treesize of output 481 [2022-11-16 12:52:25,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:52:25,672 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 215 treesize of output 191 [2022-11-16 12:52:25,685 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 180 treesize of output 168 [2022-11-16 12:52:25,697 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 142 treesize of output 126 [2022-11-16 12:52:25,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:25,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 534 treesize of output 414 [2022-11-16 12:52:25,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:25,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 376 treesize of output 320 [2022-11-16 12:52:25,756 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 214 treesize of output 198 [2022-11-16 12:52:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:52:26,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683990832] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:52:26,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:52:26,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 50 [2022-11-16 12:52:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135796916] [2022-11-16 12:52:26,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:52:26,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 12:52:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:26,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 12:52:26,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1927, Unknown=38, NotChecked=276, Total=2450 [2022-11-16 12:52:26,095 INFO L87 Difference]: Start difference. First operand 448 states and 514 transitions. Second operand has 50 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-16 12:52:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:29,461 INFO L93 Difference]: Finished difference Result 471 states and 539 transitions. [2022-11-16 12:52:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:52:29,462 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 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 55 [2022-11-16 12:52:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:29,463 INFO L225 Difference]: With dead ends: 471 [2022-11-16 12:52:29,463 INFO L226 Difference]: Without dead ends: 471 [2022-11-16 12:52:29,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=403, Invalid=3477, Unknown=38, NotChecked=372, Total=4290 [2022-11-16 12:52:29,466 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 198 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1079 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:29,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1890 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 335 Invalid, 0 Unknown, 1079 Unchecked, 0.3s Time] [2022-11-16 12:52:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-16 12:52:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2022-11-16 12:52:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 447 states have (on average 1.2013422818791946) internal successors, (537), 468 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-16 12:52:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 537 transitions. [2022-11-16 12:52:29,473 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 537 transitions. Word has length 55 [2022-11-16 12:52:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:29,474 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 537 transitions. [2022-11-16 12:52:29,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-16 12:52:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 537 transitions. [2022-11-16 12:52:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 12:52:29,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:29,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:52:29,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:52:29,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:52:29,682 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:52:29,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash 320505786, now seen corresponding path program 1 times [2022-11-16 12:52:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:29,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729487706] [2022-11-16 12:52:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:52:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:30,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729487706] [2022-11-16 12:52:30,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729487706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:52:30,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:52:30,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:52:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939935898] [2022-11-16 12:52:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:52:30,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:52:30,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:52:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:52:30,331 INFO L87 Difference]: Start difference. First operand 469 states and 537 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-16 12:52:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:31,174 INFO L93 Difference]: Finished difference Result 493 states and 551 transitions. [2022-11-16 12:52:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:52:31,174 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-11-16 12:52:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:31,176 INFO L225 Difference]: With dead ends: 493 [2022-11-16 12:52:31,176 INFO L226 Difference]: Without dead ends: 493 [2022-11-16 12:52:31,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:52:31,176 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 434 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:31,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 678 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:52:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-11-16 12:52:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 469. [2022-11-16 12:52:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 447 states have (on average 1.1991051454138701) internal successors, (536), 468 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:52:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 536 transitions. [2022-11-16 12:52:31,185 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 536 transitions. Word has length 56 [2022-11-16 12:52:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:31,185 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 536 transitions. [2022-11-16 12:52:31,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-16 12:52:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 536 transitions. [2022-11-16 12:52:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:52:31,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:31,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:52:31,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-16 12:52:31,187 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-16 12:52:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1557310441, now seen corresponding path program 1 times [2022-11-16 12:52:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:31,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188469813] [2022-11-16 12:52:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:52:32,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:32,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188469813] [2022-11-16 12:52:32,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188469813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:52:32,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907570944] [2022-11-16 12:52:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:32,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:52:32,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:52:32,925 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:52:32,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afcba490-528f-4604-b1ee-108965e6a638/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:52:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:33,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-16 12:52:33,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:52:33,155 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 6 treesize of output 5 [2022-11-16 12:52:33,222 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:52:33,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:52:33,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-16 12:52:33,285 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 13 treesize of output 9 [2022-11-16 12:52:33,422 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:52:33,423 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-16 12:52:33,427 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 22 treesize of output 24 [2022-11-16 12:52:33,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:52:33,539 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 12:52:33,540 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 56 [2022-11-16 12:52:33,548 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2022-11-16 12:52:33,926 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-16 12:52:33,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 12:52:34,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:34,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:34,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:52:34,032 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:52:34,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2022-11-16 12:52:34,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:34,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 12:52:34,398 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:52:34,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 68 [2022-11-16 12:52:34,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:34,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-11-16 12:52:34,666 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:52:34,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 76 [2022-11-16 12:52:34,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2022-11-16 12:52:35,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:35,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:52:35,562 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-16 12:52:35,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 45 [2022-11-16 12:52:35,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:35,586 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:52:35,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2022-11-16 12:52:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:52:35,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:52:35,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1611))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4)) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1610))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) 0)))) is different from false [2022-11-16 12:52:35,919 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1610))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1611))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4)) 0)))) is different from false [2022-11-16 12:52:35,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1610))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1611))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4)) 0)))) is different from false [2022-11-16 12:52:35,962 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1611))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ 4 (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1610))) (select (select .cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) 0)))) is different from false [2022-11-16 12:52:56,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:56,190 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 612 treesize of output 523 [2022-11-16 12:52:56,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:56,201 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 512 treesize of output 323 [2022-11-16 12:52:56,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:52:56,675 INFO L321 Elim1Store]: treesize reduction 271, result has 39.6 percent of original size [2022-11-16 12:52:56,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 1314600 treesize of output 1215028 [2022-11-16 12:52:58,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:58,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:52:58,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:58,598 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 7649186 treesize of output 7144790 [2022-11-16 12:53:13,716 WARN L233 SmtUtils]: Spent 15.11s on a formula simplification that was a NOOP. DAG size: 2618 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 12:53:13,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:53:13,924 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 7652058 treesize of output 6883118 [2022-11-16 12:59:52,862 WARN L233 SmtUtils]: Spent 6.65m on a formula simplification. DAG size of input: 2667 DAG size of output: 2664 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 12:59:53,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:59:53,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:59:54,688 INFO L321 Elim1Store]: treesize reduction 51, result has 82.8 percent of original size [2022-11-16 12:59:54,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 7630662 treesize of output 6706282 [2022-11-16 13:05:05,225 WARN L233 SmtUtils]: Spent 5.18m on a formula simplification. DAG size of input: 2677 DAG size of output: 2669 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 13:05:06,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 13:05:06,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6476266 treesize of output 5671174