./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-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_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- 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 09:45:04,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:45:04,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:45:04,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:45:04,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:45:04,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:45:04,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:45:04,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:45:04,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:45:04,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:45:04,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:45:04,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:45:04,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:45:04,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:45:04,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:45:04,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:45:04,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:45:04,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:45:04,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:45:04,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:45:04,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:45:04,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:45:04,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:45:04,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:45:04,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:45:04,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:45:04,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:45:04,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:45:04,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:45:04,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:45:04,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:45:04,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:45:04,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:45:04,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:45:04,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:45:04,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:45:04,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:45:04,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:45:04,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:45:04,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:45:04,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:45:04,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 09:45:04,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:45:04,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:45:04,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:45:04,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:45:04,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:45:04,275 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:45:04,275 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:45:04,276 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:45:04,276 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:45:04,276 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:45:04,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 09:45:04,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 09:45:04,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 09:45:04,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:45:04,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:45:04,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:45:04,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:45:04,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:45:04,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:45:04,278 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:45:04,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:45:04,278 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:45:04,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:45:04,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:45:04,278 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_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2022-12-14 09:45:04,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:45:04,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:45:04,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:45:04,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:45:04,458 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:45:04,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-12-14 09:45:06,975 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:45:07,171 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:45:07,172 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-12-14 09:45:07,182 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/data/190aa357e/6a4bca2b23d04bf49c916317781e8dce/FLAG73ff791e0 [2022-12-14 09:45:07,536 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/data/190aa357e/6a4bca2b23d04bf49c916317781e8dce [2022-12-14 09:45:07,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:45:07,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:45:07,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:45:07,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:45:07,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:45:07,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:45:07" (1/1) ... [2022-12-14 09:45:07,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549248c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:07, skipping insertion in model container [2022-12-14 09:45:07,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:45:07" (1/1) ... [2022-12-14 09:45:07,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:45:07,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:45:07,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:45:07,762 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-12-14 09:45:07,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3de23600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:07, skipping insertion in model container [2022-12-14 09:45:07,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:45:07,763 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 09:45:07,764 INFO L158 Benchmark]: Toolchain (without parser) took 222.84ms. Allocated memory is still 182.5MB. Free memory was 122.0MB in the beginning and 110.1MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 09:45:07,765 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:45:07,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.41ms. Allocated memory is still 182.5MB. Free memory was 121.8MB in the beginning and 110.1MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 09:45:07,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.41ms. Allocated memory is still 182.5MB. Free memory was 121.8MB in the beginning and 110.1MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- 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 09:45:09,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:45:09,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:45:09,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:45:09,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:45:09,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:45:09,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:45:09,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:45:09,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:45:09,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:45:09,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:45:09,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:45:09,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:45:09,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:45:09,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:45:09,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:45:09,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:45:09,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:45:09,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:45:09,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:45:09,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:45:09,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:45:09,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:45:09,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:45:09,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:45:09,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:45:09,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:45:09,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:45:09,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:45:09,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:45:09,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:45:09,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:45:09,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:45:09,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:45:09,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:45:09,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:45:09,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:45:09,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:45:09,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:45:09,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:45:09,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:45:09,110 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 09:45:09,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:45:09,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:45:09,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:45:09,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:45:09,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:45:09,130 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:45:09,131 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:45:09,131 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:45:09,131 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:45:09,131 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:45:09,131 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:45:09,132 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:45:09,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 09:45:09,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 09:45:09,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:45:09,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:45:09,133 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:45:09,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:45:09,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:45:09,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:45:09,134 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 09:45:09,134 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 09:45:09,134 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 09:45:09,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:45:09,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 09:45:09,135 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 09:45:09,135 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 09:45:09,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:45:09,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:45:09,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:45:09,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 09:45:09,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:45:09,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:45:09,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:45:09,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:45:09,141 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 09:45:09,141 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 09:45:09,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:45:09,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 09:45:09,142 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2022-12-14 09:45:09,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:45:09,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:45:09,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:45:09,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:45:09,366 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:45:09,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-12-14 09:45:11,947 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:45:12,168 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:45:12,169 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-12-14 09:45:12,179 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/data/ce32f59b4/aae5a19171b44b3eb21099969aed54e1/FLAG6607d7108 [2022-12-14 09:45:12,194 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/data/ce32f59b4/aae5a19171b44b3eb21099969aed54e1 [2022-12-14 09:45:12,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:45:12,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:45:12,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:45:12,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:45:12,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:45:12,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356df46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12, skipping insertion in model container [2022-12-14 09:45:12,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:45:12,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:45:12,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:45:12,447 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 09:45:12,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:45:12,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:45:12,500 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:45:12,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:45:12,566 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:45:12,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12 WrapperNode [2022-12-14 09:45:12,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:45:12,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:45:12,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:45:12,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:45:12,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,605 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-12-14 09:45:12,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:45:12,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:45:12,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:45:12,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:45:12,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,634 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:45:12,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:45:12,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:45:12,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:45:12,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (1/1) ... [2022-12-14 09:45:12,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:45:12,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:45:12,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:45:12,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:45:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 09:45:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:45:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-12-14 09:45:12,692 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-12-14 09:45:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:45:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:45:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:45:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:45:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:45:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 09:45:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 09:45:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 09:45:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:45:12,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:45:12,783 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:45:12,785 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:45:13,463 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:45:13,468 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:45:13,468 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 09:45:13,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:45:13 BoogieIcfgContainer [2022-12-14 09:45:13,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:45:13,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:45:13,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:45:13,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:45:13,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:45:12" (1/3) ... [2022-12-14 09:45:13,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224e2261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:45:13, skipping insertion in model container [2022-12-14 09:45:13,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:12" (2/3) ... [2022-12-14 09:45:13,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224e2261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:45:13, skipping insertion in model container [2022-12-14 09:45:13,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:45:13" (3/3) ... [2022-12-14 09:45:13,477 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2022-12-14 09:45:13,491 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:45:13,491 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-12-14 09:45:13,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:45:13,534 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;@10f827ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:45:13,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-12-14 09:45:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 09:45:13,545 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:13,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 09:45:13,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-12-14 09:45:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:13,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183457941] [2022-12-14 09:45:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:13,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:13,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:13,561 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:13,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 09:45:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:13,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 09:45:13,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:13,771 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 7 [2022-12-14 09:45:13,811 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:45:13,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 09:45:13,830 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 09:45:13,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:13,830 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:13,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183457941] [2022-12-14 09:45:13,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183457941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:13,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:13,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:45:13,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103812594] [2022-12-14 09:45:13,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:13,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:45:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:45:13,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:45:13,870 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 09:45:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:14,407 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-12-14 09:45:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:45:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 09:45:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:14,414 INFO L225 Difference]: With dead ends: 208 [2022-12-14 09:45:14,414 INFO L226 Difference]: Without dead ends: 206 [2022-12-14 09:45:14,415 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 09:45:14,417 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:14,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 09:45:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-14 09:45:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-12-14 09:45:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-12-14 09:45:14,450 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-12-14 09:45:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:14,450 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-12-14 09:45:14,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 09:45:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-12-14 09:45:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 09:45:14,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:14,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 09:45:14,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:45:14,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:14,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:14,655 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-12-14 09:45:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:14,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417954954] [2022-12-14 09:45:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:14,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:14,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:14,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:14,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 09:45:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:14,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 09:45:14,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:14,729 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 09:45:14,734 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 7 [2022-12-14 09:45:14,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:45:14,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 09:45:14,773 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:45:14,774 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 13 treesize of output 13 [2022-12-14 09:45:14,790 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 09:45:14,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:14,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:14,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417954954] [2022-12-14 09:45:14,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417954954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:14,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:14,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:45:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458832876] [2022-12-14 09:45:14,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:14,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:45:14,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:14,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:45:14,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:45:14,793 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 09:45:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:15,342 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-12-14 09:45:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:45:15,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 09:45:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:15,344 INFO L225 Difference]: With dead ends: 196 [2022-12-14 09:45:15,345 INFO L226 Difference]: Without dead ends: 196 [2022-12-14 09:45:15,345 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 09:45:15,345 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:15,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 09:45:15,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-12-14 09:45:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-12-14 09:45:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-12-14 09:45:15,355 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-12-14 09:45:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:15,355 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-12-14 09:45:15,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 09:45:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-12-14 09:45:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:45:15,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:15,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:45:15,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 09:45:15,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:15,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-12-14 09:45:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:15,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241371108] [2022-12-14 09:45:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:15,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:15,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:15,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 09:45:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:15,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:45:15,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:15,614 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 7 [2022-12-14 09:45:15,622 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 09:45:15,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:15,622 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:15,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241371108] [2022-12-14 09:45:15,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241371108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:15,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:15,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:45:15,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141879728] [2022-12-14 09:45:15,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:15,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:45:15,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:45:15,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:45:15,624 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:15,885 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-12-14 09:45:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:45:15,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 09:45:15,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:15,886 INFO L225 Difference]: With dead ends: 208 [2022-12-14 09:45:15,886 INFO L226 Difference]: Without dead ends: 208 [2022-12-14 09:45:15,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 09:45:15,887 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:15,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:45:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-14 09:45:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-12-14 09:45:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-12-14 09:45:15,893 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-12-14 09:45:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:15,894 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-12-14 09:45:15,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-12-14 09:45:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:45:15,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:15,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:45:15,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 09:45:16,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:16,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-12-14 09:45:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:16,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408585927] [2022-12-14 09:45:16,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:16,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:16,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:16,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:16,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 09:45:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:16,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:45:16,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:16,154 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 09:45:16,166 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 09:45:16,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:16,166 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:16,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408585927] [2022-12-14 09:45:16,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408585927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:16,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:16,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:45:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776946672] [2022-12-14 09:45:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:16,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:45:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:45:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:45:16,167 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:16,504 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-12-14 09:45:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:45:16,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 09:45:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:16,505 INFO L225 Difference]: With dead ends: 181 [2022-12-14 09:45:16,505 INFO L226 Difference]: Without dead ends: 181 [2022-12-14 09:45:16,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 09:45:16,506 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:16,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:45:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-14 09:45:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-12-14 09:45:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-12-14 09:45:16,514 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-12-14 09:45:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:16,514 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-12-14 09:45:16,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-12-14 09:45:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 09:45:16,515 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:16,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:16,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 09:45:16,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:16,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:16,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-12-14 09:45:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:16,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689711207] [2022-12-14 09:45:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:16,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:16,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:16,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:16,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 09:45:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:16,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 09:45:16,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:16,821 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 7 [2022-12-14 09:45:16,852 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:45:16,852 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 13 treesize of output 13 [2022-12-14 09:45:16,899 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 14 treesize of output 16 [2022-12-14 09:45:16,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 09:45:16,944 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 09:45:16,949 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 09:45:16,962 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 09:45:16,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:16,962 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:16,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689711207] [2022-12-14 09:45:16,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689711207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:16,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:16,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 09:45:16,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934386069] [2022-12-14 09:45:16,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:16,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:45:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:16,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:45:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:45:16,964 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 09:45:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:17,462 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-12-14 09:45:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:45:17,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 09:45:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:17,464 INFO L225 Difference]: With dead ends: 183 [2022-12-14 09:45:17,464 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 09:45:17,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:45:17,464 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:17,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 602 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:45:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 09:45:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-12-14 09:45:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-12-14 09:45:17,475 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-12-14 09:45:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:17,475 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-12-14 09:45:17,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 09:45:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-12-14 09:45:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 09:45:17,476 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:17,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:17,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 09:45:17,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:17,677 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-12-14 09:45:17,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:17,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629158878] [2022-12-14 09:45:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:17,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:17,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:17,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:17,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 09:45:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:17,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 09:45:17,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:17,821 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 09:45:17,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:17,821 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629158878] [2022-12-14 09:45:17,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629158878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:17,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:17,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:45:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699228099] [2022-12-14 09:45:17,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:17,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:45:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:45:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:45:17,823 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:17,848 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-12-14 09:45:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:45:17,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 09:45:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:17,849 INFO L225 Difference]: With dead ends: 258 [2022-12-14 09:45:17,849 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 09:45:17,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 09:45:17,850 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 80 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:17,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 545 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:45:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 09:45:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-12-14 09:45:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-12-14 09:45:17,855 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-12-14 09:45:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:17,855 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-12-14 09:45:17,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-12-14 09:45:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:45:17,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:17,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:17,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 09:45:18,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:18,057 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-12-14 09:45:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:18,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844546629] [2022-12-14 09:45:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:18,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:18,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:18,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:18,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 09:45:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:18,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:45:18,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:18,187 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:45:18,187 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 09:45:18,196 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 09:45:18,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:18,197 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:18,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844546629] [2022-12-14 09:45:18,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844546629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:18,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:18,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:45:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142719973] [2022-12-14 09:45:18,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:18,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:45:18,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:18,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:45:18,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:45:18,198 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:18,430 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-12-14 09:45:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:45:18,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 09:45:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:18,431 INFO L225 Difference]: With dead ends: 209 [2022-12-14 09:45:18,431 INFO L226 Difference]: Without dead ends: 209 [2022-12-14 09:45:18,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 09:45:18,432 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:18,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:45:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-12-14 09:45:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-12-14 09:45:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2022-12-14 09:45:18,436 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 13 [2022-12-14 09:45:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:18,436 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2022-12-14 09:45:18,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2022-12-14 09:45:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:45:18,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:18,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:18,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 09:45:18,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:18,638 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-12-14 09:45:18,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:18,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664990079] [2022-12-14 09:45:18,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:18,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:18,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:18,641 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:18,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 09:45:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:18,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 09:45:18,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:18,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:45:18,729 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 9 treesize of output 11 [2022-12-14 09:45:18,735 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 10 treesize of output 8 [2022-12-14 09:45:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:45:18,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:18,742 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664990079] [2022-12-14 09:45:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664990079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:45:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079782498] [2022-12-14 09:45:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:18,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:45:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:45:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:45:18,744 INFO L87 Difference]: Start difference. First operand 207 states and 243 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:19,033 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2022-12-14 09:45:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:45:19,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 09:45:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:19,034 INFO L225 Difference]: With dead ends: 194 [2022-12-14 09:45:19,034 INFO L226 Difference]: Without dead ends: 194 [2022-12-14 09:45:19,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 09:45:19,035 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:19,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 198 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:45:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-14 09:45:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-12-14 09:45:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2022-12-14 09:45:19,039 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 13 [2022-12-14 09:45:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:19,039 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2022-12-14 09:45:19,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2022-12-14 09:45:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 09:45:19,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:19,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:19,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-12-14 09:45:19,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:19,241 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-12-14 09:45:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:19,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893249537] [2022-12-14 09:45:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:19,247 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:19,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 09:45:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:19,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 09:45:19,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:19,338 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:45:19,339 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-12-14 09:45:19,349 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 09:45:19,371 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 23 treesize of output 11 [2022-12-14 09:45:19,379 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 09:45:19,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:19,379 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:19,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893249537] [2022-12-14 09:45:19,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893249537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:19,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:19,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:45:19,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883785453] [2022-12-14 09:45:19,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:19,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:45:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:19,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:45:19,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:45:19,384 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:19,880 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2022-12-14 09:45:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:45:19,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 09:45:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:19,881 INFO L225 Difference]: With dead ends: 243 [2022-12-14 09:45:19,881 INFO L226 Difference]: Without dead ends: 243 [2022-12-14 09:45:19,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:45:19,882 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 26 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:19,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 387 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 09:45:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-12-14 09:45:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2022-12-14 09:45:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2022-12-14 09:45:19,888 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 17 [2022-12-14 09:45:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:19,888 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2022-12-14 09:45:19,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2022-12-14 09:45:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 09:45:19,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:19,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:19,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-14 09:45:20,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:20,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:20,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-12-14 09:45:20,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:20,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362063968] [2022-12-14 09:45:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:20,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:20,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:20,096 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:20,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 09:45:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:20,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 09:45:20,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:20,214 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:45:20,214 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 09:45:20,229 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 09:45:20,235 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 09:45:20,300 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 21 treesize of output 9 [2022-12-14 09:45:20,306 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 19 treesize of output 7 [2022-12-14 09:45:20,322 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 09:45:20,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:45:20,322 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:20,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362063968] [2022-12-14 09:45:20,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362063968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:45:20,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:45:20,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:45:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416060933] [2022-12-14 09:45:20,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:45:20,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:45:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:45:20,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:45:20,324 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:20,995 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-12-14 09:45:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:45:20,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 09:45:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:20,997 INFO L225 Difference]: With dead ends: 200 [2022-12-14 09:45:20,997 INFO L226 Difference]: Without dead ends: 200 [2022-12-14 09:45:20,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:45:20,998 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 3 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:20,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 486 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 09:45:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-12-14 09:45:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2022-12-14 09:45:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-12-14 09:45:21,002 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 17 [2022-12-14 09:45:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:21,002 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-12-14 09:45:21,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-12-14 09:45:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:45:21,003 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:21,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:21,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 09:45:21,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:21,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-12-14 09:45:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:21,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528755271] [2022-12-14 09:45:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:21,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:21,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:21,212 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:21,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 09:45:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:21,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 09:45:21,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:21,350 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:45:21,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 22 [2022-12-14 09:45:21,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:21,466 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:21,466 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 36 treesize of output 37 [2022-12-14 09:45:21,505 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 33 treesize of output 15 [2022-12-14 09:45:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:45:21,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:21,589 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_176) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)))) is different from false [2022-12-14 09:45:21,601 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 09:45:21,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:21,618 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 26 treesize of output 27 [2022-12-14 09:45:21,620 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 44 treesize of output 32 [2022-12-14 09:45:21,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:45:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 09:45:21,668 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:21,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528755271] [2022-12-14 09:45:21,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528755271] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:21,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [527653654] [2022-12-14 09:45:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:21,668 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:45:21,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:45:21,669 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:45:21,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-12-14 09:45:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:21,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 09:45:21,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:21,844 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:45:21,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 22 [2022-12-14 09:45:21,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:21,952 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:21,952 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 36 treesize of output 37 [2022-12-14 09:45:21,977 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 33 treesize of output 15 [2022-12-14 09:45:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:45:21,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:22,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_218) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)))) is different from false [2022-12-14 09:45:22,011 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_218) c_create_data_~data~0.base) .cse0)))))) is different from false [2022-12-14 09:45:22,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:22,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 09:45:22,032 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 44 treesize of output 32 [2022-12-14 09:45:22,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:45:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 09:45:22,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [527653654] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:22,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069320168] [2022-12-14 09:45:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:45:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:45:22,062 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:45:22,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 09:45:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:22,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 09:45:22,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:22,158 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:45:22,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 22 [2022-12-14 09:45:22,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:22,217 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:22,218 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 36 treesize of output 37 [2022-12-14 09:45:22,259 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 33 treesize of output 15 [2022-12-14 09:45:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:45:22,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:22,289 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_260) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 09:45:22,299 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_260) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 09:45:22,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:22,317 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 26 treesize of output 27 [2022-12-14 09:45:22,320 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 44 treesize of output 32 [2022-12-14 09:45:22,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:45:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 09:45:22,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069320168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:22,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 09:45:22,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5, 6, 5, 6] total 17 [2022-12-14 09:45:22,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543688651] [2022-12-14 09:45:22,351 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 09:45:22,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 09:45:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 09:45:22,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=101, Unknown=6, NotChecked=150, Total=306 [2022-12-14 09:45:22,352 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:23,354 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2022-12-14 09:45:23,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:45:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 09:45:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:23,356 INFO L225 Difference]: With dead ends: 203 [2022-12-14 09:45:23,356 INFO L226 Difference]: Without dead ends: 203 [2022-12-14 09:45:23,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=117, Unknown=6, NotChecked=162, Total=342 [2022-12-14 09:45:23,357 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 45 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:23,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1064 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 518 Invalid, 0 Unknown, 558 Unchecked, 0.9s Time] [2022-12-14 09:45:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-14 09:45:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2022-12-14 09:45:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2022-12-14 09:45:23,361 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 22 [2022-12-14 09:45:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:23,361 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2022-12-14 09:45:23,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2022-12-14 09:45:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:45:23,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:23,362 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:23,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 09:45:23,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-12-14 09:45:23,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-12-14 09:45:23,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:23,965 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:23,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-12-14 09:45:23,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:23,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759873597] [2022-12-14 09:45:23,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:23,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:23,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:23,969 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:23,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-14 09:45:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:24,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 09:45:24,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:24,103 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:45:24,103 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 09:45:24,108 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 10 treesize of output 8 [2022-12-14 09:45:24,126 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 09:45:24,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:24,267 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:24,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:24,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:24,338 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 31 treesize of output 13 [2022-12-14 09:45:24,342 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 19 treesize of output 7 [2022-12-14 09:45:24,364 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 09:45:24,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:24,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_306) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_306) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_305) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-12-14 09:45:24,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:45:24,726 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-12-14 09:45:24,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:24,740 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 45 treesize of output 36 [2022-12-14 09:45:24,743 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 54 treesize of output 36 [2022-12-14 09:45:24,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:24,766 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 1 case distinctions, treesize of input 45 treesize of output 46 [2022-12-14 09:45:24,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:24,778 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 09:45:24,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:24,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-12-14 09:45:24,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:24,791 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 09:45:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 09:45:24,867 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:24,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759873597] [2022-12-14 09:45:24,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759873597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:24,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1559088535] [2022-12-14 09:45:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:24,867 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:45:24,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:45:24,868 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:45:24,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-12-14 09:45:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:25,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 09:45:25,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:25,075 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:45:25,075 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 09:45:25,080 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 10 treesize of output 8 [2022-12-14 09:45:25,087 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 09:45:25,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:25,143 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:25,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:25,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:25,198 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 31 treesize of output 13 [2022-12-14 09:45:25,202 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 19 treesize of output 7 [2022-12-14 09:45:25,206 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 09:45:25,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:25,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_351) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_350) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_351) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2022-12-14 09:45:25,334 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) c_create_data_~data~0.base) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_350) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2022-12-14 09:45:25,380 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) c_create_data_~data~0.base) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_350) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-12-14 09:45:25,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:25,396 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 45 treesize of output 36 [2022-12-14 09:45:25,398 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 54 treesize of output 36 [2022-12-14 09:45:25,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:25,416 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 1 case distinctions, treesize of input 45 treesize of output 46 [2022-12-14 09:45:25,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:25,427 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 09:45:25,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:25,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-12-14 09:45:25,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:25,440 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 09:45:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 09:45:25,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1559088535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:25,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944216281] [2022-12-14 09:45:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:45:25,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:45:25,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:45:25,447 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:45:25,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 09:45:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:45:25,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 09:45:25,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:25,532 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 10 treesize of output 8 [2022-12-14 09:45:25,536 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 9 treesize of output 11 [2022-12-14 09:45:25,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:25,555 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 09:45:25,620 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:25,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:25,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:25,673 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 31 treesize of output 13 [2022-12-14 09:45:25,677 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 19 treesize of output 7 [2022-12-14 09:45:25,682 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 09:45:25,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:25,790 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_396) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_395) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_396) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse0 .cse2) (bvadd (_ bv8 32) .cse0 .cse2)))))) is different from false [2022-12-14 09:45:25,826 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_396) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_396) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_395) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:45:25,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_396) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_396) c_create_data_~data~0.base) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2))))))) is different from false [2022-12-14 09:45:25,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:25,892 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 45 treesize of output 36 [2022-12-14 09:45:25,894 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 54 treesize of output 36 [2022-12-14 09:45:25,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:25,916 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 1 case distinctions, treesize of input 45 treesize of output 46 [2022-12-14 09:45:25,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:25,928 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 09:45:25,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:25,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-12-14 09:45:25,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:25,942 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 09:45:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 09:45:25,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944216281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:25,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 09:45:25,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 8, 7, 8] total 20 [2022-12-14 09:45:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493398456] [2022-12-14 09:45:25,949 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 09:45:25,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 09:45:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:25,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 09:45:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=108, Unknown=9, NotChecked=252, Total=420 [2022-12-14 09:45:25,950 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:45:28,483 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2022-12-14 09:45:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 09:45:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 09:45:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:45:28,485 INFO L225 Difference]: With dead ends: 209 [2022-12-14 09:45:28,486 INFO L226 Difference]: Without dead ends: 209 [2022-12-14 09:45:28,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=165, Unknown=9, NotChecked=306, Total=552 [2022-12-14 09:45:28,486 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 09:45:28,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1453 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 532 Invalid, 1 Unknown, 726 Unchecked, 1.9s Time] [2022-12-14 09:45:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-12-14 09:45:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-12-14 09:45:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:45:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2022-12-14 09:45:28,491 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 22 [2022-12-14 09:45:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:45:28,492 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2022-12-14 09:45:28,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:45:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2022-12-14 09:45:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 09:45:28,492 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:45:28,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:45:28,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 09:45:28,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-12-14 09:45:28,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-12-14 09:45:29,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:29,095 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:45:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:45:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-12-14 09:45:29,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:45:29,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551211687] [2022-12-14 09:45:29,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:45:29,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:45:29,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:45:29,101 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:45:29,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-14 09:45:29,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:45:29,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:45:29,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 09:45:29,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:29,303 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:45:29,303 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 09:45:29,309 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 10 treesize of output 8 [2022-12-14 09:45:29,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:29,331 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 09:45:29,449 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:29,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:29,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:29,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:29,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:29,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:29,645 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 31 treesize of output 13 [2022-12-14 09:45:29,649 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 19 treesize of output 7 [2022-12-14 09:45:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:45:29,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:29,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_458) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_459) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_458) c_create_data_~data~0.base) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-12-14 09:45:29,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_459) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:45:30,035 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_459) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:45:30,198 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_456))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_457) .cse0 v_ArrVal_458) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_459) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_457) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_456) c_create_data_~data~0.base) .cse1) v_ArrVal_458) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-12-14 09:45:30,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_456))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_457) .cse1 v_ArrVal_458) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_459) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_457) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_456) c_create_data_~data~0.base) .cse2) v_ArrVal_458) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-12-14 09:45:30,583 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_457) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_456) c_create_data_~data~0.base) .cse2) v_ArrVal_458) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_456))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_457) .cse3 v_ArrVal_458) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_459) c_create_data_~data~0.base) .cse2))))))))) is different from false [2022-12-14 09:45:30,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:30,603 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 89 treesize of output 80 [2022-12-14 09:45:30,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:30,613 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 69 treesize of output 60 [2022-12-14 09:45:30,619 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 102 treesize of output 84 [2022-12-14 09:45:30,622 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 174 treesize of output 144 [2022-12-14 09:45:30,632 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 09:45:30,635 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 124 treesize of output 100 [2022-12-14 09:45:30,645 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 70 treesize of output 62 [2022-12-14 09:45:30,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:30,698 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 1 case distinctions, treesize of input 89 treesize of output 90 [2022-12-14 09:45:30,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:30,712 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 1 case distinctions, treesize of input 79 treesize of output 60 [2022-12-14 09:45:30,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:30,720 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 92 treesize of output 56 [2022-12-14 09:45:30,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:30,728 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 50 treesize of output 32 [2022-12-14 09:45:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-12-14 09:45:30,822 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:45:30,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551211687] [2022-12-14 09:45:30,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551211687] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:30,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [668363496] [2022-12-14 09:45:30,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:45:30,823 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:45:30,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:45:30,823 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:45:30,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-12-14 09:45:31,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:45:31,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:45:31,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 09:45:31,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:31,117 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:45:31,117 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 09:45:31,124 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 10 treesize of output 8 [2022-12-14 09:45:31,135 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 09:45:31,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:31,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:31,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:31,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:31,310 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:31,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:31,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:31,377 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 31 treesize of output 13 [2022-12-14 09:45:31,382 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 19 treesize of output 7 [2022-12-14 09:45:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:45:31,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:31,498 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_521) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_521) c_create_data_~data~0.base) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_520) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-12-14 09:45:31,532 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_521) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_521) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_520) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:45:31,579 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_521) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_521) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_520) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:45:31,693 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_518))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_519) .cse0 v_ArrVal_521) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_520) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_519) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_518) c_create_data_~data~0.base) .cse1) v_ArrVal_521) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-12-14 09:45:31,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_519) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_518) c_create_data_~data~0.base) .cse3) v_ArrVal_521) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_518))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_519) .cse4 v_ArrVal_521) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_520) c_create_data_~data~0.base) .cse3))))))))) is different from false [2022-12-14 09:45:31,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_519) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_518) c_create_data_~data~0.base) .cse2) v_ArrVal_521) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_518))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_519) .cse3 v_ArrVal_521) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_520) c_create_data_~data~0.base) .cse2))))))))) is different from false [2022-12-14 09:45:31,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:31,927 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 89 treesize of output 90 [2022-12-14 09:45:31,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:31,937 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 79 treesize of output 60 [2022-12-14 09:45:31,942 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 400 treesize of output 334 [2022-12-14 09:45:31,949 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 1112 treesize of output 1034 [2022-12-14 09:45:31,961 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 1030 treesize of output 950 [2022-12-14 09:45:31,972 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 950 treesize of output 870 [2022-12-14 09:45:31,979 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 870 treesize of output 838 [2022-12-14 09:45:31,986 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 838 treesize of output 686 [2022-12-14 09:45:53,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:53,151 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 89 treesize of output 80 [2022-12-14 09:45:53,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:53,163 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 69 treesize of output 60 [2022-12-14 09:45:53,172 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 102 treesize of output 84 [2022-12-14 09:45:53,180 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 286 treesize of output 244 [2022-12-14 09:45:53,195 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 202 treesize of output 186 [2022-12-14 09:45:53,208 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 186 treesize of output 162 [2022-12-14 09:45:53,214 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 200 treesize of output 160 [2022-12-14 09:45:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-12-14 09:45:54,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [668363496] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274523457] [2022-12-14 09:45:54,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 09:45:54,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:45:54,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:45:54,864 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:45:54,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 09:45:54,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 09:45:54,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:45:54,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 09:45:54,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:45:54,990 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 10 treesize of output 8 [2022-12-14 09:45:54,998 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 9 treesize of output 11 [2022-12-14 09:45:55,008 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 09:45:55,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:45:55,134 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:55,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:55,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:55,265 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:45:55,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:45:55,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:45:55,353 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 31 treesize of output 13 [2022-12-14 09:45:55,360 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 19 treesize of output 7 [2022-12-14 09:45:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:45:55,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:45:55,499 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_584) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_584) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_583) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-12-14 09:45:55,543 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_583) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:45:55,601 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_583) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:45:56,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_582))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_581) .cse1 v_ArrVal_584) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_583) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_582) c_create_data_~data~0.base) .cse2) v_ArrVal_584) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-12-14 09:45:56,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_582) c_create_data_~data~0.base) .cse2) v_ArrVal_584) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_582))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_581) .cse3 v_ArrVal_584) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_583) c_create_data_~data~0.base) .cse2))))))))) is different from false [2022-12-14 09:45:56,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:56,674 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 89 treesize of output 80 [2022-12-14 09:45:56,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:56,687 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 69 treesize of output 60 [2022-12-14 09:45:56,694 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 102 treesize of output 84 [2022-12-14 09:45:56,699 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 286 treesize of output 244 [2022-12-14 09:45:56,716 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 202 treesize of output 186 [2022-12-14 09:45:56,721 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 224 treesize of output 184 [2022-12-14 09:45:56,732 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 154 treesize of output 130 [2022-12-14 09:45:56,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:56,765 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 1 case distinctions, treesize of input 89 treesize of output 90 [2022-12-14 09:45:56,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:45:56,782 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 1 case distinctions, treesize of input 79 treesize of output 60 [2022-12-14 09:45:56,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:56,791 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 92 treesize of output 56 [2022-12-14 09:45:56,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:45:56,799 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 50 treesize of output 32 [2022-12-14 09:45:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-12-14 09:45:56,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274523457] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:45:56,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 09:45:56,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9, 11, 9, 11] total 31 [2022-12-14 09:45:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960597714] [2022-12-14 09:45:56,810 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 09:45:56,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 09:45:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:45:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 09:45:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=174, Unknown=22, NotChecked=714, Total=992 [2022-12-14 09:45:56,812 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:46:07,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:46:09,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:46:11,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:46:13,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:46:15,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:46:17,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:46:19,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:46:21,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:46:21,615 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse3)) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse5 (bvadd (_ bv8 32) .cse4 .cse1)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (= (select |c_#length| |c_create_data_#t~mem9.base|) (_ bv80 32)) (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_583) c_create_data_~data~0.base) .cse3)))) (= |c_create_data_#t~mem9.offset| (_ bv0 32)) (= c_create_data_~counter~0 (_ bv2 32)) (bvule (bvadd (_ bv4 32) .cse4 .cse1) .cse5) (bvule .cse5 (select |c_#length| .cse2)))))) is different from false [2022-12-14 09:46:21,672 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse3)) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse5 (bvadd (_ bv8 32) .cse4 .cse1)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_583) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd (_ bv4 32) .cse4 .cse1) .cse5) (bvule .cse5 (select |c_#length| .cse2)))))) is different from false [2022-12-14 09:46:21,725 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse3)) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3)) (.cse4 (bvadd (_ bv4 32) .cse5 .cse1))) (and (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_583) c_create_data_~data~0.base) .cse3)))) (bvule .cse4 (select |c_#length| .cse2)) (bvule (bvadd .cse5 .cse1) .cse4))))) is different from false [2022-12-14 09:46:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:46:35,997 INFO L93 Difference]: Finished difference Result 277 states and 309 transitions. [2022-12-14 09:46:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 09:46:36,000 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 09:46:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:46:36,002 INFO L225 Difference]: With dead ends: 277 [2022-12-14 09:46:36,002 INFO L226 Difference]: Without dead ends: 277 [2022-12-14 09:46:36,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=139, Invalid=366, Unknown=37, NotChecked=1180, Total=1722 [2022-12-14 09:46:36,005 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 28 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 1835 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:46:36,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2380 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 837 Invalid, 11 Unknown, 1835 Unchecked, 28.2s Time] [2022-12-14 09:46:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-14 09:46:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 237. [2022-12-14 09:46:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.4120879120879122) internal successors, (257), 232 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:46:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 261 transitions. [2022-12-14 09:46:36,015 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 261 transitions. Word has length 27 [2022-12-14 09:46:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:46:36,015 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 261 transitions. [2022-12-14 09:46:36,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:46:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 261 transitions. [2022-12-14 09:46:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 09:46:36,017 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:46:36,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 09:46:36,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 09:46:36,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2022-12-14 09:46:36,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-12-14 09:46:36,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:36,619 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:46:36,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:46:36,620 INFO L85 PathProgramCache]: Analyzing trace with hash 543118897, now seen corresponding path program 1 times [2022-12-14 09:46:36,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:46:36,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312817701] [2022-12-14 09:46:36,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:36,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:36,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:46:36,624 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:46:36,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-14 09:46:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:36,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:46:36,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:37,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:46:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:37,723 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:46:37,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312817701] [2022-12-14 09:46:37,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312817701] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:46:37,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [583699401] [2022-12-14 09:46:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:37,723 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:46:37,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:46:37,725 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:46:37,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-12-14 09:46:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:37,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:46:37,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:38,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:46:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:38,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [583699401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:46:38,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989090778] [2022-12-14 09:46:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:38,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:46:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:46:38,406 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:46:38,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 09:46:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:38,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:46:38,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:38,554 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 7 [2022-12-14 09:46:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 09:46:38,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:46:38,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989090778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:46:38,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-12-14 09:46:38,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 6, 6] total 11 [2022-12-14 09:46:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359457387] [2022-12-14 09:46:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:46:38,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:46:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:46:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:46:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 09:46:38,678 INFO L87 Difference]: Start difference. First operand 237 states and 261 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:46:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:46:39,367 INFO L93 Difference]: Finished difference Result 241 states and 263 transitions. [2022-12-14 09:46:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:46:39,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-12-14 09:46:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:46:39,371 INFO L225 Difference]: With dead ends: 241 [2022-12-14 09:46:39,371 INFO L226 Difference]: Without dead ends: 241 [2022-12-14 09:46:39,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 09:46:39,372 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 09:46:39,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 230 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 09:46:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-12-14 09:46:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2022-12-14 09:46:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 182 states have (on average 1.39010989010989) internal successors, (253), 230 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:46:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 257 transitions. [2022-12-14 09:46:39,376 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 257 transitions. Word has length 39 [2022-12-14 09:46:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:46:39,376 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 257 transitions. [2022-12-14 09:46:39,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:46:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 257 transitions. [2022-12-14 09:46:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 09:46:39,377 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:46:39,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 09:46:39,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2022-12-14 09:46:39,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-12-14 09:46:39,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 09:46:39,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:46:39,978 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:46:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:46:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash 543118898, now seen corresponding path program 1 times [2022-12-14 09:46:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:46:39,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055980831] [2022-12-14 09:46:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:39,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:39,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:46:39,980 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:46:39,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-12-14 09:46:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:40,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:46:40,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:40,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:46:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:41,162 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:46:41,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055980831] [2022-12-14 09:46:41,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055980831] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:46:41,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [592030331] [2022-12-14 09:46:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:41,163 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:46:41,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:46:41,165 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:46:41,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-12-14 09:46:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:41,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:46:41,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:41,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:46:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:41,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [592030331] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:46:41,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248539536] [2022-12-14 09:46:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:41,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:46:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:46:41,966 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:46:41,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 09:46:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:42,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:46:42,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:42,141 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 09:46:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 09:46:42,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:46:42,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248539536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:46:42,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-12-14 09:46:42,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 6, 6] total 11 [2022-12-14 09:46:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699381605] [2022-12-14 09:46:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:46:42,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:46:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:46:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:46:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 09:46:42,300 INFO L87 Difference]: Start difference. First operand 235 states and 257 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:46:43,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:46:43,273 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2022-12-14 09:46:43,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:46:43,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-12-14 09:46:43,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:46:43,275 INFO L225 Difference]: With dead ends: 239 [2022-12-14 09:46:43,275 INFO L226 Difference]: Without dead ends: 239 [2022-12-14 09:46:43,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 09:46:43,276 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:46:43,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 231 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 09:46:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-12-14 09:46:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2022-12-14 09:46:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 228 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:46:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2022-12-14 09:46:43,280 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 39 [2022-12-14 09:46:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:46:43,280 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2022-12-14 09:46:43,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:46:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2022-12-14 09:46:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 09:46:43,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:46:43,281 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:46:43,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 09:46:43,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-12-14 09:46:43,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-12-14 09:46:43,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 09:46:43,882 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-12-14 09:46:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:46:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1380990834, now seen corresponding path program 3 times [2022-12-14 09:46:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:46:43,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483926860] [2022-12-14 09:46:43,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:46:43,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:43,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:46:43,888 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:46:43,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d0c9ee5-d91f-40a3-9ce9-124ac8b20fa9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-12-14 09:46:44,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 09:46:44,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:46:44,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 09:46:44,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:44,821 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 10 treesize of output 8 [2022-12-14 09:46:44,862 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 9 treesize of output 11 [2022-12-14 09:46:44,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:46:45,026 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 09:46:45,730 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:46:45,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:46:45,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:46:46,478 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:46:46,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:46:46,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:46:47,211 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:46:47,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:46:47,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:46:48,076 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:46:48,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:46:48,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:46:48,980 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:46:48,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 09:46:49,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 09:46:49,482 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 31 treesize of output 13 [2022-12-14 09:46:49,498 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 19 treesize of output 7 [2022-12-14 09:46:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:49,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:46:50,585 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1197) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1198) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1197) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-12-14 09:46:50,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1197) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1197) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1198) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:46:50,791 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1197) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1197) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1198) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-12-14 09:46:51,181 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1196))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1195) .cse0 v_ArrVal_1197) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1198) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1195) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1196) c_create_data_~data~0.base) .cse1) v_ArrVal_1197) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-12-14 09:46:51,443 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1195) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1196) c_create_data_~data~0.base) .cse3) v_ArrVal_1197) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1196))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1195) .cse4 v_ArrVal_1197) c_create_data_~data~0.base) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1198) c_create_data_~data~0.base) .cse3))))))))) is different from false [2022-12-14 09:46:51,600 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1196))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1195) .cse2 v_ArrVal_1197) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1198) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1195) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1196) c_create_data_~data~0.base) .cse3) v_ArrVal_1197) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 .cse5 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse5))))))) is different from false [2022-12-14 09:46:52,771 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1193))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1194) .cse2 v_ArrVal_1195) (select (select (store .cse3 .cse2 v_ArrVal_1196) c_create_data_~data~0.base) .cse4) v_ArrVal_1197))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1193))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1196))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1194) .cse5 v_ArrVal_1195) .cse6 v_ArrVal_1197) c_create_data_~data~0.base) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1198) c_create_data_~data~0.base) .cse4)))))))))) is different from false [2022-12-14 09:46:54,909 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1193))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1194) .cse3 v_ArrVal_1195) (select (select (store .cse4 .cse3 v_ArrVal_1196) c_create_data_~data~0.base) .cse5) v_ArrVal_1197))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1193))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1196))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1194) .cse6 v_ArrVal_1195) .cse7 v_ArrVal_1197) c_create_data_~data~0.base) .cse5) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1198) c_create_data_~data~0.base) .cse5))))))))))) is different from false [2022-12-14 09:46:55,251 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1193))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1196))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1194) .cse1 v_ArrVal_1195) .cse2 v_ArrVal_1197) c_create_data_~data~0.base) .cse3) (_ bv20 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1198) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1193))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1194) .cse8 v_ArrVal_1195) (select (select (store .cse9 .cse8 v_ArrVal_1196) c_create_data_~data~0.base) .cse3) v_ArrVal_1197))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse7 .cse4) (bvadd .cse7 (_ bv20 32) .cse4))))))) is different from false [2022-12-14 09:46:57,522 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1192))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1193))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1191) .cse2 v_ArrVal_1194) .cse3 v_ArrVal_1195) (select (select (store .cse4 .cse3 v_ArrVal_1196) c_create_data_~data~0.base) .cse5) v_ArrVal_1197))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1192))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_1193))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1196))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1191) .cse7 v_ArrVal_1194) .cse8 v_ArrVal_1195) .cse9 v_ArrVal_1197) c_create_data_~data~0.base) .cse5) (_ bv20 32) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_1198) c_create_data_~data~0.base) .cse5)))))))))))) is different from false [2022-12-14 09:46:59,698 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1192))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1193))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1191) .cse3 v_ArrVal_1194) .cse4 v_ArrVal_1195) (select (select (store .cse5 .cse4 v_ArrVal_1196) c_create_data_~data~0.base) .cse6) v_ArrVal_1197))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd (_ bv20 32) .cse0 .cse1)))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1192))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1193))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1196))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv20 32) .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1191) .cse8 v_ArrVal_1194) .cse9 v_ArrVal_1195) .cse10 v_ArrVal_1197) c_create_data_~data~0.base) .cse6)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1198) c_create_data_~data~0.base) .cse6))))))))))))) is different from false [2022-12-14 09:47:00,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1192))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1193))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1191) .cse3 v_ArrVal_1194) .cse4 v_ArrVal_1195) (select (select (store .cse5 .cse4 v_ArrVal_1196) c_create_data_~data~0.base) .cse6) v_ArrVal_1197))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv20 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv24 32))))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1192))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1193))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1196))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (bvule (bvadd .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1191) .cse8 v_ArrVal_1194) .cse9 v_ArrVal_1195) .cse10 v_ArrVal_1197) c_create_data_~data~0.base) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1198) c_create_data_~data~0.base) .cse6))))))))))))) is different from false [2022-12-14 09:47:02,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1189))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1192))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1193))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1190) .cse2 v_ArrVal_1191) .cse3 v_ArrVal_1194) .cse4 v_ArrVal_1195) (select (select (store .cse5 .cse4 v_ArrVal_1196) c_create_data_~data~0.base) .cse6) v_ArrVal_1197))))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd .cse0 (_ bv20 32) .cse1) (bvadd .cse0 .cse1 (_ bv24 32))))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_1189))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_1192))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_1193))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_1196))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_1190) .cse9 v_ArrVal_1191) .cse10 v_ArrVal_1194) .cse11 v_ArrVal_1195) .cse12 v_ArrVal_1197) c_create_data_~data~0.base) .cse6) .cse1 (_ bv24 32)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_1198) c_create_data_~data~0.base) .cse6)))))))))))))) is different from false [2022-12-14 09:47:05,671 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1189))) (let ((.cse1 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (let ((.cse9 (store .cse10 .cse1 v_ArrVal_1192))) (let ((.cse2 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse2 v_ArrVal_1193))) (let ((.cse3 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse3 v_ArrVal_1196))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1190) .cse1 v_ArrVal_1191) .cse2 v_ArrVal_1194) .cse3 v_ArrVal_1195) .cse4 v_ArrVal_1197) c_create_data_~data~0.base) .cse5) .cse6 (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse4 v_ArrVal_1198) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1189))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_1192))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_1193))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1190) .cse12 v_ArrVal_1191) .cse13 v_ArrVal_1194) .cse14 v_ArrVal_1195) (select (select (store .cse15 .cse14 v_ArrVal_1196) c_create_data_~data~0.base) .cse5) v_ArrVal_1197))))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse11 (_ bv20 32) .cse6) (bvadd .cse11 .cse6 (_ bv24 32)))))))) is different from false [2022-12-14 09:47:06,653 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1189))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1192))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1193))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1190) .cse2 v_ArrVal_1191) .cse3 v_ArrVal_1194) .cse4 v_ArrVal_1195) (select (select (store .cse5 .cse4 v_ArrVal_1196) c_create_data_~data~0.base) .cse6) v_ArrVal_1197))))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_1195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1189))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_1192))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_1193))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_1196))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1190) .cse9 v_ArrVal_1191) .cse10 v_ArrVal_1194) .cse11 v_ArrVal_1195) .cse12 v_ArrVal_1197) c_create_data_~data~0.base) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_1198) c_create_data_~data~0.base) .cse6))))))))))))))) is different from false [2022-12-14 09:47:06,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:47:06,783 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 705 treesize of output 706 [2022-12-14 09:47:06,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:47:06,856 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 695 treesize of output 396 [2022-12-14 09:47:08,001 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 360941526286 treesize of output 321050843500