./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 10:47:26,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:47:26,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:47:26,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:47:26,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:47:26,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:47:26,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:47:26,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:47:26,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:47:26,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:47:26,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:47:26,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:47:26,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:47:26,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:47:26,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:47:26,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:47:26,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:47:26,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:47:26,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:47:26,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:47:26,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:47:26,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:47:26,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:47:26,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:47:26,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:47:26,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:47:26,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:47:26,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:47:26,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:47:26,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:47:26,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:47:26,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:47:26,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:47:26,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:47:26,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:47:26,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:47:26,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:47:26,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:47:26,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:47:26,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:47:26,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:47:26,906 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 10:47:26,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:47:26,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:47:26,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:47:26,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:47:26,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:47:26,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:47:26,928 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:47:26,928 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:47:26,928 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:47:26,929 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:47:26,929 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:47:26,929 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:47:26,929 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:47:26,929 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:47:26,929 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:47:26,930 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:47:26,930 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:47:26,930 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:47:26,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 10:47:26,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 10:47:26,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:47:26,931 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:47:26,931 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 10:47:26,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:47:26,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:47:26,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:47:26,932 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 10:47:26,932 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 10:47:26,932 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 10:47:26,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:47:26,932 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 10:47:26,932 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:47:26,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:47:26,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:47:26,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:47:26,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:47:26,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:47:26,933 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:47:26,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:47:26,933 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:47:26,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:47:26,933 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:47:26,933 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_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/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_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2022-12-14 10:47:27,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:47:27,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:47:27,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:47:27,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:47:27,137 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:47:27,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2022-12-14 10:47:29,699 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:47:29,892 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:47:29,892 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i [2022-12-14 10:47:29,899 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/data/4c6b30ad1/797506a0450c4138a10ed83e324391c5/FLAGd17663f9f [2022-12-14 10:47:30,285 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/data/4c6b30ad1/797506a0450c4138a10ed83e324391c5 [2022-12-14 10:47:30,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:47:30,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:47:30,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:47:30,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:47:30,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:47:30,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85cda17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30, skipping insertion in model container [2022-12-14 10:47:30,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:47:30,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:47:30,550 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2022-12-14 10:47:30,556 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2022-12-14 10:47:30,558 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2022-12-14 10:47:30,559 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2022-12-14 10:47:30,560 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2022-12-14 10:47:30,562 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2022-12-14 10:47:30,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:47:30,572 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:47:30,596 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2022-12-14 10:47:30,597 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2022-12-14 10:47:30,598 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2022-12-14 10:47:30,599 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2022-12-14 10:47:30,600 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2022-12-14 10:47:30,601 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2022-12-14 10:47:30,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:47:30,617 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:47:30,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30 WrapperNode [2022-12-14 10:47:30,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:47:30,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:47:30,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:47:30,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:47:30,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,657 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2022-12-14 10:47:30,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:47:30,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:47:30,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:47:30,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:47:30,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,677 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:47:30,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:47:30,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:47:30,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:47:30,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (1/1) ... [2022-12-14 10:47:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:47:30,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:47:30,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:47:30,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:47:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 10:47:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:47:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 10:47:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:47:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 10:47:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 10:47:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:47:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:47:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:47:30,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:47:30,827 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:47:30,828 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:47:31,119 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:47:31,166 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:47:31,166 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-12-14 10:47:31,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:47:31 BoogieIcfgContainer [2022-12-14 10:47:31,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:47:31,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:47:31,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:47:31,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:47:31,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:47:30" (1/3) ... [2022-12-14 10:47:31,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0d4094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:47:31, skipping insertion in model container [2022-12-14 10:47:31,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:47:30" (2/3) ... [2022-12-14 10:47:31,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0d4094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:47:31, skipping insertion in model container [2022-12-14 10:47:31,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:47:31" (3/3) ... [2022-12-14 10:47:31,174 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2022-12-14 10:47:31,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:47:31,189 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-12-14 10:47:31,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:47:31,226 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;@71c740b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:47:31,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-12-14 10:47:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 58 states have (on average 2.5172413793103448) internal successors, (146), 122 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 10:47:31,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:31,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 10:47:31,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash 8839, now seen corresponding path program 1 times [2022-12-14 10:47:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:31,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892237616] [2022-12-14 10:47:31,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:31,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:31,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892237616] [2022-12-14 10:47:31,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892237616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:31,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:31,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:47:31,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137860619] [2022-12-14 10:47:31,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:31,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:47:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:47:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:47:31,421 INFO L87 Difference]: Start difference. First operand has 123 states, 58 states have (on average 2.5172413793103448) internal successors, (146), 122 states have internal predecessors, (146), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:31,546 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2022-12-14 10:47:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:47:31,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 10:47:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:31,555 INFO L225 Difference]: With dead ends: 140 [2022-12-14 10:47:31,555 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 10:47:31,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-14 10:47:31,559 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 100 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:31,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 88 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 10:47:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2022-12-14 10:47:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 58 states have (on average 2.086206896551724) internal successors, (121), 118 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2022-12-14 10:47:31,589 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 2 [2022-12-14 10:47:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:31,589 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2022-12-14 10:47:31,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2022-12-14 10:47:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 10:47:31,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:31,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 10:47:31,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:47:31,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash 8840, now seen corresponding path program 1 times [2022-12-14 10:47:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:31,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115882462] [2022-12-14 10:47:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:31,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:31,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115882462] [2022-12-14 10:47:31,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115882462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:31,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:31,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:47:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901760872] [2022-12-14 10:47:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:31,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:47:31,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:31,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:47:31,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:47:31,653 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:31,743 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2022-12-14 10:47:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:47:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 10:47:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:31,746 INFO L225 Difference]: With dead ends: 144 [2022-12-14 10:47:31,746 INFO L226 Difference]: Without dead ends: 144 [2022-12-14 10:47:31,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-14 10:47:31,748 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 105 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:31,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-14 10:47:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2022-12-14 10:47:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-12-14 10:47:31,753 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 2 [2022-12-14 10:47:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:31,754 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-12-14 10:47:31,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-12-14 10:47:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:47:31,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:31,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:31,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:47:31,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -365389701, now seen corresponding path program 1 times [2022-12-14 10:47:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:31,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796463450] [2022-12-14 10:47:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:31,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:31,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796463450] [2022-12-14 10:47:31,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796463450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:31,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:31,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:47:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160662177] [2022-12-14 10:47:31,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:31,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:47:31,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:31,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:47:31,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:47:31,900 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:32,106 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2022-12-14 10:47:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:47:32,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 10:47:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:32,107 INFO L225 Difference]: With dead ends: 219 [2022-12-14 10:47:32,107 INFO L226 Difference]: Without dead ends: 219 [2022-12-14 10:47:32,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-12-14 10:47:32,109 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 244 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:32,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 98 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:47:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-14 10:47:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2022-12-14 10:47:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.978021978021978) internal successors, (180), 148 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2022-12-14 10:47:32,118 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 7 [2022-12-14 10:47:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:32,119 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2022-12-14 10:47:32,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2022-12-14 10:47:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:47:32,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:32,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:32,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 10:47:32,120 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash -365389702, now seen corresponding path program 1 times [2022-12-14 10:47:32,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:32,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314969799] [2022-12-14 10:47:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:32,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:32,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314969799] [2022-12-14 10:47:32,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314969799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:32,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:32,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:47:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061551840] [2022-12-14 10:47:32,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:32,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:47:32,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:32,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:47:32,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:47:32,179 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:32,284 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-12-14 10:47:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:47:32,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 10:47:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:32,286 INFO L225 Difference]: With dead ends: 139 [2022-12-14 10:47:32,286 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 10:47:32,286 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-12-14 10:47:32,287 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 164 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:32,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 64 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 10:47:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2022-12-14 10:47:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.6373626373626373) internal successors, (149), 133 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2022-12-14 10:47:32,291 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 7 [2022-12-14 10:47:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:32,292 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2022-12-14 10:47:32,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2022-12-14 10:47:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:47:32,292 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:32,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:32,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 10:47:32,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1048061535, now seen corresponding path program 1 times [2022-12-14 10:47:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:32,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436241233] [2022-12-14 10:47:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:32,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:32,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:32,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436241233] [2022-12-14 10:47:32,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436241233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:32,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:32,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:47:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744763868] [2022-12-14 10:47:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:32,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:47:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:32,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:47:32,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:47:32,452 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:32,572 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-12-14 10:47:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:47:32,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 10:47:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:32,573 INFO L225 Difference]: With dead ends: 133 [2022-12-14 10:47:32,573 INFO L226 Difference]: Without dead ends: 133 [2022-12-14 10:47:32,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-14 10:47:32,574 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 5 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:32,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 235 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-14 10:47:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-12-14 10:47:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 132 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2022-12-14 10:47:32,578 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 9 [2022-12-14 10:47:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:32,578 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2022-12-14 10:47:32,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-12-14 10:47:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:47:32,579 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:32,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:32,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 10:47:32,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1048061534, now seen corresponding path program 1 times [2022-12-14 10:47:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:32,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702388495] [2022-12-14 10:47:32,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:32,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:32,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:32,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702388495] [2022-12-14 10:47:32,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702388495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:32,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:32,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:47:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261556016] [2022-12-14 10:47:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:32,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:47:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:32,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:47:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:47:32,655 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:32,748 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2022-12-14 10:47:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:47:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 10:47:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:32,748 INFO L225 Difference]: With dead ends: 132 [2022-12-14 10:47:32,749 INFO L226 Difference]: Without dead ends: 132 [2022-12-14 10:47:32,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-14 10:47:32,749 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:32,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 242 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-14 10:47:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-12-14 10:47:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.5934065934065933) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2022-12-14 10:47:32,754 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 9 [2022-12-14 10:47:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:32,755 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2022-12-14 10:47:32,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2022-12-14 10:47:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:47:32,755 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:32,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:32,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 10:47:32,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1871606420, now seen corresponding path program 1 times [2022-12-14 10:47:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979594937] [2022-12-14 10:47:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:32,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:32,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:32,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979594937] [2022-12-14 10:47:32,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979594937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:32,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:32,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:47:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401729224] [2022-12-14 10:47:32,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:32,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:47:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:47:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:47:32,847 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:32,948 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2022-12-14 10:47:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:47:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 10:47:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:32,949 INFO L225 Difference]: With dead ends: 131 [2022-12-14 10:47:32,949 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 10:47:32,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-14 10:47:32,950 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:32,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 234 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 10:47:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-12-14 10:47:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 130 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-12-14 10:47:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2022-12-14 10:47:32,956 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 10 [2022-12-14 10:47:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:32,956 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2022-12-14 10:47:32,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2022-12-14 10:47:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:47:32,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:32,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:32,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 10:47:32,957 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1871606419, now seen corresponding path program 1 times [2022-12-14 10:47:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:32,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424194955] [2022-12-14 10:47:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:32,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:33,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:33,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424194955] [2022-12-14 10:47:33,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424194955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:33,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:33,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:47:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402554836] [2022-12-14 10:47:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:33,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:47:33,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:47:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:47:33,085 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:33,192 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-12-14 10:47:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:47:33,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 10:47:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:33,192 INFO L225 Difference]: With dead ends: 130 [2022-12-14 10:47:33,192 INFO L226 Difference]: Without dead ends: 130 [2022-12-14 10:47:33,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-14 10:47:33,193 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:33,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 230 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-14 10:47:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-12-14 10:47:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-12-14 10:47:33,196 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 10 [2022-12-14 10:47:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:33,196 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-12-14 10:47:33,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-12-14 10:47:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:47:33,196 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:33,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:33,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 10:47:33,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2129952249, now seen corresponding path program 1 times [2022-12-14 10:47:33,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:33,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611787080] [2022-12-14 10:47:33,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:33,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:33,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611787080] [2022-12-14 10:47:33,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611787080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:33,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:33,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 10:47:33,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354252786] [2022-12-14 10:47:33,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:33,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 10:47:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 10:47:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:47:33,352 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:33,562 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-12-14 10:47:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:47:33,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 10:47:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:33,563 INFO L225 Difference]: With dead ends: 134 [2022-12-14 10:47:33,563 INFO L226 Difference]: Without dead ends: 134 [2022-12-14 10:47:33,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:47:33,564 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 162 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:33,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 191 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:47:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-14 10:47:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2022-12-14 10:47:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-12-14 10:47:33,567 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 11 [2022-12-14 10:47:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:33,568 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-12-14 10:47:33,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-12-14 10:47:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:47:33,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:33,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:33,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 10:47:33,569 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2129952248, now seen corresponding path program 1 times [2022-12-14 10:47:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:33,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56089647] [2022-12-14 10:47:33,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:33,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:33,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56089647] [2022-12-14 10:47:33,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56089647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:33,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:33,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 10:47:33,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139643717] [2022-12-14 10:47:33,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:33,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 10:47:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 10:47:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:47:33,814 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:34,151 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2022-12-14 10:47:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:47:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 10:47:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:34,152 INFO L225 Difference]: With dead ends: 129 [2022-12-14 10:47:34,152 INFO L226 Difference]: Without dead ends: 129 [2022-12-14 10:47:34,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:47:34,153 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 158 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:34,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 231 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:47:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-14 10:47:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2022-12-14 10:47:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.5) 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-12-14 10:47:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-12-14 10:47:34,155 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 11 [2022-12-14 10:47:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:34,155 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-12-14 10:47:34,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-12-14 10:47:34,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:47:34,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:34,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:34,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 10:47:34,156 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash 977701891, now seen corresponding path program 1 times [2022-12-14 10:47:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:34,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705360869] [2022-12-14 10:47:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:34,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:34,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705360869] [2022-12-14 10:47:34,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705360869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:34,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:34,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 10:47:34,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67610029] [2022-12-14 10:47:34,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:34,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:47:34,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:34,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:47:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:47:34,271 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-12-14 10:47:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:34,421 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-12-14 10:47:34,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:47:34,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-12-14 10:47:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:34,422 INFO L225 Difference]: With dead ends: 109 [2022-12-14 10:47:34,422 INFO L226 Difference]: Without dead ends: 109 [2022-12-14 10:47:34,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:47:34,423 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:34,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 261 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-14 10:47:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-12-14 10:47:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.4875) internal successors, (119), 108 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2022-12-14 10:47:34,425 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 12 [2022-12-14 10:47:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:34,425 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2022-12-14 10:47:34,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-12-14 10:47:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2022-12-14 10:47:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:47:34,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:34,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:34,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 10:47:34,426 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash 977701892, now seen corresponding path program 1 times [2022-12-14 10:47:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:34,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302892086] [2022-12-14 10:47:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:34,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:34,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302892086] [2022-12-14 10:47:34,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302892086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:34,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:34,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 10:47:34,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107479501] [2022-12-14 10:47:34,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:34,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:47:34,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:47:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:47:34,587 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-12-14 10:47:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:34,703 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2022-12-14 10:47:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:47:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-12-14 10:47:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:34,704 INFO L225 Difference]: With dead ends: 108 [2022-12-14 10:47:34,704 INFO L226 Difference]: Without dead ends: 108 [2022-12-14 10:47:34,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:47:34,705 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:34,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 202 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-14 10:47:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-12-14 10:47:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 80 states have (on average 1.475) internal successors, (118), 107 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2022-12-14 10:47:34,708 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 12 [2022-12-14 10:47:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:34,708 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2022-12-14 10:47:34,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-12-14 10:47:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2022-12-14 10:47:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:47:34,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:34,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:34,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 10:47:34,709 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1815289415, now seen corresponding path program 1 times [2022-12-14 10:47:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:34,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935050064] [2022-12-14 10:47:34,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:34,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:34,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935050064] [2022-12-14 10:47:34,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935050064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:34,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:34,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:47:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946254083] [2022-12-14 10:47:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:34,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 10:47:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:34,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 10:47:34,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:47:34,849 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-12-14 10:47:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:35,110 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2022-12-14 10:47:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:47:35,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-12-14 10:47:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:35,111 INFO L225 Difference]: With dead ends: 123 [2022-12-14 10:47:35,111 INFO L226 Difference]: Without dead ends: 123 [2022-12-14 10:47:35,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:47:35,112 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 147 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:35,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 227 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:47:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-14 10:47:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2022-12-14 10:47:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-12-14 10:47:35,114 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 13 [2022-12-14 10:47:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:35,114 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-12-14 10:47:35,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-12-14 10:47:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-12-14 10:47:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:47:35,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:35,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:35,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 10:47:35,115 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1026143783, now seen corresponding path program 1 times [2022-12-14 10:47:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:35,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581791519] [2022-12-14 10:47:35,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:35,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:35,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581791519] [2022-12-14 10:47:35,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581791519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:35,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:35,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:47:35,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961910092] [2022-12-14 10:47:35,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:35,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:47:35,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:35,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:47:35,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:47:35,153 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-12-14 10:47:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:35,246 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2022-12-14 10:47:35,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:47:35,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-12-14 10:47:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:35,247 INFO L225 Difference]: With dead ends: 159 [2022-12-14 10:47:35,247 INFO L226 Difference]: Without dead ends: 159 [2022-12-14 10:47:35,248 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-12-14 10:47:35,248 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 158 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:35,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 113 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-12-14 10:47:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2022-12-14 10:47:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-12-14 10:47:35,252 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 14 [2022-12-14 10:47:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:35,252 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-12-14 10:47:35,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-12-14 10:47:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-12-14 10:47:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:47:35,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:35,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:35,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 10:47:35,253 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2088902450, now seen corresponding path program 1 times [2022-12-14 10:47:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:35,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290631668] [2022-12-14 10:47:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:35,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:35,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290631668] [2022-12-14 10:47:35,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290631668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:35,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:35,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 10:47:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412114406] [2022-12-14 10:47:35,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:35,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 10:47:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:35,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 10:47:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:47:35,758 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:36,085 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2022-12-14 10:47:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:47:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 10:47:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:36,087 INFO L225 Difference]: With dead ends: 141 [2022-12-14 10:47:36,087 INFO L226 Difference]: Without dead ends: 141 [2022-12-14 10:47:36,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:47:36,088 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 153 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:36,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 324 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:47:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-14 10:47:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2022-12-14 10:47:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 115 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2022-12-14 10:47:36,090 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 19 [2022-12-14 10:47:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:36,090 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2022-12-14 10:47:36,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2022-12-14 10:47:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:47:36,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:36,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:36,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 10:47:36,091 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2088869679, now seen corresponding path program 1 times [2022-12-14 10:47:36,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:36,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541064402] [2022-12-14 10:47:36,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:36,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:36,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:36,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541064402] [2022-12-14 10:47:36,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541064402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:36,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:36,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:47:36,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79796902] [2022-12-14 10:47:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:36,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:47:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:36,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:47:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:47:36,135 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:36,199 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-12-14 10:47:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:47:36,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 10:47:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:36,200 INFO L225 Difference]: With dead ends: 114 [2022-12-14 10:47:36,200 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 10:47:36,200 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-12-14 10:47:36,200 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:36,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 10:47:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-12-14 10:47:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3932584269662922) 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-12-14 10:47:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2022-12-14 10:47:36,203 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 19 [2022-12-14 10:47:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:36,203 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2022-12-14 10:47:36,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2022-12-14 10:47:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:47:36,203 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:36,203 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-12-14 10:47:36,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 10:47:36,203 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1654168128, now seen corresponding path program 1 times [2022-12-14 10:47:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:36,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013254495] [2022-12-14 10:47:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:36,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:36,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013254495] [2022-12-14 10:47:36,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013254495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:36,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:36,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 10:47:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686503919] [2022-12-14 10:47:36,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:36,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 10:47:36,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 10:47:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:47:36,395 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 10:47:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:36,580 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2022-12-14 10:47:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 10:47:36,580 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 10:47:36,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:36,580 INFO L225 Difference]: With dead ends: 137 [2022-12-14 10:47:36,581 INFO L226 Difference]: Without dead ends: 137 [2022-12-14 10:47:36,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:47:36,581 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 132 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:36,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 183 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:47:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-12-14 10:47:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2022-12-14 10:47:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2022-12-14 10:47:36,585 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 21 [2022-12-14 10:47:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:36,585 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2022-12-14 10:47:36,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 10:47:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2022-12-14 10:47:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:47:36,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:36,586 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-12-14 10:47:36,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 10:47:36,586 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1654168129, now seen corresponding path program 1 times [2022-12-14 10:47:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:36,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416196741] [2022-12-14 10:47:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:36,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:36,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416196741] [2022-12-14 10:47:36,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416196741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:36,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:36,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 10:47:36,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429682739] [2022-12-14 10:47:36,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:36,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 10:47:36,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:36,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 10:47:36,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:47:36,920 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 10:47:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:37,094 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2022-12-14 10:47:37,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:47:37,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 10:47:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:37,095 INFO L225 Difference]: With dead ends: 141 [2022-12-14 10:47:37,095 INFO L226 Difference]: Without dead ends: 141 [2022-12-14 10:47:37,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:47:37,096 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 52 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:37,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 230 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:47:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-14 10:47:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2022-12-14 10:47:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-12-14 10:47:37,099 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 21 [2022-12-14 10:47:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:37,100 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-12-14 10:47:37,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 10:47:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-12-14 10:47:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 10:47:37,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:37,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:47:37,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 10:47:37,101 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 517676064, now seen corresponding path program 1 times [2022-12-14 10:47:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:37,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724248959] [2022-12-14 10:47:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:37,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:37,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724248959] [2022-12-14 10:47:37,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724248959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:47:37,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:47:37,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 10:47:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535606033] [2022-12-14 10:47:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:47:37,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:47:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:37,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:47:37,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:47:37,454 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:47:37,687 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2022-12-14 10:47:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 10:47:37,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 10:47:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:47:37,687 INFO L225 Difference]: With dead ends: 139 [2022-12-14 10:47:37,688 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 10:47:37,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:47:37,688 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 166 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:47:37,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 315 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:47:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 10:47:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2022-12-14 10:47:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.368421052631579) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2022-12-14 10:47:37,691 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 23 [2022-12-14 10:47:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:47:37,692 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2022-12-14 10:47:37,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:47:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2022-12-14 10:47:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 10:47:37,692 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:47:37,693 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] [2022-12-14 10:47:37,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 10:47:37,693 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:47:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:47:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1537673770, now seen corresponding path program 1 times [2022-12-14 10:47:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:47:37,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339633959] [2022-12-14 10:47:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:47:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:38,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:47:38,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339633959] [2022-12-14 10:47:38,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339633959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:47:38,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105723014] [2022-12-14 10:47:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:47:38,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:47:38,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:47:38,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:47:38,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:47:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:47:38,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 10:47:38,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:47:38,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 10:47:38,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 10:47:38,621 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:47:38,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:47:38,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:47:38,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:38,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:47:38,825 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:47:38,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-12-14 10:47:38,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 10:47:38,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 10:47:38,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:47:38,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:47:38,954 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 10:47:38,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:47:38,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-14 10:47:38,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:47:39,063 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:47:39,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-12-14 10:47:39,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 10:47:39,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 10:47:39,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:47:39,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 10:47:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:39,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:47:39,194 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_782 (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_782) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-12-14 10:47:39,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_781 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_780) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-12-14 10:47:39,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:47:39,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-12-14 10:47:39,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-12-14 10:47:39,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-12-14 10:47:39,307 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (not .cse0) (forall ((v_ArrVal_779 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_779) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_780) v_arrayElimCell_19 v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_779 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_779))) (or (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_780) v_arrayElimCell_19 v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) (or (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_779) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) .cse0))) is different from false [2022-12-14 10:47:39,603 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (forall ((v_arrayElimCell_19 Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_774) .cse0 v_ArrVal_780) v_arrayElimCell_19 v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_14| Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_14|) 0)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_774) .cse2 v_ArrVal_779) |v_ULTIMATE.start_main_#t~malloc6#1.base_14| v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) (= .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_14|)))))) is different from false [2022-12-14 10:47:39,628 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (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_773 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_773) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (forall ((v_arrayElimCell_19 Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| .cse1 v_ArrVal_774) .cse0 v_ArrVal_780) v_arrayElimCell_19 v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_14| Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_773) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_14|) 0)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| .cse1 v_ArrVal_774) .cse3 v_ArrVal_779) |v_ULTIMATE.start_main_#t~malloc6#1.base_14| v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_14|)))))) is different from false [2022-12-14 10:47:39,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:47:39,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-12-14 10:47:39,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2022-12-14 10:47:39,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-12-14 10:47:39,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:47:39,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2022-12-14 10:47:39,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2022-12-14 10:47:39,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-12-14 10:47:42,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:42,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:47:42,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 139 [2022-12-14 10:47:42,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 227 [2022-12-14 10:47:42,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-12-14 10:47:42,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-12-14 10:47:42,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-12-14 10:47:42,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2022-12-14 10:47:42,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2022-12-14 10:47:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:47:42,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105723014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:47:42,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [322204771] [2022-12-14 10:47:42,785 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 10:47:42,785 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:47:42,790 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:47:42,796 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:47:42,797 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:47:42,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 10:47:42,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:47:42,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 10:47:42,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:47:42,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:47:42,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:47:42,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 10:47:42,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-12-14 10:47:42,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-12-14 10:47:42,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 10:47:42,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:42,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 10:47:43,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 10:47:43,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 10:47:43,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 10:47:43,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,070 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 10:47:43,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 125 [2022-12-14 10:47:43,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 94 [2022-12-14 10:47:43,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2022-12-14 10:47:43,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,136 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 10:47:43,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 77 [2022-12-14 10:47:43,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,160 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-12-14 10:47:43,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 36 [2022-12-14 10:47:43,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 10:47:43,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-12-14 10:47:43,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-12-14 10:47:43,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2022-12-14 10:47:43,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-12-14 10:47:43,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,371 INFO L321 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2022-12-14 10:47:43,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 192 treesize of output 151 [2022-12-14 10:47:43,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 114 [2022-12-14 10:47:43,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 45 [2022-12-14 10:47:43,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,683 INFO L321 Elim1Store]: treesize reduction 204, result has 15.7 percent of original size [2022-12-14 10:47:43,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 596 treesize of output 432 [2022-12-14 10:47:43,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:43,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,772 INFO L321 Elim1Store]: treesize reduction 122, result has 26.1 percent of original size [2022-12-14 10:47:43,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 590 treesize of output 592 [2022-12-14 10:47:43,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:43,885 INFO L321 Elim1Store]: treesize reduction 280, result has 16.2 percent of original size [2022-12-14 10:47:43,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 588 treesize of output 554 [2022-12-14 10:47:44,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:44,349 INFO L321 Elim1Store]: treesize reduction 266, result has 15.8 percent of original size [2022-12-14 10:47:44,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 1156 treesize of output 1131 [2022-12-14 10:47:44,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:44,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:44,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:44,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:44,840 INFO L321 Elim1Store]: treesize reduction 154, result has 21.4 percent of original size [2022-12-14 10:47:44,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2670 treesize of output 1833 [2022-12-14 10:47:44,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:44,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:45,086 INFO L321 Elim1Store]: treesize reduction 186, result has 22.5 percent of original size [2022-12-14 10:47:45,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 2394 treesize of output 2203 [2022-12-14 10:47:45,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:45,258 INFO L321 Elim1Store]: treesize reduction 170, result has 17.1 percent of original size [2022-12-14 10:47:45,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 2343 treesize of output 2237 [2022-12-14 10:47:45,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:45,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:45,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:45,782 INFO L321 Elim1Store]: treesize reduction 176, result has 15.0 percent of original size [2022-12-14 10:47:45,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 1288 treesize of output 990 [2022-12-14 10:47:45,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:45,826 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-12-14 10:47:45,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1199 treesize of output 1133 [2022-12-14 10:47:45,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:45,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:45,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:47:46,019 INFO L321 Elim1Store]: treesize reduction 332, result has 13.8 percent of original size [2022-12-14 10:47:46,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1215 treesize of output 1150 [2022-12-14 10:47:46,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 10:47:46,221 INFO L321 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2022-12-14 10:47:46,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 113 [2022-12-14 10:47:46,269 INFO L321 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2022-12-14 10:47:46,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 105 [2022-12-14 10:47:46,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 10:47:46,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 10:47:46,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:47:46,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:47:46,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 10:47:46,711 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-14 10:47:46,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 96 [2022-12-14 10:47:46,729 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-14 10:47:46,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 94 [2022-12-14 10:47:46,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2022-12-14 10:47:46,808 INFO L321 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2022-12-14 10:47:46,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 113 [2022-12-14 10:47:46,860 INFO L321 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2022-12-14 10:47:46,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 105 [2022-12-14 10:47:47,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 10:47:47,371 INFO L321 Elim1Store]: treesize reduction 50, result has 42.5 percent of original size [2022-12-14 10:47:47,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 184 [2022-12-14 10:47:47,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:47,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:47,439 INFO L321 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2022-12-14 10:47:47,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 194 [2022-12-14 10:47:47,482 INFO L321 Elim1Store]: treesize reduction 50, result has 42.5 percent of original size [2022-12-14 10:47:47,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 160 [2022-12-14 10:47:47,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:47,541 INFO L321 Elim1Store]: treesize reduction 54, result has 44.9 percent of original size [2022-12-14 10:47:47,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 174 [2022-12-14 10:47:50,128 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:47:50,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:47:50,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,176 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,185 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,207 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,258 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,300 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,335 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:47:50,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:47:50,424 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:47:50,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:47:50,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:50,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 10:47:50,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:50,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 10:47:50,515 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,541 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:50,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:50,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,587 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,614 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:50,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 10:47:50,645 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:50,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 10:47:50,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:50,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 10:47:50,753 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:50,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 10:47:50,786 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,814 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,855 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:50,888 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:50,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:50,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:50,962 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:50,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,081 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:47:51,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:47:51,096 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,150 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:47:51,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:47:51,188 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,211 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,248 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,264 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,327 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,343 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 10:47:51,434 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,478 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,496 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,528 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,572 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,613 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 10:47:51,662 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:51,765 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,805 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,843 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 17 treesize of output 12 [2022-12-14 10:47:51,881 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,936 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 10:47:51,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-12-14 10:47:51,956 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:51,976 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:52,007 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:47:52,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:52,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:52,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:52,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:47:52,650 INFO L321 Elim1Store]: treesize reduction 76, result has 39.7 percent of original size [2022-12-14 10:47:52,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1940 treesize of output 1845 [2022-12-14 10:47:52,708 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-12-14 10:47:52,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1795 treesize of output 1705 [2022-12-14 10:47:52,775 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-12-14 10:47:52,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1675 treesize of output 1585 [2022-12-14 10:48:02,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:48:02,228 INFO L321 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2022-12-14 10:48:02,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 10611 treesize of output 9321 [2022-12-14 10:48:02,475 INFO L321 Elim1Store]: treesize reduction 120, result has 21.1 percent of original size [2022-12-14 10:48:02,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 10193 treesize of output 9715 [2022-12-14 10:48:02,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:02,677 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 10:48:02,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 9754 treesize of output 9205 [2022-12-14 10:48:14,699 INFO L321 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2022-12-14 10:48:14,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 108 [2022-12-14 10:48:14,722 INFO L321 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2022-12-14 10:48:14,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 76 [2022-12-14 10:48:14,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:48:15,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 10:48:15,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 10:48:15,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:48:15,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:48:15,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 10:48:15,841 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:48:22,531 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5447#(and (<= 0 |#NULL.base|) (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_94| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_94|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_114| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_114|) 1) (= 2 (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_114|) |v_ULTIMATE.start_main_~x~0#1.offset_94|)) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_94|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_114|)))))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 10:48:22,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:48:22,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:48:22,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15] total 34 [2022-12-14 10:48:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106193890] [2022-12-14 10:48:22,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:48:22,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 10:48:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:48:22,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 10:48:22,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2265, Unknown=21, NotChecked=510, Total=3080 [2022-12-14 10:48:22,533 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:48:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:48:30,830 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-12-14 10:48:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 10:48:30,831 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 10:48:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:48:30,832 INFO L225 Difference]: With dead ends: 139 [2022-12-14 10:48:30,832 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 10:48:30,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=572, Invalid=4805, Unknown=45, NotChecked=740, Total=6162 [2022-12-14 10:48:30,833 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 217 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 41 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 641 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:48:30,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 476 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 843 Invalid, 18 Unknown, 641 Unchecked, 1.3s Time] [2022-12-14 10:48:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 10:48:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2022-12-14 10:48:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 119 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:48:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-12-14 10:48:30,835 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 28 [2022-12-14 10:48:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:48:30,835 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-12-14 10:48:30,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:48:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-12-14 10:48:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 10:48:30,835 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:48:30,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:48:30,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:48:31,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:48:31,037 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:48:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:48:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1945311899, now seen corresponding path program 1 times [2022-12-14 10:48:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:48:31,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973619798] [2022-12-14 10:48:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:48:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:48:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:48:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:48:31,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:48:31,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973619798] [2022-12-14 10:48:31,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973619798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:48:31,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:48:31,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:48:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693715791] [2022-12-14 10:48:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:48:31,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:48:31,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:48:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:48:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:48:31,116 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:48:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:48:31,235 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2022-12-14 10:48:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:48:31,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 10:48:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:48:31,236 INFO L225 Difference]: With dead ends: 118 [2022-12-14 10:48:31,236 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 10:48:31,236 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-12-14 10:48:31,237 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 20 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:48:31,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 160 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:48:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 10:48:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-12-14 10:48:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 117 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-12-14 10:48:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2022-12-14 10:48:31,240 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 29 [2022-12-14 10:48:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:48:31,240 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2022-12-14 10:48:31,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:48:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2022-12-14 10:48:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 10:48:31,241 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:48:31,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:48:31,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 10:48:31,241 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:48:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:48:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1945416168, now seen corresponding path program 1 times [2022-12-14 10:48:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:48:31,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97120180] [2022-12-14 10:48:31,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:48:31,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:48:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:48:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:48:31,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:48:31,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97120180] [2022-12-14 10:48:31,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97120180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:48:31,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:48:31,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:48:31,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776606464] [2022-12-14 10:48:31,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:48:31,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:48:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:48:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:48:31,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:48:31,294 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:48:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:48:31,414 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-12-14 10:48:31,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:48:31,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 10:48:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:48:31,415 INFO L225 Difference]: With dead ends: 127 [2022-12-14 10:48:31,415 INFO L226 Difference]: Without dead ends: 127 [2022-12-14 10:48:31,416 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-12-14 10:48:31,416 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 114 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:48:31,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 74 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:48:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-14 10:48:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2022-12-14 10:48:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 119 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:48:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-12-14 10:48:31,423 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 29 [2022-12-14 10:48:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:48:31,424 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-12-14 10:48:31,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:48:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-12-14 10:48:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:48:31,424 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:48:31,424 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-12-14 10:48:31,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 10:48:31,424 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-14 10:48:31,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:48:31,425 INFO L85 PathProgramCache]: Analyzing trace with hash 235877079, now seen corresponding path program 1 times [2022-12-14 10:48:31,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:48:31,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719907205] [2022-12-14 10:48:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:48:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:48:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:48:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:48:31,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:48:31,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719907205] [2022-12-14 10:48:31,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719907205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:48:31,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217174966] [2022-12-14 10:48:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:48:31,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:48:31,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:48:31,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:48:31,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a103d3-88b2-49f2-9cdb-136f6746f8e5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:48:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:48:32,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 10:48:32,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:48:32,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 10:48:32,133 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:48:32,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 10:48:32,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:48:32,231 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:48:32,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-12-14 10:48:32,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:48:32,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-12-14 10:48:32,342 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:48:32,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-12-14 10:48:32,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:48:32,355 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 10:48:32,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:48:32,389 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 10:48:32,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-12-14 10:48:32,473 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-14 10:48:32,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2022-12-14 10:48:32,538 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-14 10:48:32,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-12-14 10:48:32,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:48:32,659 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-12-14 10:48:32,660 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 27 [2022-12-14 10:48:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:48:32,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:48:32,954 INFO L321 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2022-12-14 10:48:32,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-12-14 10:48:32,962 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (let ((.cse0 (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~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1015))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1016)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) is different from false [2022-12-14 10:48:32,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:48:32,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-12-14 10:48:32,982 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (let ((.cse1 (select v_arrayElimArr_5 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_5) .cse1 v_ArrVal_1015))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1016)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2022-12-14 10:48:33,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:48:33,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2022-12-14 10:48:33,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:48:33,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21022 treesize of output 15841 [2022-12-14 10:48:33,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:48:33,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15810 treesize of output 13864 [2022-12-14 10:48:33,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:48:33,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13850 treesize of output 13050 [2022-12-14 10:48:33,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:48:33,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13066 treesize of output 12152 [2022-12-14 10:48:33,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12122 treesize of output 11482 [2022-12-14 10:48:33,842 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-12-14 10:48:33,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61