./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 cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:52:57,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:52:57,798 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:52:57,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:52:57,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:52:57,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:52:57,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:52:57,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:52:57,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:52:57,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:52:57,867 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:52:57,868 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:52:57,869 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:52:57,870 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:52:57,871 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:52:57,871 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:52:57,872 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:52:57,874 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:52:57,874 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:52:57,875 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:52:57,875 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:52:57,876 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:52:57,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:52:57,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:52:57,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:52:57,879 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:52:57,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:52:57,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:52:57,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:52:57,880 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:52:57,882 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:52:57,882 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:52:57,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:52:57,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:52:57,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:52:57,883 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:52:57,883 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:52:57,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:52:57,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:52:57,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:52:57,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:52:57,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:52:57,885 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:52:57,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:52:57,886 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:52:57,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:52:57,887 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-11-12 00:52:58,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:52:58,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:52:58,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:52:58,290 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:52:58,292 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:52:58,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-12 00:53:01,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:53:01,782 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:53:01,783 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-12 00:53:01,800 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/data/0fa980483/b3d976e5cd9f46e887b0483ad791c9b8/FLAG80c8b2750 [2023-11-12 00:53:01,816 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/data/0fa980483/b3d976e5cd9f46e887b0483ad791c9b8 [2023-11-12 00:53:01,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:53:01,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:53:01,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:01,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:53:01,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:53:01,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:01" (1/1) ... [2023-11-12 00:53:01,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221174df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:01, skipping insertion in model container [2023-11-12 00:53:01,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:01" (1/1) ... [2023-11-12 00:53:01,940 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:53:02,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:02,355 ERROR L324 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) [2023-11-12 00:53:02,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c908fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:02, skipping insertion in model container [2023-11-12 00:53:02,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:02,357 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-12 00:53:02,360 INFO L158 Benchmark]: Toolchain (without parser) took 537.65ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 122.9MB in the end (delta: -6.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:53:02,360 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 102.8MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:53:02,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.71ms. Allocated memory is still 161.5MB. Free memory was 115.5MB in the beginning and 122.9MB in the end (delta: -7.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:53:02,363 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 102.8MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.71ms. Allocated memory is still 161.5MB. Free memory was 115.5MB in the beginning and 122.9MB in the end (delta: -7.4MB). Peak memory consumption was 2.1MB. 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:53:05,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:53:05,142 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-12 00:53:05,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:53:05,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:53:05,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:53:05,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:53:05,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:53:05,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:53:05,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:53:05,232 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:53:05,232 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:53:05,233 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:53:05,235 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:53:05,235 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:53:05,236 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:53:05,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:53:05,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:53:05,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:53:05,239 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:53:05,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:53:05,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:53:05,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:53:05,241 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:53:05,242 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:53:05,242 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:53:05,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:53:05,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:53:05,244 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 00:53:05,244 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 00:53:05,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:53:05,246 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:53:05,247 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:53:05,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:53:05,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 00:53:05,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:53:05,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:53:05,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:53:05,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:53:05,249 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-12 00:53:05,250 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 00:53:05,250 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:53:05,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:53:05,250 INFO L153 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_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-11-12 00:53:05,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:53:05,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:53:05,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:53:05,730 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:53:05,731 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:53:05,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-12 00:53:09,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:53:09,362 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:53:09,366 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-12 00:53:09,392 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/data/203860f6d/0697e0763eff4d05a24c6a33fd1a8d61/FLAG2a1a532db [2023-11-12 00:53:09,412 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/data/203860f6d/0697e0763eff4d05a24c6a33fd1a8d61 [2023-11-12 00:53:09,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:53:09,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:53:09,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:09,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:53:09,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:53:09,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:09" (1/1) ... [2023-11-12 00:53:09,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c67b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:09, skipping insertion in model container [2023-11-12 00:53:09,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:09" (1/1) ... [2023-11-12 00:53:09,493 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:53:09,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:09,960 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-12 00:53:09,969 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:53:10,039 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:10,060 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:53:10,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:10,175 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:53:10,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10 WrapperNode [2023-11-12 00:53:10,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:10,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:53:10,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:53:10,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:53:10,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,266 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-11-12 00:53:10,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:53:10,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:53:10,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:53:10,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:53:10,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:53:10,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:53:10,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:53:10,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:53:10,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (1/1) ... [2023-11-12 00:53:10,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:53:10,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:10,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:53:10,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:53:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-12 00:53:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:53:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-11-12 00:53:10,467 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-11-12 00:53:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:53:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:53:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:53:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:53:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:53:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 00:53:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:53:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 00:53:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:53:10,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:53:10,602 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:53:10,605 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:53:11,660 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:53:11,668 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:53:11,669 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:53:11,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:11 BoogieIcfgContainer [2023-11-12 00:53:11,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:53:11,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:53:11,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:53:11,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:53:11,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:53:09" (1/3) ... [2023-11-12 00:53:11,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b239f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:11, skipping insertion in model container [2023-11-12 00:53:11,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:10" (2/3) ... [2023-11-12 00:53:11,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b239f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:11, skipping insertion in model container [2023-11-12 00:53:11,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:11" (3/3) ... [2023-11-12 00:53:11,681 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2023-11-12 00:53:11,701 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:53:11,702 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-11-12 00:53:11,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:53:11,777 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;@3670affb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:53:11,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-11-12 00:53:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 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) [2023-11-12 00:53:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:53:11,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:11,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:53:11,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:11,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash 4960777, now seen corresponding path program 1 times [2023-11-12 00:53:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103789999] [2023-11-12 00:53:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:11,817 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 [2023-11-12 00:53:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:11,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:11,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:11,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 00:53:11,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:11,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:11,977 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103789999] [2023-11-12 00:53:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103789999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:11,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:11,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497296060] [2023-11-12 00:53:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:53:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:12,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:53:12,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:53:12,036 INFO L87 Difference]: Start difference. First operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-12 00:53:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:12,091 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2023-11-12 00:53:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:53:12,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2023-11-12 00:53:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:12,101 INFO L225 Difference]: With dead ends: 195 [2023-11-12 00:53:12,102 INFO L226 Difference]: Without dead ends: 193 [2023-11-12 00:53:12,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:53:12,108 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:12,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:53:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-12 00:53:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-11-12 00:53:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 98 states have (on average 2.0510204081632653) internal successors, (201), 189 states have internal predecessors, (201), 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) [2023-11-12 00:53:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2023-11-12 00:53:12,166 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 4 [2023-11-12 00:53:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:12,167 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2023-11-12 00:53:12,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-12 00:53:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2023-11-12 00:53:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:53:12,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:12,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:53:12,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:12,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:12,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:12,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 4958341, now seen corresponding path program 1 times [2023-11-12 00:53:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688293292] [2023-11-12 00:53:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:12,383 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 [2023-11-12 00:53:12,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:12,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:12,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:12,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:53:12,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:12,518 INFO L351 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 [2023-11-12 00:53:12,596 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:53:12,597 INFO L351 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 [2023-11-12 00:53:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:12,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:12,629 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:12,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688293292] [2023-11-12 00:53:12,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688293292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:12,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:12,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:53:12,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725742978] [2023-11-12 00:53:12,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:12,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:53:12,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:12,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:53:12,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:53:12,638 INFO L87 Difference]: Start difference. First operand 193 states and 205 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) [2023-11-12 00:53:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:13,531 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2023-11-12 00:53:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:53:13,534 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 [2023-11-12 00:53:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:13,536 INFO L225 Difference]: With dead ends: 187 [2023-11-12 00:53:13,537 INFO L226 Difference]: Without dead ends: 187 [2023-11-12 00:53:13,537 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 [2023-11-12 00:53:13,538 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 83 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:13,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 317 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 00:53:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-12 00:53:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-11-12 00:53:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 98 states have (on average 1.989795918367347) internal successors, (195), 183 states have internal predecessors, (195), 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) [2023-11-12 00:53:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2023-11-12 00:53:13,573 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 4 [2023-11-12 00:53:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:13,574 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2023-11-12 00:53:13,575 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) [2023-11-12 00:53:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2023-11-12 00:53:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:53:13,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:13,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:53:13,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:13,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:13,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:13,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash 4958342, now seen corresponding path program 1 times [2023-11-12 00:53:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346914314] [2023-11-12 00:53:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:13,789 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 [2023-11-12 00:53:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:13,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:13,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:13,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 00:53:13,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:13,927 INFO L351 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 [2023-11-12 00:53:13,935 INFO L351 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 [2023-11-12 00:53:14,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:14,028 INFO L351 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 14 treesize of output 9 [2023-11-12 00:53:14,050 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:53:14,050 INFO L351 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 [2023-11-12 00:53:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:14,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:14,072 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346914314] [2023-11-12 00:53:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346914314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:14,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:53:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450483266] [2023-11-12 00:53:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:14,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:53:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:14,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:53:14,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:53:14,079 INFO L87 Difference]: Start difference. First operand 187 states and 199 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) [2023-11-12 00:53:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:15,252 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2023-11-12 00:53:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:53:15,256 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 [2023-11-12 00:53:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:15,260 INFO L225 Difference]: With dead ends: 203 [2023-11-12 00:53:15,260 INFO L226 Difference]: Without dead ends: 203 [2023-11-12 00:53:15,260 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 [2023-11-12 00:53:15,262 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:15,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 361 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-12 00:53:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-12 00:53:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2023-11-12 00:53:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 103 states have (on average 1.9611650485436893) internal successors, (202), 188 states have internal predecessors, (202), 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) [2023-11-12 00:53:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2023-11-12 00:53:15,296 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 4 [2023-11-12 00:53:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:15,297 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2023-11-12 00:53:15,305 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) [2023-11-12 00:53:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2023-11-12 00:53:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:53:15,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:15,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:53:15,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:15,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:15,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:15,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash 153708682, now seen corresponding path program 1 times [2023-11-12 00:53:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744443079] [2023-11-12 00:53:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:15,509 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 [2023-11-12 00:53:15,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:15,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:15,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:15,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 00:53:15,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:15,628 INFO L351 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 [2023-11-12 00:53:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:15,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:15,645 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744443079] [2023-11-12 00:53:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744443079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567590017] [2023-11-12 00:53:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:15,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:15,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:15,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:15,648 INFO L87 Difference]: Start difference. First operand 192 states and 206 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) [2023-11-12 00:53:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:16,091 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2023-11-12 00:53:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:16,092 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 [2023-11-12 00:53:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:16,093 INFO L225 Difference]: With dead ends: 190 [2023-11-12 00:53:16,093 INFO L226 Difference]: Without dead ends: 190 [2023-11-12 00:53:16,094 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 [2023-11-12 00:53:16,095 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:16,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 279 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:53:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-12 00:53:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2023-11-12 00:53:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 103 states have (on average 1.9320388349514563) internal successors, (199), 186 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) [2023-11-12 00:53:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2023-11-12 00:53:16,110 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 5 [2023-11-12 00:53:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:16,111 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2023-11-12 00:53:16,111 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) [2023-11-12 00:53:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2023-11-12 00:53:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:53:16,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:16,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:53:16,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:16,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:16,326 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:16,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:16,326 INFO L85 PathProgramCache]: Analyzing trace with hash 153708683, now seen corresponding path program 1 times [2023-11-12 00:53:16,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:16,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250737678] [2023-11-12 00:53:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:16,327 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 [2023-11-12 00:53:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:16,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:16,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:16,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:53:16,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:16,427 INFO L351 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 [2023-11-12 00:53:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:16,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:16,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250737678] [2023-11-12 00:53:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250737678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:16,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109105777] [2023-11-12 00:53:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:16,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:16,455 INFO L87 Difference]: Start difference. First operand 190 states and 203 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) [2023-11-12 00:53:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:17,035 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2023-11-12 00:53:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:17,037 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 [2023-11-12 00:53:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:17,039 INFO L225 Difference]: With dead ends: 188 [2023-11-12 00:53:17,039 INFO L226 Difference]: Without dead ends: 188 [2023-11-12 00:53:17,039 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 [2023-11-12 00:53:17,040 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:17,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:53:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-12 00:53:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2023-11-12 00:53:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.9029126213592233) internal successors, (196), 184 states have internal predecessors, (196), 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) [2023-11-12 00:53:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2023-11-12 00:53:17,053 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 5 [2023-11-12 00:53:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:17,053 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2023-11-12 00:53:17,054 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) [2023-11-12 00:53:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2023-11-12 00:53:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:53:17,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:17,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:17,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:17,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:17,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:17,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1301215081, now seen corresponding path program 1 times [2023-11-12 00:53:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:17,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889688511] [2023-11-12 00:53:17,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:17,270 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 [2023-11-12 00:53:17,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:17,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:17,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:17,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 00:53:17,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:17,462 INFO L351 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 [2023-11-12 00:53:17,542 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:53:17,542 INFO L351 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 [2023-11-12 00:53:17,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:53:17,630 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:53:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:17,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:17,697 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:17,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889688511] [2023-11-12 00:53:17,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889688511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:17,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:53:17,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315562381] [2023-11-12 00:53:17,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:17,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:53:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:53:17,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:53:17,700 INFO L87 Difference]: Start difference. First operand 188 states and 200 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) [2023-11-12 00:53:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:18,407 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2023-11-12 00:53:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:18,407 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 [2023-11-12 00:53:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:18,410 INFO L225 Difference]: With dead ends: 190 [2023-11-12 00:53:18,410 INFO L226 Difference]: Without dead ends: 190 [2023-11-12 00:53:18,411 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 [2023-11-12 00:53:18,411 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 6 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:18,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 628 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:53:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-12 00:53:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2023-11-12 00:53:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.8942307692307692) internal successors, (197), 185 states have internal predecessors, (197), 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) [2023-11-12 00:53:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2023-11-12 00:53:18,420 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 10 [2023-11-12 00:53:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:18,421 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2023-11-12 00:53:18,421 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) [2023-11-12 00:53:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2023-11-12 00:53:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:53:18,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:18,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:18,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:18,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:18,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:18,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash -635255016, now seen corresponding path program 1 times [2023-11-12 00:53:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:18,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950445628] [2023-11-12 00:53:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:18,632 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 [2023-11-12 00:53:18,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:18,634 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:18,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:18,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:53:18,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:18,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:18,740 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950445628] [2023-11-12 00:53:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950445628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468110684] [2023-11-12 00:53:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:53:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:53:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:53:18,742 INFO L87 Difference]: Start difference. First operand 189 states and 201 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) [2023-11-12 00:53:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:18,783 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2023-11-12 00:53:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:53:18,783 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 [2023-11-12 00:53:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:18,785 INFO L225 Difference]: With dead ends: 269 [2023-11-12 00:53:18,785 INFO L226 Difference]: Without dead ends: 269 [2023-11-12 00:53:18,786 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 [2023-11-12 00:53:18,787 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 84 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 569 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 [2023-11-12 00:53:18,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 569 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:53:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-12 00:53:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2023-11-12 00:53:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 147 states have (on average 1.91156462585034) internal successors, (281), 228 states have internal predecessors, (281), 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) [2023-11-12 00:53:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2023-11-12 00:53:18,814 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 12 [2023-11-12 00:53:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:18,816 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2023-11-12 00:53:18,817 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) [2023-11-12 00:53:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2023-11-12 00:53:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:53:18,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:18,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:18,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:19,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:19,029 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:19,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937173, now seen corresponding path program 1 times [2023-11-12 00:53:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76828041] [2023-11-12 00:53:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:19,031 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 [2023-11-12 00:53:19,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:19,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:19,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:19,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:53:19,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:19,170 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:53:19,170 INFO L351 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 [2023-11-12 00:53:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:19,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:19,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76828041] [2023-11-12 00:53:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76828041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:19,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:19,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092267195] [2023-11-12 00:53:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:19,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:19,196 INFO L87 Difference]: Start difference. First operand 233 states and 285 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) [2023-11-12 00:53:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:19,670 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2023-11-12 00:53:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:19,670 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 [2023-11-12 00:53:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:19,672 INFO L225 Difference]: With dead ends: 220 [2023-11-12 00:53:19,672 INFO L226 Difference]: Without dead ends: 220 [2023-11-12 00:53:19,673 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 [2023-11-12 00:53:19,673 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 64 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 208 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.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:19,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 208 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:53:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-12 00:53:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2023-11-12 00:53:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.7074829931972788) internal successors, (251), 213 states have internal predecessors, (251), 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) [2023-11-12 00:53:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 255 transitions. [2023-11-12 00:53:19,683 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 255 transitions. Word has length 13 [2023-11-12 00:53:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:19,684 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 255 transitions. [2023-11-12 00:53:19,684 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) [2023-11-12 00:53:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 255 transitions. [2023-11-12 00:53:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:53:19,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:19,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:19,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:19,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:19,896 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:19,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937174, now seen corresponding path program 1 times [2023-11-12 00:53:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946905210] [2023-11-12 00:53:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:19,897 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 [2023-11-12 00:53:19,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:19,898 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:19,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:20,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:53:20,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:20,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:20,022 INFO L351 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 11 treesize of output 5 [2023-11-12 00:53:20,031 INFO L351 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 [2023-11-12 00:53:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:20,043 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:20,044 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:20,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946905210] [2023-11-12 00:53:20,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946905210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:20,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:20,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:20,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761940061] [2023-11-12 00:53:20,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:20,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:20,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:20,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:20,046 INFO L87 Difference]: Start difference. First operand 218 states and 255 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) [2023-11-12 00:53:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:20,473 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2023-11-12 00:53:20,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:20,473 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 [2023-11-12 00:53:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:20,475 INFO L225 Difference]: With dead ends: 205 [2023-11-12 00:53:20,475 INFO L226 Difference]: Without dead ends: 205 [2023-11-12 00:53:20,475 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 [2023-11-12 00:53:20,476 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 210 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.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:20,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 210 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:53:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-12 00:53:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2023-11-12 00:53:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 198 states have internal predecessors, (221), 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) [2023-11-12 00:53:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2023-11-12 00:53:20,484 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 13 [2023-11-12 00:53:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:20,485 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2023-11-12 00:53:20,485 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) [2023-11-12 00:53:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2023-11-12 00:53:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:53:20,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:20,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:20,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:20,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:20,698 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:20,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961989, now seen corresponding path program 1 times [2023-11-12 00:53:20,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:20,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621845363] [2023-11-12 00:53:20,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:20,699 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 [2023-11-12 00:53:20,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:20,701 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:20,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:20,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:53:20,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:20,817 INFO L351 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 [2023-11-12 00:53:20,830 INFO L351 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 11 treesize of output 7 [2023-11-12 00:53:20,848 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:20,877 INFO L351 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 [2023-11-12 00:53:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:20,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:20,892 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:20,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621845363] [2023-11-12 00:53:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621845363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:20,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:20,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:20,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465918273] [2023-11-12 00:53:20,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:20,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:53:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:20,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:53:20,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:20,895 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-11-12 00:53:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:21,728 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2023-11-12 00:53:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:53:21,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 18 [2023-11-12 00:53:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:21,731 INFO L225 Difference]: With dead ends: 260 [2023-11-12 00:53:21,731 INFO L226 Difference]: Without dead ends: 260 [2023-11-12 00:53:21,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:53:21,732 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 29 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 419 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.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:21,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 419 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 00:53:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-12 00:53:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 211. [2023-11-12 00:53:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 206 states have internal predecessors, (233), 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) [2023-11-12 00:53:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2023-11-12 00:53:21,742 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 18 [2023-11-12 00:53:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:21,743 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2023-11-12 00:53:21,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-11-12 00:53:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2023-11-12 00:53:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:53:21,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:21,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:21,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:21,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:21,962 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:21,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961990, now seen corresponding path program 1 times [2023-11-12 00:53:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559461887] [2023-11-12 00:53:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:21,964 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 [2023-11-12 00:53:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:21,965 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:21,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:22,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-12 00:53:22,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:22,087 INFO L351 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 11 treesize of output 5 [2023-11-12 00:53:22,100 INFO L351 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 [2023-11-12 00:53:22,136 INFO L351 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 [2023-11-12 00:53:22,152 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:22,250 INFO L351 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 [2023-11-12 00:53:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:22,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:22,295 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:22,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559461887] [2023-11-12 00:53:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559461887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:22,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:22,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:53:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459498210] [2023-11-12 00:53:22,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:22,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:53:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:22,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:53:22,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:53:22,297 INFO L87 Difference]: Start difference. First operand 211 states and 237 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-11-12 00:53:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:23,527 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2023-11-12 00:53:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:53:23,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 18 [2023-11-12 00:53:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:23,529 INFO L225 Difference]: With dead ends: 213 [2023-11-12 00:53:23,529 INFO L226 Difference]: Without dead ends: 213 [2023-11-12 00:53:23,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:53:23,531 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:23,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 526 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-12 00:53:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-12 00:53:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2023-11-12 00:53:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.4774193548387098) internal successors, (229), 206 states have internal predecessors, (229), 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) [2023-11-12 00:53:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2023-11-12 00:53:23,540 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 18 [2023-11-12 00:53:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:23,540 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2023-11-12 00:53:23,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-11-12 00:53:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2023-11-12 00:53:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:53:23,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:23,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:23,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:23,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:23,755 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:23,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431927, now seen corresponding path program 1 times [2023-11-12 00:53:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313213302] [2023-11-12 00:53:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:23,757 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 [2023-11-12 00:53:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:23,758 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:23,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 (13)] Waiting until timeout for monitored process [2023-11-12 00:53:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:23,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 00:53:23,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:24,008 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:53:24,008 INFO L351 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 [2023-11-12 00:53:24,076 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:24,276 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:24,277 INFO L351 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 44 treesize of output 43 [2023-11-12 00:53:24,350 INFO L351 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 [2023-11-12 00:53:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:53:24,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:26,594 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_171 (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_171) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2023-11-12 00:53:26,630 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:26,631 INFO L351 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 [2023-11-12 00:53:26,635 INFO L351 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 [2023-11-12 00:53:26,641 INFO L351 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 [2023-11-12 00:53:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:53:26,703 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313213302] [2023-11-12 00:53:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313213302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [963331957] [2023-11-12 00:53:26,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:26,704 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-12 00:53:26,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 [2023-11-12 00:53:26,707 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-12 00:53:26,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-11-12 00:53:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:26,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 00:53:26,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:27,021 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:53:27,022 INFO L351 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 [2023-11-12 00:53:27,055 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:27,217 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:27,217 INFO L351 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 44 treesize of output 43 [2023-11-12 00:53:27,295 INFO L351 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 [2023-11-12 00:53:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:53:27,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:27,374 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_211) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))))) is different from false [2023-11-12 00:53:27,401 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_211) c_create_data_~data~0.base) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-12 00:53:27,431 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:27,431 INFO L351 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 [2023-11-12 00:53:27,436 INFO L351 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 [2023-11-12 00:53:27,441 INFO L351 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 [2023-11-12 00:53:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:53:27,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [963331957] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:27,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909698014] [2023-11-12 00:53:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:27,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:27,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:27,494 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:27,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-12 00:53:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:27,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:53:27,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:27,661 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:53:27,661 INFO L351 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 [2023-11-12 00:53:27,698 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:27,847 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:27,847 INFO L351 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 44 treesize of output 43 [2023-11-12 00:53:27,925 INFO L351 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 [2023-11-12 00:53:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:53:27,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:30,095 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:30,096 INFO L351 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 [2023-11-12 00:53:30,100 INFO L351 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 [2023-11-12 00:53:30,105 INFO L351 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 [2023-11-12 00:53:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:53:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909698014] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:30,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-12 00:53:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5, 6, 5, 6] total 12 [2023-11-12 00:53:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312008048] [2023-11-12 00:53:30,159 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:30,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 00:53:30,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:30,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 00:53:30,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=66, Unknown=5, NotChecked=54, Total=156 [2023-11-12 00:53:30,162 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 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) [2023-11-12 00:53:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:31,760 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2023-11-12 00:53:31,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 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 24 [2023-11-12 00:53:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:31,763 INFO L225 Difference]: With dead ends: 216 [2023-11-12 00:53:31,763 INFO L226 Difference]: Without dead ends: 216 [2023-11-12 00:53:31,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=37, Invalid=80, Unknown=5, NotChecked=60, Total=182 [2023-11-12 00:53:31,764 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 52 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:31,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 778 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 370 Invalid, 0 Unknown, 289 Unchecked, 1.5s Time] [2023-11-12 00:53:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-12 00:53:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2023-11-12 00:53:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 155 states have (on average 1.4645161290322581) internal successors, (227), 205 states have internal predecessors, (227), 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) [2023-11-12 00:53:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2023-11-12 00:53:31,772 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 24 [2023-11-12 00:53:31,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:31,772 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2023-11-12 00:53:31,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 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) [2023-11-12 00:53:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2023-11-12 00:53:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:53:31,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:31,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:31,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:31,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:32,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 (13)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:32,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:32,381 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)] === [2023-11-12 00:53:32,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431926, now seen corresponding path program 1 times [2023-11-12 00:53:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:32,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218516423] [2023-11-12 00:53:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:32,383 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 [2023-11-12 00:53:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:32,384 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:32,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 (16)] Waiting until timeout for monitored process [2023-11-12 00:53:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:32,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-12 00:53:32,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:32,619 INFO L351 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 [2023-11-12 00:53:32,637 INFO L351 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 11 treesize of output 5 [2023-11-12 00:53:32,677 INFO L351 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 [2023-11-12 00:53:32,695 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:32,965 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:32,965 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:32,976 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:33,123 INFO L351 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 [2023-11-12 00:53:33,134 INFO L351 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 9 treesize of output 3 [2023-11-12 00:53:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:33,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:33,661 WARN L854 $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_295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_295) 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_294) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_295) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2023-11-12 00:53:33,754 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (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) .cse2))) (and (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_294) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse3) (bvadd (_ bv8 32) .cse0 .cse3))))))) is different from false [2023-11-12 00:53:33,826 WARN L854 $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_295 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_294) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-11-12 00:53:33,857 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:33,857 INFO L351 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 46 [2023-11-12 00:53:33,871 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:33,871 INFO L351 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 35 treesize of output 36 [2023-11-12 00:53:33,879 INFO L351 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 62 treesize of output 50 [2023-11-12 00:53:33,884 INFO L351 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 96 treesize of output 78 [2023-11-12 00:53:33,901 INFO L351 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 15 treesize of output 11 [2023-11-12 00:53:33,907 INFO L351 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 [2023-11-12 00:53:33,934 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:33,935 INFO L351 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 [2023-11-12 00:53:33,945 INFO L351 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 [2023-11-12 00:53:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:53:34,059 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218516423] [2023-11-12 00:53:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218516423] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [136904269] [2023-11-12 00:53:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-12 00:53:34,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 [2023-11-12 00:53:34,061 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-12 00:53:34,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-11-12 00:53:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:34,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-12 00:53:34,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:34,388 INFO L351 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 [2023-11-12 00:53:34,398 INFO L351 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 11 treesize of output 5 [2023-11-12 00:53:34,419 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:34,427 INFO L351 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 [2023-11-12 00:53:34,603 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:34,604 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:34,619 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:34,723 INFO L351 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 [2023-11-12 00:53:34,736 INFO L351 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 9 treesize of output 3 [2023-11-12 00:53:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:34,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:34,961 WARN L854 $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_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_339) 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_338) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_339) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-12 00:53:35,056 WARN L854 $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_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_339) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_338) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_339) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-11-12 00:53:35,137 WARN L854 $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_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_339) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_338) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_339) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-12 00:53:35,168 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:35,168 INFO L351 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 [2023-11-12 00:53:35,172 INFO L351 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 [2023-11-12 00:53:35,216 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:35,216 INFO L351 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 [2023-11-12 00:53:35,236 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:35,236 INFO L351 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 [2023-11-12 00:53:35,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:35,248 INFO L351 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 [2023-11-12 00:53:35,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:35,260 INFO L351 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 [2023-11-12 00:53:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:53:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [136904269] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001595604] [2023-11-12 00:53:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:35,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:35,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:35,273 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:35,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-12 00:53:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:35,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-12 00:53:35,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:35,462 INFO L351 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 [2023-11-12 00:53:35,485 INFO L351 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 11 treesize of output 5 [2023-11-12 00:53:35,498 INFO L351 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 [2023-11-12 00:53:35,515 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:35,527 INFO L351 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 [2023-11-12 00:53:35,692 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:35,693 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:35,707 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:35,799 INFO L351 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 [2023-11-12 00:53:35,810 INFO L351 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 9 treesize of output 3 [2023-11-12 00:53:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:35,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:36,049 WARN L854 $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_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_383) 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_382) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_383) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-12 00:53:36,132 WARN L854 $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_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_383) c_create_data_~data~0.base) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_382) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_383) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse3 (_ bv4 32) .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2023-11-12 00:53:36,219 WARN L854 $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_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) c_create_data_~data~0.base) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_382) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-11-12 00:53:36,242 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:36,243 INFO L351 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 46 [2023-11-12 00:53:36,258 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:36,258 INFO L351 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 35 treesize of output 36 [2023-11-12 00:53:36,266 INFO L351 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 62 treesize of output 50 [2023-11-12 00:53:36,272 INFO L351 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 96 treesize of output 78 [2023-11-12 00:53:36,288 INFO L351 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 15 treesize of output 11 [2023-11-12 00:53:36,293 INFO L351 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 [2023-11-12 00:53:36,322 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:36,323 INFO L351 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 [2023-11-12 00:53:36,334 INFO L351 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 [2023-11-12 00:53:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:53:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001595604] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:36,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-12 00:53:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 8, 7, 8] total 20 [2023-11-12 00:53:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462229396] [2023-11-12 00:53:36,362 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:36,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 00:53:36,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 00:53:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=108, Unknown=9, NotChecked=252, Total=420 [2023-11-12 00:53:36,368 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 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) [2023-11-12 00:53:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:40,096 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2023-11-12 00:53:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:53:40,097 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 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 24 [2023-11-12 00:53:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:40,099 INFO L225 Difference]: With dead ends: 224 [2023-11-12 00:53:40,099 INFO L226 Difference]: Without dead ends: 224 [2023-11-12 00:53:40,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=72, Invalid=165, Unknown=9, NotChecked=306, Total=552 [2023-11-12 00:53:40,101 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 7 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 759 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:40,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1506 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 464 Invalid, 0 Unknown, 759 Unchecked, 3.0s Time] [2023-11-12 00:53:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-12 00:53:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2023-11-12 00:53:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 217 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) [2023-11-12 00:53:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2023-11-12 00:53:40,122 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 24 [2023-11-12 00:53:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:40,123 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2023-11-12 00:53:40,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 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) [2023-11-12 00:53:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2023-11-12 00:53:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:53:40,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:40,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:40,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:40,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:40,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 (16)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:40,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 [2023-11-12 00:53:40,738 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-12 00:53:40,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1476739250, now seen corresponding path program 2 times [2023-11-12 00:53:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182703058] [2023-11-12 00:53:40,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 00:53:40,740 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 [2023-11-12 00:53:40,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:40,740 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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) [2023-11-12 00:53:40,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/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 (19)] Waiting until timeout for monitored process [2023-11-12 00:53:41,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 00:53:41,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:53:41,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 00:53:41,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:41,043 INFO L351 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 11 treesize of output 5 [2023-11-12 00:53:41,058 INFO L351 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 [2023-11-12 00:53:41,070 INFO L351 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 [2023-11-12 00:53:41,104 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:41,114 INFO L351 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 [2023-11-12 00:53:41,364 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:41,364 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:41,380 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:41,629 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:41,629 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:41,646 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:41,779 INFO L351 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 [2023-11-12 00:53:41,789 INFO L351 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 9 treesize of output 3 [2023-11-12 00:53:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:41,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:42,324 WARN L854 $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_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (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_443) 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_444) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_443) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse0 .cse2) (bvadd (_ bv8 32) .cse0 .cse2)))))) is different from false [2023-11-12 00:53:42,405 WARN L854 $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_443 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_443) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_443) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_444) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-12 00:53:42,483 WARN L854 $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_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_443) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_444) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_443) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse3 (_ bv8 32) .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:42,904 WARN L854 $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_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_441))) (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_442) .cse0 v_ArrVal_443) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_444) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_442) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_441) c_create_data_~data~0.base) .cse1) v_ArrVal_443) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-12 00:53:43,200 WARN L854 $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_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_442) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_441) c_create_data_~data~0.base) .cse3) v_ArrVal_443) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_441))) (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_442) .cse4 v_ArrVal_443) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_444) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-12 00:53:43,281 WARN L854 $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_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_442) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_441) c_create_data_~data~0.base) .cse2) v_ArrVal_443) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_441))) (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_442) .cse3 v_ArrVal_443) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_444) c_create_data_~data~0.base) .cse2))))))))) is different from false [2023-11-12 00:53:43,308 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:43,308 INFO L351 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 [2023-11-12 00:53:43,324 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:43,325 INFO L351 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 [2023-11-12 00:53:43,334 INFO L351 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 754 treesize of output 640 [2023-11-12 00:53:43,354 INFO L351 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 745 treesize of output 697 [2023-11-12 00:53:43,385 INFO L351 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 132 treesize of output 100 [2023-11-12 00:53:43,389 INFO L351 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 100 treesize of output 88 [2023-11-12 00:53:43,400 INFO L351 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 69 treesize of output 65 [2023-11-12 00:53:43,414 INFO L351 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 18 treesize of output 14 [2023-11-12 00:53:43,580 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:43,581 INFO L351 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 [2023-11-12 00:53:43,601 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:43,601 INFO L351 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 [2023-11-12 00:53:43,615 INFO L351 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 [2023-11-12 00:53:43,627 INFO L351 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 [2023-11-12 00:53:43,634 INFO L351 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 48 treesize of output 40 [2023-11-12 00:53:43,646 INFO L351 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 20 treesize of output 12 [2023-11-12 00:53:43,656 INFO L351 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 19 treesize of output 11 [2023-11-12 00:53:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-11-12 00:53:43,782 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182703058] [2023-11-12 00:53:43,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182703058] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [850370589] [2023-11-12 00:53:43,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 00:53:43,783 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-12 00:53:43,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 [2023-11-12 00:53:43,788 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-12 00:53:43,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-11-12 00:53:44,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 00:53:44,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:53:44,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 00:53:44,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:44,215 INFO L351 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 [2023-11-12 00:53:44,226 INFO L351 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 11 treesize of output 5 [2023-11-12 00:53:44,242 INFO L351 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 [2023-11-12 00:53:44,258 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:44,418 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:44,418 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:44,432 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:44,634 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:44,634 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:44,648 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:44,743 INFO L351 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 [2023-11-12 00:53:44,759 INFO L351 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 9 treesize of output 3 [2023-11-12 00:53:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:44,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:44,980 WARN L854 $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_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_505) 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_504) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_505) c_create_data_~data~0.base) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2023-11-12 00:53:45,080 WARN L854 $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_505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_505) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_505) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_504) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-12 00:53:45,180 WARN L854 $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_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_505) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_505) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:45,578 WARN L854 $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_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_503))) (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_502) .cse0 v_ArrVal_505) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_502) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_503) c_create_data_~data~0.base) .cse1) v_ArrVal_505) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-12 00:53:45,849 WARN L854 $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_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_502) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse3) v_ArrVal_505) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_503))) (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_502) .cse4 v_ArrVal_505) c_create_data_~data~0.base) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_504) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-12 00:53:45,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_503))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_502) .cse1 v_ArrVal_505) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_504) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_502) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_503) c_create_data_~data~0.base) .cse2) v_ArrVal_505) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:45,978 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:45,979 INFO L351 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 [2023-11-12 00:53:45,995 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:45,995 INFO L351 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 [2023-11-12 00:53:46,003 INFO L351 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 [2023-11-12 00:53:46,009 INFO L351 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 [2023-11-12 00:53:46,030 INFO L351 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 48 treesize of output 40 [2023-11-12 00:53:46,055 INFO L351 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 20 treesize of output 12 [2023-11-12 00:53:46,074 INFO L351 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 19 treesize of output 11 [2023-11-12 00:53:46,116 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:46,116 INFO L351 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 [2023-11-12 00:53:46,137 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:46,138 INFO L351 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 [2023-11-12 00:53:46,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:46,149 INFO L351 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 [2023-11-12 00:53:46,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:46,159 INFO L351 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 [2023-11-12 00:53:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-11-12 00:53:46,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [850370589] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:46,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079042624] [2023-11-12 00:53:46,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 00:53:46,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:46,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:46,176 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:46,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7925358f-228c-4a8d-871c-46274ee10b50/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-12 00:53:46,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 00:53:46,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:53:46,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 00:53:46,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:46,418 INFO L351 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 [2023-11-12 00:53:46,427 INFO L351 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 11 treesize of output 5 [2023-11-12 00:53:46,448 INFO L351 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 [2023-11-12 00:53:46,460 INFO L351 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 19 treesize of output 1 [2023-11-12 00:53:46,611 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:46,612 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:46,620 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:46,801 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:46,801 INFO L351 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 62 treesize of output 57 [2023-11-12 00:53:46,815 INFO L351 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 30 treesize of output 13 [2023-11-12 00:53:46,912 INFO L351 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 [2023-11-12 00:53:46,922 INFO L351 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 9 treesize of output 3 [2023-11-12 00:53:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:46,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:47,132 WARN L854 $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_565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_565) 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_566) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_565) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-12 00:53:47,226 WARN L854 $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_565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_565) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_566) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_565) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-11-12 00:53:47,310 WARN L854 $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_565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_565) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_566) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_565) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:47,636 WARN L854 $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_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_563))) (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_564) .cse0 v_ArrVal_565) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_566) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_564) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_563) c_create_data_~data~0.base) .cse1) v_ArrVal_565) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-12 00:53:48,007 WARN L854 $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_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_564) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_563) c_create_data_~data~0.base) .cse3) v_ArrVal_565) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_563))) (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_564) .cse4 v_ArrVal_565) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_566) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-12 00:53:48,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_563))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_564) .cse1 v_ArrVal_565) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_566) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_564) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_563) c_create_data_~data~0.base) .cse2) v_ArrVal_565) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:48,128 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:48,128 INFO L351 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 [2023-11-12 00:53:48,142 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:48,142 INFO L351 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 [2023-11-12 00:53:48,150 INFO L351 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 [2023-11-12 00:53:48,155 INFO L351 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 [2023-11-12 00:53:48,172 INFO L351 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 48 treesize of output 40 [2023-11-12 00:53:48,182 INFO L351 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 20 treesize of output 12 [2023-11-12 00:53:48,191 INFO L351 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 19 treesize of output 11 [2023-11-12 00:53:48,218 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:48,218 INFO L351 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 [2023-11-12 00:53:48,235 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:48,235 INFO L351 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 [2023-11-12 00:53:48,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:48,249 INFO L351 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 [2023-11-12 00:53:48,254 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:48,258 INFO L351 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 [2023-11-12 00:53:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-11-12 00:53:48,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079042624] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:48,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-12 00:53:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9, 11, 9, 11] total 31 [2023-11-12 00:53:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824793391] [2023-11-12 00:53:48,266 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:48,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-12 00:53:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:48,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-12 00:53:48,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=156, Unknown=18, NotChecked=738, Total=992 [2023-11-12 00:53:48,269 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 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)