./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-token-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ --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 3438cae56d160b7d84eadaf1a799e28d3e56fe8aa8ad4206f8bf5c7c0818717b --- 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-dbf71c6-m [2022-10-17 10:38:47,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:38:47,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:38:47,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:38:47,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:38:47,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:38:47,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:38:47,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:38:47,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:38:47,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:38:47,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:38:47,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:38:47,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:38:47,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:38:47,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:38:47,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:38:47,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:38:47,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:38:47,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:38:47,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:38:47,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:38:47,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:38:47,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:38:47,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:38:47,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:38:47,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:38:47,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:38:47,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:38:47,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:38:47,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:38:47,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:38:47,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:38:47,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:38:47,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:38:47,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:38:47,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:38:47,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:38:47,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:38:47,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:38:47,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:38:47,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:38:47,923 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-17 10:38:47,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:38:47,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:38:47,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:38:47,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:38:47,948 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:38:47,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:38:47,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:38:47,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:38:47,949 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:38:47,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:38:47,950 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:38:47,950 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-17 10:38:47,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:38:47,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:38:47,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:38:47,951 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-17 10:38:47,951 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-17 10:38:47,951 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-17 10:38:47,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:38:47,952 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-17 10:38:47,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:38:47,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:38:47,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:38:47,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:38:47,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:38:47,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:38:47,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:38:47,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:38:47,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:38:47,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:38:47,954 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ 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 -> 3438cae56d160b7d84eadaf1a799e28d3e56fe8aa8ad4206f8bf5c7c0818717b [2022-10-17 10:38:48,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:38:48,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:38:48,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:38:48,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:38:48,328 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:38:48,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/forester-heap/sll-token-2.i [2022-10-17 10:38:48,429 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/data/ef50c470c/da3cf14793114d3bae43b7c13eeec474/FLAGa6db755e6 [2022-10-17 10:38:49,059 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:38:49,060 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i [2022-10-17 10:38:49,077 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/data/ef50c470c/da3cf14793114d3bae43b7c13eeec474/FLAGa6db755e6 [2022-10-17 10:38:49,273 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/data/ef50c470c/da3cf14793114d3bae43b7c13eeec474 [2022-10-17 10:38:49,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:38:49,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:38:49,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:38:49,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:38:49,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:38:49,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6a866a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49, skipping insertion in model container [2022-10-17 10:38:49,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:38:49,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:38:49,690 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22162,22175] [2022-10-17 10:38:49,695 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22311,22324] [2022-10-17 10:38:49,696 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22402,22415] [2022-10-17 10:38:49,698 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22484,22497] [2022-10-17 10:38:49,700 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22562,22575] [2022-10-17 10:38:49,703 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22708,22721] [2022-10-17 10:38:49,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:38:49,716 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:38:49,754 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22162,22175] [2022-10-17 10:38:49,756 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22311,22324] [2022-10-17 10:38:49,757 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22402,22415] [2022-10-17 10:38:49,759 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22484,22497] [2022-10-17 10:38:49,760 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22562,22575] [2022-10-17 10:38:49,762 WARN L230 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_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/sv-benchmarks/c/forester-heap/sll-token-2.i[22708,22721] [2022-10-17 10:38:49,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:38:49,792 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:38:49,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49 WrapperNode [2022-10-17 10:38:49,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:38:49,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:38:49,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:38:49,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:38:49,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,845 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2022-10-17 10:38:49,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:38:49,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:38:49,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:38:49,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:38:49,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:38:49,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:38:49,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:38:49,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:38:49,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (1/1) ... [2022-10-17 10:38:49,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:38:49,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:38:49,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:38:49,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:38:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 10:38:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:38:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-17 10:38:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:38:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-17 10:38:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-17 10:38:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:38:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:38:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:38:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:38:50,207 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:38:50,209 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:38:50,709 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:38:50,717 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:38:50,718 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-10-17 10:38:50,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:38:50 BoogieIcfgContainer [2022-10-17 10:38:50,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:38:50,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:38:50,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:38:50,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:38:50,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:38:49" (1/3) ... [2022-10-17 10:38:50,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d0e55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:38:50, skipping insertion in model container [2022-10-17 10:38:50,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:38:49" (2/3) ... [2022-10-17 10:38:50,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d0e55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:38:50, skipping insertion in model container [2022-10-17 10:38:50,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:38:50" (3/3) ... [2022-10-17 10:38:50,735 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2022-10-17 10:38:50,762 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:38:50,762 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-10-17 10:38:50,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:38:50,849 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;@71fafef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:38:50,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2022-10-17 10:38:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 64 states have (on average 2.21875) internal successors, (142), 118 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-17 10:38:50,861 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:50,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-17 10:38:50,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-17 10:38:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:50,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043827264] [2022-10-17 10:38:50,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:51,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:51,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043827264] [2022-10-17 10:38:51,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043827264] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:51,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:51,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:38:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618117125] [2022-10-17 10:38:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:51,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:38:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:38:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:38:51,154 INFO L87 Difference]: Start difference. First operand has 119 states, 64 states have (on average 2.21875) internal successors, (142), 118 states have internal predecessors, (142), 0 states have call successors, (0), 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-10-17 10:38:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:51,395 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-10-17 10:38:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:38:51,398 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-10-17 10:38:51,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:51,408 INFO L225 Difference]: With dead ends: 137 [2022-10-17 10:38:51,409 INFO L226 Difference]: Without dead ends: 135 [2022-10-17 10:38:51,410 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-10-17 10:38:51,414 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:51,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 97 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 10:38:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-10-17 10:38:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2022-10-17 10:38:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 114 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2022-10-17 10:38:51,461 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 3 [2022-10-17 10:38:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:51,462 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2022-10-17 10:38:51,462 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-10-17 10:38:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2022-10-17 10:38:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-17 10:38:51,463 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:51,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-17 10:38:51,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:38:51,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-17 10:38:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:51,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535864230] [2022-10-17 10:38:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:51,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:51,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535864230] [2022-10-17 10:38:51,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535864230] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:51,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:51,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:38:51,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791736973] [2022-10-17 10:38:51,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:51,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:38:51,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:51,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:38:51,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:38:51,604 INFO L87 Difference]: Start difference. First operand 115 states and 117 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-10-17 10:38:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:51,707 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2022-10-17 10:38:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:38:51,707 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-10-17 10:38:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:51,709 INFO L225 Difference]: With dead ends: 141 [2022-10-17 10:38:51,710 INFO L226 Difference]: Without dead ends: 141 [2022-10-17 10:38:51,710 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-10-17 10:38:51,712 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:51,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 99 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:38:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-10-17 10:38:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 113. [2022-10-17 10:38:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2022-10-17 10:38:51,727 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 3 [2022-10-17 10:38:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:51,728 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2022-10-17 10:38:51,728 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-10-17 10:38:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2022-10-17 10:38:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-17 10:38:51,729 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:51,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:38:51,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:38:51,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:51,730 INFO L85 PathProgramCache]: Analyzing trace with hash 59263631, now seen corresponding path program 1 times [2022-10-17 10:38:51,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:51,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671389199] [2022-10-17 10:38:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:51,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671389199] [2022-10-17 10:38:51,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671389199] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:51,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:51,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:38:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643821747] [2022-10-17 10:38:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:51,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:38:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:38:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:38:51,932 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:52,143 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-10-17 10:38:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:38:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-17 10:38:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:52,150 INFO L225 Difference]: With dead ends: 119 [2022-10-17 10:38:52,150 INFO L226 Difference]: Without dead ends: 119 [2022-10-17 10:38:52,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-17 10:38:52,155 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 165 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:52,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 10:38:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-17 10:38:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2022-10-17 10:38:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 101 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-10-17 10:38:52,181 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 8 [2022-10-17 10:38:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:52,183 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-10-17 10:38:52,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-10-17 10:38:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-17 10:38:52,184 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:52,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:38:52,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:38:52,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash 59263632, now seen corresponding path program 1 times [2022-10-17 10:38:52,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:52,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370896486] [2022-10-17 10:38:52,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:52,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370896486] [2022-10-17 10:38:52,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370896486] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:52,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:52,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:38:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697305316] [2022-10-17 10:38:52,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:52,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:38:52,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:38:52,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:38:52,515 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:52,796 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2022-10-17 10:38:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 10:38:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-17 10:38:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:52,799 INFO L225 Difference]: With dead ends: 184 [2022-10-17 10:38:52,799 INFO L226 Difference]: Without dead ends: 184 [2022-10-17 10:38:52,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-17 10:38:52,812 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 193 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:52,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 104 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 10:38:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-17 10:38:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 133. [2022-10-17 10:38:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-10-17 10:38:52,842 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2022-10-17 10:38:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:52,842 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-10-17 10:38:52,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-10-17 10:38:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-17 10:38:52,844 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:52,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:38:52,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:38:52,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:52,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-10-17 10:38:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:52,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459033673] [2022-10-17 10:38:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:52,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:53,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459033673] [2022-10-17 10:38:53,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459033673] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:53,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:53,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:38:53,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331472547] [2022-10-17 10:38:53,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:53,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:38:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:53,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:38:53,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:38:53,067 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:53,276 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-10-17 10:38:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 10:38:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-10-17 10:38:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:53,282 INFO L225 Difference]: With dead ends: 132 [2022-10-17 10:38:53,282 INFO L226 Difference]: Without dead ends: 132 [2022-10-17 10:38:53,283 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-10-17 10:38:53,285 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 64 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:53,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 221 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 10:38:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-10-17 10:38:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-10-17 10:38:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-10-17 10:38:53,317 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 12 [2022-10-17 10:38:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:53,318 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-10-17 10:38:53,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-10-17 10:38:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-17 10:38:53,319 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:53,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:38:53,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:38:53,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-10-17 10:38:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:53,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518331040] [2022-10-17 10:38:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518331040] [2022-10-17 10:38:53,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518331040] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:53,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:53,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:38:53,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511455362] [2022-10-17 10:38:53,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:53,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:38:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:53,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:38:53,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:38:53,695 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:53,972 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-10-17 10:38:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:38:53,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-10-17 10:38:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:53,974 INFO L225 Difference]: With dead ends: 131 [2022-10-17 10:38:53,974 INFO L226 Difference]: Without dead ends: 131 [2022-10-17 10:38:53,974 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-10-17 10:38:53,975 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:53,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 302 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 10:38:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-10-17 10:38:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2022-10-17 10:38:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 115 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2022-10-17 10:38:53,982 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 12 [2022-10-17 10:38:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:53,983 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2022-10-17 10:38:53,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2022-10-17 10:38:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 10:38:53,984 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:53,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:38:53,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:38:53,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 763856048, now seen corresponding path program 1 times [2022-10-17 10:38:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:53,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766541853] [2022-10-17 10:38:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:54,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766541853] [2022-10-17 10:38:54,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766541853] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:54,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:54,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:38:54,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399241569] [2022-10-17 10:38:54,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:54,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:38:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:38:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:38:54,139 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-17 10:38:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:54,252 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-10-17 10:38:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:38:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-17 10:38:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:54,253 INFO L225 Difference]: With dead ends: 115 [2022-10-17 10:38:54,254 INFO L226 Difference]: Without dead ends: 115 [2022-10-17 10:38:54,254 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-10-17 10:38:54,255 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:54,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 244 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:38:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-17 10:38:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-10-17 10:38:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 114 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2022-10-17 10:38:54,260 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 13 [2022-10-17 10:38:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:54,261 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2022-10-17 10:38:54,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-17 10:38:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2022-10-17 10:38:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 10:38:54,262 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:54,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:38:54,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:38:54,262 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:54,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash 763856049, now seen corresponding path program 1 times [2022-10-17 10:38:54,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:54,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399797617] [2022-10-17 10:38:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:54,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399797617] [2022-10-17 10:38:54,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399797617] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:54,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:54,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:38:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714792862] [2022-10-17 10:38:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:54,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:38:54,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:54,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:38:54,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:38:54,457 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-17 10:38:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:54,582 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-10-17 10:38:54,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:38:54,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-17 10:38:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:54,583 INFO L225 Difference]: With dead ends: 114 [2022-10-17 10:38:54,584 INFO L226 Difference]: Without dead ends: 114 [2022-10-17 10:38:54,584 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-10-17 10:38:54,585 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:54,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 246 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:38:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-10-17 10:38:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-10-17 10:38:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2022-10-17 10:38:54,589 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 13 [2022-10-17 10:38:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:54,589 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2022-10-17 10:38:54,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-17 10:38:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2022-10-17 10:38:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-17 10:38:54,590 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:54,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:38:54,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:38:54,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:54,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2113337263, now seen corresponding path program 1 times [2022-10-17 10:38:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:54,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373133075] [2022-10-17 10:38:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:54,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373133075] [2022-10-17 10:38:54,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373133075] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:54,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:54,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:38:54,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307346004] [2022-10-17 10:38:54,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:54,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:38:54,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:54,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:38:54,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:38:54,752 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-10-17 10:38:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:54,907 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-10-17 10:38:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:38:54,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-10-17 10:38:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:54,908 INFO L225 Difference]: With dead ends: 125 [2022-10-17 10:38:54,908 INFO L226 Difference]: Without dead ends: 125 [2022-10-17 10:38:54,909 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-10-17 10:38:54,911 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 16 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:54,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 366 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:38:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-10-17 10:38:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2022-10-17 10:38:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-10-17 10:38:54,916 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 14 [2022-10-17 10:38:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:54,917 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-10-17 10:38:54,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-10-17 10:38:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-10-17 10:38:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-17 10:38:54,918 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:54,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:38:54,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:38:54,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1298827700, now seen corresponding path program 1 times [2022-10-17 10:38:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:54,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475818854] [2022-10-17 10:38:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:54,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475818854] [2022-10-17 10:38:54,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475818854] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:54,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:54,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:38:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209080853] [2022-10-17 10:38:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:54,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:38:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:38:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:38:54,977 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:55,081 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2022-10-17 10:38:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:38:55,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-10-17 10:38:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:55,083 INFO L225 Difference]: With dead ends: 168 [2022-10-17 10:38:55,083 INFO L226 Difference]: Without dead ends: 168 [2022-10-17 10:38:55,084 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-10-17 10:38:55,084 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 165 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:55,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 131 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:38:55,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-10-17 10:38:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 110. [2022-10-17 10:38:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-10-17 10:38:55,090 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 16 [2022-10-17 10:38:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:55,091 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-10-17 10:38:55,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-10-17 10:38:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-17 10:38:55,092 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:55,092 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-10-17 10:38:55,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 10:38:55,092 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1685750883, now seen corresponding path program 1 times [2022-10-17 10:38:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:55,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221150517] [2022-10-17 10:38:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:55,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221150517] [2022-10-17 10:38:55,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221150517] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:55,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:55,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:38:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11275446] [2022-10-17 10:38:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:55,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:38:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:38:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:38:55,177 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-10-17 10:38:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:55,289 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-10-17 10:38:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:38:55,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-10-17 10:38:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:55,291 INFO L225 Difference]: With dead ends: 108 [2022-10-17 10:38:55,292 INFO L226 Difference]: Without dead ends: 108 [2022-10-17 10:38:55,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:38:55,293 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:55,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 218 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:38:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-17 10:38:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-17 10:38:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 107 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2022-10-17 10:38:55,298 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 21 [2022-10-17 10:38:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:55,298 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2022-10-17 10:38:55,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-10-17 10:38:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-10-17 10:38:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-17 10:38:55,299 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:55,299 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-10-17 10:38:55,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:38:55,300 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:55,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1685783654, now seen corresponding path program 1 times [2022-10-17 10:38:55,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:55,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726717009] [2022-10-17 10:38:55,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:55,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:55,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:55,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726717009] [2022-10-17 10:38:55,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726717009] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:55,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:55,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-17 10:38:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297295875] [2022-10-17 10:38:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:55,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-17 10:38:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-17 10:38:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-10-17 10:38:55,982 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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-10-17 10:38:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:56,643 INFO L93 Difference]: Finished difference Result 215 states and 220 transitions. [2022-10-17 10:38:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:38:56,643 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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-10-17 10:38:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:56,645 INFO L225 Difference]: With dead ends: 215 [2022-10-17 10:38:56,645 INFO L226 Difference]: Without dead ends: 215 [2022-10-17 10:38:56,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-10-17 10:38:56,646 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 282 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:56,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 415 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 10:38:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-10-17 10:38:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 121. [2022-10-17 10:38:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-10-17 10:38:56,656 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 21 [2022-10-17 10:38:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:56,656 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-10-17 10:38:56,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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-10-17 10:38:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-10-17 10:38:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-17 10:38:56,661 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:56,661 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] [2022-10-17 10:38:56,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 10:38:56,662 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:56,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash -843990961, now seen corresponding path program 1 times [2022-10-17 10:38:56,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:56,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293022519] [2022-10-17 10:38:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:57,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293022519] [2022-10-17 10:38:57,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293022519] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:57,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:57,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:38:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277823791] [2022-10-17 10:38:57,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:57,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:38:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:57,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:38:57,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:38:57,034 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:57,473 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2022-10-17 10:38:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:38:57,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-10-17 10:38:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:57,475 INFO L225 Difference]: With dead ends: 172 [2022-10-17 10:38:57,476 INFO L226 Difference]: Without dead ends: 172 [2022-10-17 10:38:57,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-10-17 10:38:57,477 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 220 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:57,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 266 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 10:38:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-10-17 10:38:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 127. [2022-10-17 10:38:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 126 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2022-10-17 10:38:57,482 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 24 [2022-10-17 10:38:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:57,482 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2022-10-17 10:38:57,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2022-10-17 10:38:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-17 10:38:57,485 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:57,485 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] [2022-10-17 10:38:57,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 10:38:57,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash -843990960, now seen corresponding path program 1 times [2022-10-17 10:38:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:57,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781961692] [2022-10-17 10:38:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:57,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:57,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781961692] [2022-10-17 10:38:57,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781961692] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:57,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:57,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:38:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147784369] [2022-10-17 10:38:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:57,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:38:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:57,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:38:57,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:38:57,912 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:58,434 INFO L93 Difference]: Finished difference Result 204 states and 208 transitions. [2022-10-17 10:38:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:38:58,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-10-17 10:38:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:58,436 INFO L225 Difference]: With dead ends: 204 [2022-10-17 10:38:58,436 INFO L226 Difference]: Without dead ends: 204 [2022-10-17 10:38:58,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-10-17 10:38:58,437 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 168 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:58,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 318 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 10:38:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-10-17 10:38:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 127. [2022-10-17 10:38:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-10-17 10:38:58,442 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 24 [2022-10-17 10:38:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:58,442 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-10-17 10:38:58,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-10-17 10:38:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-17 10:38:58,443 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:58,444 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] [2022-10-17 10:38:58,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-17 10:38:58,444 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 673509455, now seen corresponding path program 1 times [2022-10-17 10:38:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:58,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072240283] [2022-10-17 10:38:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:38:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:38:59,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:38:59,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072240283] [2022-10-17 10:38:59,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072240283] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:38:59,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:38:59,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-17 10:38:59,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073921309] [2022-10-17 10:38:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:38:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-17 10:38:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:38:59,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-17 10:38:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:38:59,006 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:38:59,613 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2022-10-17 10:38:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-17 10:38:59,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-10-17 10:38:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:38:59,615 INFO L225 Difference]: With dead ends: 202 [2022-10-17 10:38:59,616 INFO L226 Difference]: Without dead ends: 202 [2022-10-17 10:38:59,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2022-10-17 10:38:59,617 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 294 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 10:38:59,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 397 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 10:38:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-10-17 10:38:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 128. [2022-10-17 10:38:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 127 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-10-17 10:38:59,622 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 26 [2022-10-17 10:38:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:38:59,622 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-10-17 10:38:59,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:38:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-10-17 10:38:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-17 10:38:59,623 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:38:59,623 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] [2022-10-17 10:38:59,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-17 10:38:59,624 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:38:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:38:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1451405621, now seen corresponding path program 1 times [2022-10-17 10:38:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:38:59,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445312989] [2022-10-17 10:38:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:38:59,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:38:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:39:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:39:00,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445312989] [2022-10-17 10:39:00,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445312989] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:39:00,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134403789] [2022-10-17 10:39:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:39:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:39:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:39:00,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:39:00,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 10:39:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:39:00,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 47 conjunts are in the unsatisfiable core [2022-10-17 10:39:00,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:39:00,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:00,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:00,737 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:39:00,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:00,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:39:00,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:00,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:00,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2022-10-17 10:39:00,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-10-17 10:39:01,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-10-17 10:39:01,049 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:39:01,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-10-17 10:39:01,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-10-17 10:39:01,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-10-17 10:39:01,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2022-10-17 10:39:01,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-10-17 10:39:01,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:01,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:39:01,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0)) is different from false [2022-10-17 10:39:01,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0)) is different from false [2022-10-17 10:39:01,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_471 (Array Int Int)) (v_ArrVal_473 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_#t~malloc5#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0)) is different from false [2022-10-17 10:39:01,611 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-17 10:39:01,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-10-17 10:39:01,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_51| Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc5#1.base_6| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc5#1.base_6| |c_ULTIMATE.start_main_~head~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_51| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_51| v_ArrVal_464)) |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_471) |v_ULTIMATE.start_main_#t~malloc5#1.base_6| v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0))) is different from false [2022-10-17 10:39:01,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:39:01,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:01,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-10-17 10:39:01,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:39:01,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2022-10-17 10:39:01,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-17 10:39:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:01,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134403789] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:39:01,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:39:01,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 29 [2022-10-17 10:39:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428558917] [2022-10-17 10:39:01,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:39:01,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-17 10:39:01,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:39:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-17 10:39:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=468, Unknown=32, NotChecked=196, Total=812 [2022-10-17 10:39:01,887 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:39:03,060 INFO L93 Difference]: Finished difference Result 255 states and 265 transitions. [2022-10-17 10:39:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-17 10:39:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 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 30 [2022-10-17 10:39:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:39:03,062 INFO L225 Difference]: With dead ends: 255 [2022-10-17 10:39:03,062 INFO L226 Difference]: Without dead ends: 255 [2022-10-17 10:39:03,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=1138, Unknown=47, NotChecked=308, Total=1806 [2022-10-17 10:39:03,064 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 365 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1200 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-17 10:39:03,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 863 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 777 Invalid, 0 Unknown, 1200 Unchecked, 0.6s Time] [2022-10-17 10:39:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-10-17 10:39:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 150. [2022-10-17 10:39:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.296) internal successors, (162), 149 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2022-10-17 10:39:03,069 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 30 [2022-10-17 10:39:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:39:03,069 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2022-10-17 10:39:03,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2022-10-17 10:39:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-17 10:39:03,070 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:39:03,071 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] [2022-10-17 10:39:03,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:39:03,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-17 10:39:03,271 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:39:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:39:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash -472325846, now seen corresponding path program 1 times [2022-10-17 10:39:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:39:03,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223113382] [2022-10-17 10:39:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:39:03,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:39:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:39:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:39:03,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223113382] [2022-10-17 10:39:03,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223113382] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:39:03,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:39:03,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:39:03,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287137923] [2022-10-17 10:39:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:39:03,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:39:03,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:39:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:39:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:39:03,350 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:39:03,457 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-10-17 10:39:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:39:03,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-10-17 10:39:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:39:03,459 INFO L225 Difference]: With dead ends: 148 [2022-10-17 10:39:03,459 INFO L226 Difference]: Without dead ends: 148 [2022-10-17 10:39:03,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:39:03,460 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 21 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:39:03,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 193 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:39:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-10-17 10:39:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-10-17 10:39:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 124 states have (on average 1.282258064516129) internal successors, (159), 147 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-10-17 10:39:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2022-10-17 10:39:03,465 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 32 [2022-10-17 10:39:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:39:03,466 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2022-10-17 10:39:03,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-10-17 10:39:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-17 10:39:03,467 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:39:03,468 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-10-17 10:39:03,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-17 10:39:03,468 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:39:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:39:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1755815806, now seen corresponding path program 1 times [2022-10-17 10:39:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:39:03,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55192931] [2022-10-17 10:39:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:39:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:39:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:39:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:39:03,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55192931] [2022-10-17 10:39:03,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55192931] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:39:03,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:39:03,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:39:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106678577] [2022-10-17 10:39:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:39:03,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:39:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:39:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:39:03,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:39:03,565 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-10-17 10:39:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:39:03,673 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2022-10-17 10:39:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 10:39:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-10-17 10:39:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:39:03,675 INFO L225 Difference]: With dead ends: 157 [2022-10-17 10:39:03,675 INFO L226 Difference]: Without dead ends: 157 [2022-10-17 10:39:03,676 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-10-17 10:39:03,676 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 121 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:39:03,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 90 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:39:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-17 10:39:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2022-10-17 10:39:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.2777777777777777) internal successors, (161), 149 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2022-10-17 10:39:03,682 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 33 [2022-10-17 10:39:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:39:03,682 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2022-10-17 10:39:03,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-10-17 10:39:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2022-10-17 10:39:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-17 10:39:03,683 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:39:03,683 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] [2022-10-17 10:39:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-17 10:39:03,684 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:39:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:39:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash 416851232, now seen corresponding path program 1 times [2022-10-17 10:39:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:39:03,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874913931] [2022-10-17 10:39:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:39:03,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:39:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:39:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:39:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874913931] [2022-10-17 10:39:04,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874913931] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:39:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045092455] [2022-10-17 10:39:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:39:04,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:39:04,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:39:04,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:39:04,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 10:39:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:39:04,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-17 10:39:04,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:39:04,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:04,463 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:39:04,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:04,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:04,646 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-17 10:39:04,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-10-17 10:39:04,709 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-17 10:39:04,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-10-17 10:39:04,737 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:39:04,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:04,788 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-10-17 10:39:04,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-10-17 10:39:04,925 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-10-17 10:39:04,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 49 [2022-10-17 10:39:04,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-10-17 10:39:05,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:39:05,068 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:05,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 16 [2022-10-17 10:39:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:05,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:39:05,344 INFO L356 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2022-10-17 10:39:05,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 26 [2022-10-17 10:39:05,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_54| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_54|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_54| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc5#1.base|)) |c_ULTIMATE.start_main_#t~malloc5#1.base| v_ArrVal_645) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_54|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-10-17 10:39:05,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:05,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-10-17 10:39:05,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_54| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_54|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_2) .cse0 v_ArrVal_645) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_54|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse0) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_54| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-10-17 10:39:05,577 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_54| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_54|)) (not (= (select |c_#valid| .cse0) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_54| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_2) .cse0 v_ArrVal_645) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_54|))))) is different from false [2022-10-17 10:39:05,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_54| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_56| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_main_~x~0#1.offset_56|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_54|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_2) .cse1 v_ArrVal_645) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_54|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_54| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2022-10-17 10:39:05,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:05,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-10-17 10:39:05,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:05,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 71 [2022-10-17 10:39:05,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 52 [2022-10-17 10:39:05,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:05,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 56 [2022-10-17 10:39:05,684 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-17 10:39:05,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-10-17 10:39:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-17 10:39:06,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045092455] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:39:06,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:39:06,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 37 [2022-10-17 10:39:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678522227] [2022-10-17 10:39:06,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:39:06,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-17 10:39:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:39:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-17 10:39:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1004, Unknown=6, NotChecked=268, Total=1406 [2022-10-17 10:39:06,081 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:39:08,354 INFO L93 Difference]: Finished difference Result 233 states and 243 transitions. [2022-10-17 10:39:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-17 10:39:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 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-10-17 10:39:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:39:08,356 INFO L225 Difference]: With dead ends: 233 [2022-10-17 10:39:08,356 INFO L226 Difference]: Without dead ends: 233 [2022-10-17 10:39:08,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=361, Invalid=2097, Unknown=8, NotChecked=396, Total=2862 [2022-10-17 10:39:08,359 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 371 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1208 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-17 10:39:08,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1171 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1571 Invalid, 0 Unknown, 1208 Unchecked, 0.9s Time] [2022-10-17 10:39:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-10-17 10:39:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 156. [2022-10-17 10:39:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 155 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2022-10-17 10:39:08,365 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 33 [2022-10-17 10:39:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:39:08,365 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2022-10-17 10:39:08,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:39:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2022-10-17 10:39:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-17 10:39:08,367 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:39:08,367 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] [2022-10-17 10:39:08,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-17 10:39:08,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:39:08,595 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-10-17 10:39:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:39:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 416851233, now seen corresponding path program 1 times [2022-10-17 10:39:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:39:08,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694780913] [2022-10-17 10:39:08,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:39:08,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:39:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:39:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:09,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:39:09,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694780913] [2022-10-17 10:39:09,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694780913] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:39:09,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013665631] [2022-10-17 10:39:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:39:09,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:39:09,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:39:09,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:39:09,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba43cea4-caf9-4c43-a65b-00bc7dd6e930/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-17 10:39:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:39:09,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjunts are in the unsatisfiable core [2022-10-17 10:39:09,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:39:09,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:09,622 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-17 10:39:09,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:09,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:09,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:09,862 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-17 10:39:09,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:09,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:39:09,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-17 10:39:10,024 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-17 10:39:10,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:10,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:39:10,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-17 10:39:10,072 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-17 10:39:10,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-10-17 10:39:10,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2022-10-17 10:39:10,161 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-10-17 10:39:10,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 26 [2022-10-17 10:39:10,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-17 10:39:10,364 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-17 10:39:10,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 63 [2022-10-17 10:39:10,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-10-17 10:39:10,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:39:10,679 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-17 10:39:10,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 55 treesize of output 26 [2022-10-17 10:39:10,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:39:10,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-10-17 10:39:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:10,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:39:10,997 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_757) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_756) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)))) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_757) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) 4))))) is different from false [2022-10-17 10:39:11,029 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_757) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) 4)))) (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_757) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_756) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)))))) is different from false [2022-10-17 10:39:11,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:11,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 37 [2022-10-17 10:39:11,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:11,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 142 treesize of output 146 [2022-10-17 10:39:11,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 22 [2022-10-17 10:39:12,098 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc5#1.base_12| Int)) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc5#1.base_12|) 0)) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_1) |v_ULTIMATE.start_main_#t~malloc5#1.base_12| v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3))))) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (or (not (= (select |c_#valid| v_arrayElimCell_58) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_754) v_arrayElimCell_58 v_ArrVal_757) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) 1))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_756 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_4) .cse0 v_ArrVal_756) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|))))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_756 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (let ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse1) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_4) .cse1 v_ArrVal_756) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)))))))) is different from false [2022-10-17 10:39:12,188 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (or (not (= (select |c_#valid| v_arrayElimCell_58) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_754) v_arrayElimCell_58 v_ArrVal_757) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) 1))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc5#1.base_12| Int)) (or (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_prenex_1) |v_ULTIMATE.start_main_#t~malloc5#1.base_12| v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3))) (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc5#1.base_12|) 0)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (forall ((v_ArrVal_756 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_4) .cse0 v_ArrVal_756) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) .cse0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|))))) (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_756 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (let ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse1) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_4) .cse1 v_ArrVal_756) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) |c_ULTIMATE.start_main_#t~mem4#1.base|))))))) is different from false [2022-10-17 10:39:12,283 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc5#1.base_12| Int)) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_1) |v_ULTIMATE.start_main_#t~malloc5#1.base_12| v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3) 4)) (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc5#1.base_12|) 0)))) (forall ((v_subst_2 Int)) (or (forall ((v_ArrVal_756 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (let ((.cse1 (select v_arrayElimArr_4 v_subst_2))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_4) .cse1 v_ArrVal_756) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) .cse0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|))))) (not (<= 0 v_subst_2)))) (forall ((v_subst_1 Int)) (or (not (<= 0 v_subst_1)) (forall ((v_ArrVal_756 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (let ((.cse2 (select v_arrayElimArr_4 v_subst_1))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_4) .cse2 v_ArrVal_756) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) .cse2)) (not (= (select |c_#valid| .cse2) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|))))))) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int)) (or (not (= (select |c_#valid| v_arrayElimCell_58) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_61| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_61|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_754) v_arrayElimCell_58 v_ArrVal_757) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61|) 1))))) is different from false [2022-10-17 10:39:12,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-10-17 10:39:12,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 137 [2022-10-17 10:39:12,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 118 [2022-10-17 10:39:12,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 110 [2022-10-17 10:39:12,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-10-17 10:39:12,622 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 71 [2022-10-17 10:39:12,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 60 [2022-10-17 10:39:12,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 42 [2022-10-17 10:39:12,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2022-10-17 10:39:12,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 84 [2022-10-17 10:39:12,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 65 [2022-10-17 10:39:12,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-10-17 10:39:12,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 22 [2022-10-17 10:39:12,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:39:12,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:39:12,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-10-17 10:39:12,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-10-17 10:39:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:39:13,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013665631] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:39:13,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:39:13,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 41 [2022-10-17 10:39:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727762581] [2022-10-17 10:39:13,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:39:13,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-17 10:39:13,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:39:13,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-17 10:39:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1203, Unknown=7, NotChecked=370, Total=1722 [2022-10-17 10:39:13,508 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)