./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:48:58,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:48:58,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:48:58,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:48:58,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:48:58,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:48:58,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:48:58,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:48:58,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:48:58,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:48:58,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:48:58,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:48:58,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:48:58,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:48:58,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:48:58,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:48:58,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:48:58,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:48:58,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:48:58,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:48:58,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:48:58,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:48:58,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:48:58,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:48:58,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:48:58,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:48:58,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:48:58,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:48:58,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:48:58,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:48:58,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:48:58,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:48:58,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:48:58,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:48:58,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:48:58,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:48:58,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:48:58,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:48:58,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:48:58,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:48:58,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:48:58,904 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 02:48:58,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:48:58,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:48:58,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:48:58,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:48:58,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:48:58,951 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:48:58,951 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:48:58,951 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:48:58,952 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:48:58,952 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:48:58,953 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:48:58,953 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:48:58,954 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:48:58,954 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:48:58,954 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:48:58,954 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:48:58,954 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:48:58,955 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:48:58,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:48:58,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:48:58,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:48:58,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:48:58,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:48:58,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:48:58,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:48:58,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:48:58,958 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:48:58,959 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:48:58,959 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 02:48:58,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:48:58,959 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:48:58,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:48:58,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:48:58,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:48:58,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:48:58,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:48:58,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:48:58,961 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:48:58,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:48:58,961 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:48:58,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:48:58,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:48:58,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/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_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2022-11-03 02:48:59,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:48:59,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:48:59,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:48:59,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:48:59,276 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:48:59,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-11-03 02:48:59,348 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data/d58f5cda0/87c13ab94b8e49d68864b89b60da59a0/FLAG1501f7141 [2022-11-03 02:48:59,957 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:48:59,958 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-11-03 02:48:59,970 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data/d58f5cda0/87c13ab94b8e49d68864b89b60da59a0/FLAG1501f7141 [2022-11-03 02:49:00,223 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data/d58f5cda0/87c13ab94b8e49d68864b89b60da59a0 [2022-11-03 02:49:00,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:49:00,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:49:00,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:49:00,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:49:00,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:49:00,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:49:00" (1/1) ... [2022-11-03 02:49:00,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca827d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:00, skipping insertion in model container [2022-11-03 02:49:00,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:49:00" (1/1) ... [2022-11-03 02:49:00,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:49:00,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:49:00,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:49:00,635 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-03 02:49:00,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2baa45a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:00, skipping insertion in model container [2022-11-03 02:49:00,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:49:00,637 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-03 02:49:00,639 INFO L158 Benchmark]: Toolchain (without parser) took 410.59ms. Allocated memory is still 98.6MB. Free memory was 62.6MB in the beginning and 72.5MB in the end (delta: -9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:49:00,639 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:49:00,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.37ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 72.5MB in the end (delta: -10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:49:00,642 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.37ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 72.5MB in the end (delta: -10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:49:02,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:49:02,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:49:02,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:49:02,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:49:02,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:49:02,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:49:02,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:49:02,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:49:02,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:49:02,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:49:02,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:49:02,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:49:02,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:49:02,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:49:02,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:49:02,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:49:02,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:49:02,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:49:02,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:49:02,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:49:02,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:49:02,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:49:02,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:49:02,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:49:02,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:49:02,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:49:02,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:49:02,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:49:02,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:49:02,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:49:02,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:49:02,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:49:02,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:49:02,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:49:02,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:49:02,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:49:02,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:49:02,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:49:02,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:49:02,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:49:02,965 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 02:49:03,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:49:03,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:49:03,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:49:03,008 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:49:03,009 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:49:03,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:49:03,010 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:49:03,010 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:49:03,010 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:49:03,010 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:49:03,011 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:49:03,012 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:49:03,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:49:03,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:49:03,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:49:03,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:49:03,014 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:49:03,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:49:03,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:49:03,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:49:03,015 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:49:03,015 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:49:03,016 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 02:49:03,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:49:03,016 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:49:03,016 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:49:03,016 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:49:03,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:49:03,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:49:03,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:49:03,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:49:03,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:49:03,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:49:03,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:49:03,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:49:03,019 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:49:03,019 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:49:03,019 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:49:03,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:49:03,020 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/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_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2022-11-03 02:49:03,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:49:03,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:49:03,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:49:03,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:49:03,396 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:49:03,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-11-03 02:49:03,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data/86d1910c4/568663b9b38a46658a9d742332695e6f/FLAG74f58e174 [2022-11-03 02:49:04,160 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:49:04,161 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-11-03 02:49:04,184 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data/86d1910c4/568663b9b38a46658a9d742332695e6f/FLAG74f58e174 [2022-11-03 02:49:04,437 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/data/86d1910c4/568663b9b38a46658a9d742332695e6f [2022-11-03 02:49:04,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:49:04,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:49:04,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:49:04,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:49:04,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:49:04,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:49:04" (1/1) ... [2022-11-03 02:49:04,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3756cf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:04, skipping insertion in model container [2022-11-03 02:49:04,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:49:04" (1/1) ... [2022-11-03 02:49:04,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:49:04,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:49:04,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:49:04,939 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 02:49:04,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:49:05,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:49:05,024 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:49:05,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:49:05,110 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:49:05,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05 WrapperNode [2022-11-03 02:49:05,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:49:05,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:49:05,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:49:05,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:49:05,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,167 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-11-03 02:49:05,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:49:05,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:49:05,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:49:05,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:49:05,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,204 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:49:05,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:49:05,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:49:05,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:49:05,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (1/1) ... [2022-11-03 02:49:05,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:49:05,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:49:05,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:49:05,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:49:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:49:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:49:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-11-03 02:49:05,285 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-11-03 02:49:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:49:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:49:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:49:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:49:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:49:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:49:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:49:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:49:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:49:05,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:49:05,394 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:49:05,397 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:49:06,541 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:49:06,548 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:49:06,549 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 02:49:06,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:49:06 BoogieIcfgContainer [2022-11-03 02:49:06,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:49:06,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:49:06,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:49:06,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:49:06,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:49:04" (1/3) ... [2022-11-03 02:49:06,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658ffb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:49:06, skipping insertion in model container [2022-11-03 02:49:06,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:49:05" (2/3) ... [2022-11-03 02:49:06,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658ffb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:49:06, skipping insertion in model container [2022-11-03 02:49:06,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:49:06" (3/3) ... [2022-11-03 02:49:06,560 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2022-11-03 02:49:06,581 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:49:06,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-11-03 02:49:06,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:49:06,639 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;@19281b79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:49:06,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-11-03 02:49:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:49:06,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:06,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:49:06,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:06,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-11-03 02:49:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:06,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375777878] [2022-11-03 02:49:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:06,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:06,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:06,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:49:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:06,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:49:06,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:06,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:49:06,954 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:49:06,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 02:49:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:06,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:06,984 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:06,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375777878] [2022-11-03 02:49:06,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375777878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:06,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:06,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:49:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126825354] [2022-11-03 02:49:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:06,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:49:06,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:07,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:49:07,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:49:07,044 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:07,824 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-11-03 02:49:07,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:49:07,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-03 02:49:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:07,845 INFO L225 Difference]: With dead ends: 208 [2022-11-03 02:49:07,845 INFO L226 Difference]: Without dead ends: 206 [2022-11-03 02:49:07,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:49:07,852 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:07,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:49:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-03 02:49:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-11-03 02:49:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-11-03 02:49:07,934 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-11-03 02:49:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:07,935 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-11-03 02:49:07,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-11-03 02:49:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:49:07,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:07,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:49:07,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:08,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:08,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-11-03 02:49:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:08,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992197651] [2022-11-03 02:49:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:08,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:08,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:08,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:08,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:49:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:08,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:49:08,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:08,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:49:08,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:49:08,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:08,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:49:08,370 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:49:08,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 02:49:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:08,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:08,403 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:08,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992197651] [2022-11-03 02:49:08,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992197651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:08,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:08,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:49:08,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627553956] [2022-11-03 02:49:08,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:08,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:49:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:49:08,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:49:08,414 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:09,256 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-11-03 02:49:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:49:09,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-03 02:49:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:09,260 INFO L225 Difference]: With dead ends: 196 [2022-11-03 02:49:09,260 INFO L226 Difference]: Without dead ends: 196 [2022-11-03 02:49:09,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 [2022-11-03 02:49:09,261 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:09,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:49:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-03 02:49:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-11-03 02:49:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-11-03 02:49:09,275 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-11-03 02:49:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:09,276 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-11-03 02:49:09,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-11-03 02:49:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:49:09,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:09,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:49:09,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:09,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:09,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:09,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-11-03 02:49:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:09,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940070206] [2022-11-03 02:49:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:09,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:09,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:09,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:09,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:49:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:09,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:49:09,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:09,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:49:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:09,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:09,572 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:09,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940070206] [2022-11-03 02:49:09,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940070206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:09,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:09,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:49:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382206892] [2022-11-03 02:49:09,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:09,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:49:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:49:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:49:09,575 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:09,942 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-11-03 02:49:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:49:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 02:49:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:09,946 INFO L225 Difference]: With dead ends: 208 [2022-11-03 02:49:09,946 INFO L226 Difference]: Without dead ends: 208 [2022-11-03 02:49:09,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:49:09,947 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:09,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:49:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-03 02:49:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-11-03 02:49:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-11-03 02:49:09,957 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-11-03 02:49:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:09,958 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-11-03 02:49:09,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-11-03 02:49:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:49:09,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:09,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:49:09,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:10,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:10,170 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:10,170 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-11-03 02:49:10,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:10,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179740276] [2022-11-03 02:49:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:10,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:10,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:10,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:49:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:10,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:49:10,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:10,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:49:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:10,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:10,270 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:10,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179740276] [2022-11-03 02:49:10,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179740276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:10,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:10,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:49:10,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325662217] [2022-11-03 02:49:10,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:10,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:49:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:10,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:49:10,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:49:10,273 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:10,706 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-11-03 02:49:10,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:49:10,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 02:49:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:10,708 INFO L225 Difference]: With dead ends: 181 [2022-11-03 02:49:10,708 INFO L226 Difference]: Without dead ends: 181 [2022-11-03 02:49:10,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:49:10,709 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:10,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:49:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-03 02:49:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-03 02:49:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-11-03 02:49:10,718 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-11-03 02:49:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:10,718 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-11-03 02:49:10,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-11-03 02:49:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:49:10,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:10,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:10,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:10,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:10,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-11-03 02:49:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:10,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626798165] [2022-11-03 02:49:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:10,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:10,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 02:49:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:11,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:49:11,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:11,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:49:11,065 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:49:11,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 02:49:11,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:49:11,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:49:11,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:49:11,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:49:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:11,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:11,210 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:11,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626798165] [2022-11-03 02:49:11,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626798165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:11,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:11,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:49:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250314725] [2022-11-03 02:49:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:11,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:49:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:49:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:49:11,212 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:11,819 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-11-03 02:49:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:49:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:49:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:11,821 INFO L225 Difference]: With dead ends: 183 [2022-11-03 02:49:11,821 INFO L226 Difference]: Without dead ends: 183 [2022-11-03 02:49:11,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:49:11,822 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:11,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 602 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:49:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-03 02:49:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-11-03 02:49:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-11-03 02:49:11,831 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-11-03 02:49:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:11,831 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-11-03 02:49:11,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-11-03 02:49:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:49:11,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:11,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:11,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:12,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:12,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:12,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-11-03 02:49:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:12,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214624526] [2022-11-03 02:49:12,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:12,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:12,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:12,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:49:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:12,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:49:12,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:12,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:12,155 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:12,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214624526] [2022-11-03 02:49:12,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214624526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:12,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:12,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:49:12,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439219568] [2022-11-03 02:49:12,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:12,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:49:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:12,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:49:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:49:12,158 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:12,201 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-11-03 02:49:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:49:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:49:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:12,203 INFO L225 Difference]: With dead ends: 258 [2022-11-03 02:49:12,204 INFO L226 Difference]: Without dead ends: 258 [2022-11-03 02:49:12,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:49:12,205 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:12,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:49:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-03 02:49:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-11-03 02:49:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-11-03 02:49:12,215 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-11-03 02:49:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:12,215 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-11-03 02:49:12,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-11-03 02:49:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:49:12,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:12,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:12,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:12,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:12,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:12,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-11-03 02:49:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:12,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128283768] [2022-11-03 02:49:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:12,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:12,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:12,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:12,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 02:49:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:12,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:49:12,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:12,585 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:49:12,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-03 02:49:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:12,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:12,612 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:12,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128283768] [2022-11-03 02:49:12,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128283768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:12,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:12,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:49:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896876905] [2022-11-03 02:49:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:12,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:49:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:49:12,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:49:12,615 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:12,976 INFO L93 Difference]: Finished difference Result 211 states and 249 transitions. [2022-11-03 02:49:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:49:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:49:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:12,978 INFO L225 Difference]: With dead ends: 211 [2022-11-03 02:49:12,978 INFO L226 Difference]: Without dead ends: 211 [2022-11-03 02:49:12,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:49:12,979 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:12,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 198 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:49:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-03 02:49:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-11-03 02:49:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 247 transitions. [2022-11-03 02:49:12,986 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 247 transitions. Word has length 13 [2022-11-03 02:49:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:12,987 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 247 transitions. [2022-11-03 02:49:12,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 247 transitions. [2022-11-03 02:49:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:49:12,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:12,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:13,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:13,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:13,201 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-11-03 02:49:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:13,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458791734] [2022-11-03 02:49:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:13,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:13,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:13,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:13,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 02:49:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:13,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:49:13,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:13,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:13,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-03 02:49:13,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:49:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:13,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:13,330 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458791734] [2022-11-03 02:49:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458791734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:13,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:49:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281840517] [2022-11-03 02:49:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:49:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:49:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:49:13,332 INFO L87 Difference]: Start difference. First operand 209 states and 247 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:13,727 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-11-03 02:49:13,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:49:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:49:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:13,728 INFO L225 Difference]: With dead ends: 198 [2022-11-03 02:49:13,728 INFO L226 Difference]: Without dead ends: 198 [2022-11-03 02:49:13,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:49:13,729 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:13,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:49:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-03 02:49:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2022-11-03 02:49:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2022-11-03 02:49:13,736 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 13 [2022-11-03 02:49:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:13,736 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2022-11-03 02:49:13,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2022-11-03 02:49:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:49:13,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:13,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:13,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:13,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:13,949 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-11-03 02:49:13,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:13,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966862405] [2022-11-03 02:49:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:13,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:13,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:13,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:13,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:49:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:14,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:49:14,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:14,104 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:49:14,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-03 02:49:14,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:14,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 02:49:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:14,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:14,164 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:14,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966862405] [2022-11-03 02:49:14,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966862405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:14,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:14,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:49:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589511597] [2022-11-03 02:49:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:14,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:49:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:14,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:49:14,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:49:14,167 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:14,889 INFO L93 Difference]: Finished difference Result 247 states and 285 transitions. [2022-11-03 02:49:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:49:14,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:49:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:14,891 INFO L225 Difference]: With dead ends: 247 [2022-11-03 02:49:14,891 INFO L226 Difference]: Without dead ends: 247 [2022-11-03 02:49:14,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:49:14,892 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 25 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:14,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 397 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:49:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-03 02:49:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 202. [2022-11-03 02:49:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 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) [2022-11-03 02:49:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 231 transitions. [2022-11-03 02:49:14,899 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 231 transitions. Word has length 17 [2022-11-03 02:49:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:14,899 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 231 transitions. [2022-11-03 02:49:14,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 231 transitions. [2022-11-03 02:49:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:49:14,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:14,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:14,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:15,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:15,101 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-11-03 02:49:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:15,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460310226] [2022-11-03 02:49:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:15,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:15,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:15,103 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:15,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 02:49:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:15,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 02:49:15,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:15,244 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:15,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-03 02:49:15,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:15,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:15,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-03 02:49:15,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:49:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:15,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:49:15,405 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:15,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460310226] [2022-11-03 02:49:15,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460310226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:49:15,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:49:15,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:49:15,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275642355] [2022-11-03 02:49:15,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:49:15,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:49:15,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:15,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:49:15,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:49:15,406 INFO L87 Difference]: Start difference. First operand 202 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:16,215 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-11-03 02:49:16,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:49:16,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:49:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:16,217 INFO L225 Difference]: With dead ends: 204 [2022-11-03 02:49:16,217 INFO L226 Difference]: Without dead ends: 204 [2022-11-03 02:49:16,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:49:16,219 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:16,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 414 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:49:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-03 02:49:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-11-03 02:49:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2022-11-03 02:49:16,225 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 17 [2022-11-03 02:49:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:16,225 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2022-11-03 02:49:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2022-11-03 02:49:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:49:16,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:16,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:16,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:16,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:16,439 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:16,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-11-03 02:49:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:16,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781770696] [2022-11-03 02:49:16,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:16,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:16,441 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:16,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 02:49:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:16,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 02:49:16,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:16,645 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:49:16,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-03 02:49:16,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:16,806 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:16,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 02:49:16,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 02:49:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:49:16,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:16,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_176) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)))) is different from false [2022-11-03 02:49:16,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2022-11-03 02:49:16,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:16,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-03 02:49:16,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-03 02:49:16,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:49:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:49:17,046 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:17,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781770696] [2022-11-03 02:49:17,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781770696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:17,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [993857474] [2022-11-03 02:49:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:17,047 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:49:17,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:49:17,049 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:49:17,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-11-03 02:49:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:17,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:49:17,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:17,420 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:49:17,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-03 02:49:17,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:17,579 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:17,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 02:49:17,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 02:49:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:49:17,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:17,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_218) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)))) is different from false [2022-11-03 02:49:17,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_218) c_create_data_~data~0.base) .cse0)))))) is different from false [2022-11-03 02:49:17,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:17,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-03 02:49:17,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-03 02:49:17,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:49:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:49:17,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [993857474] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:17,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468667000] [2022-11-03 02:49:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:17,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:49:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:49:17,737 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:49:17,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:49:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:17,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:49:17,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:17,881 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:49:17,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-03 02:49:17,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:17,983 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:17,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 02:49:18,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 02:49:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:49:18,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:18,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_260) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2022-11-03 02:49:18,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:18,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-03 02:49:18,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-03 02:49:18,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:49:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:49:18,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468667000] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:18,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:49:18,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5, 6, 5, 6] total 17 [2022-11-03 02:49:18,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576619786] [2022-11-03 02:49:18,216 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:49:18,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:49:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:49:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=117, Unknown=8, NotChecked=130, Total=306 [2022-11-03 02:49:18,217 INFO L87 Difference]: Start difference. First operand 202 states and 227 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:19,364 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-11-03 02:49:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:49:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 02:49:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:19,366 INFO L225 Difference]: With dead ends: 207 [2022-11-03 02:49:19,366 INFO L226 Difference]: Without dead ends: 207 [2022-11-03 02:49:19,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=135, Unknown=8, NotChecked=140, Total=342 [2022-11-03 02:49:19,367 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 28 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:19,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1242 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 701 Unchecked, 1.0s Time] [2022-11-03 02:49:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-03 02:49:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2022-11-03 02:49:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 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) [2022-11-03 02:49:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2022-11-03 02:49:19,373 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 22 [2022-11-03 02:49:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:19,374 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2022-11-03 02:49:19,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2022-11-03 02:49:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:49:19,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:19,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:19,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:19,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:19,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:19,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:49:19,976 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-11-03 02:49:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:19,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650989949] [2022-11-03 02:49:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:19,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:19,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:19,979 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:19,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-03 02:49:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:20,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 02:49:20,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:20,191 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:20,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-03 02:49:20,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:49:20,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:20,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:20,402 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:20,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:49:20,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:49:20,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:49:20,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:49:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:20,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:21,083 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_306) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_306) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_305) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-11-03 02:49:21,133 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:49:21,196 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-03 02:49:21,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:21,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-03 02:49:21,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-11-03 02:49:21,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:21,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-03 02:49:21,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:21,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 02:49:21,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:49:21,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-03 02:49:21,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:49:21,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 02:49:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:49:21,359 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:21,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650989949] [2022-11-03 02:49:21,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650989949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:21,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1060497912] [2022-11-03 02:49:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:21,360 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:49:21,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:49:21,361 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:49:21,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-11-03 02:49:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:21,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:49:21,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:21,693 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:21,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-03 02:49:21,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:49:21,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:21,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:21,813 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:21,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:49:21,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:49:21,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:49:21,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:49:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:21,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:22,072 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_351) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_350) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_351) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2022-11-03 02:49:22,137 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) c_create_data_~data~0.base) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_350) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2022-11-03 02:49:22,193 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) c_create_data_~data~0.base) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_350) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-03 02:49:22,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:22,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-03 02:49:22,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-11-03 02:49:22,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:22,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-03 02:49:22,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:22,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 02:49:22,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:49:22,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-03 02:49:22,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:49:22,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 02:49:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:49:22,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1060497912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:22,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122481491] [2022-11-03 02:49:22,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:22,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:49:22,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:49:22,297 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:49:22,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:49:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:22,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:49:22,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:22,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:49:22,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-03 02:49:22,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:22,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:22,540 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:22,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:49:22,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:49:22,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:49:22,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:49:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:22,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:22,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_396) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_395) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_396) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse0 .cse2) (bvadd (_ bv8 32) .cse0 .cse2)))))) is different from false [2022-11-03 02:49:22,855 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_396) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_396) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_395) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:49:22,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_396) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_396) c_create_data_~data~0.base) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2))))))) is different from false [2022-11-03 02:49:22,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:22,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-03 02:49:22,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-11-03 02:49:22,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:22,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-03 02:49:22,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:22,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 02:49:22,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:49:22,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-03 02:49:22,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:49:23,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 02:49:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:49:23,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122481491] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:23,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:49:23,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 8, 7, 8] total 20 [2022-11-03 02:49:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918203019] [2022-11-03 02:49:23,022 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:49:23,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:49:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:49:23,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:49:23,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=108, Unknown=9, NotChecked=252, Total=420 [2022-11-03 02:49:23,025 INFO L87 Difference]: Start difference. First operand 201 states and 225 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:26,978 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2022-11-03 02:49:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:49:26,990 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 02:49:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:26,991 INFO L225 Difference]: With dead ends: 213 [2022-11-03 02:49:26,991 INFO L226 Difference]: Without dead ends: 213 [2022-11-03 02:49:26,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=72, Invalid=165, Unknown=9, NotChecked=306, Total=552 [2022-11-03 02:49:26,992 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 15 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:26,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1486 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 552 Invalid, 0 Unknown, 715 Unchecked, 3.1s Time] [2022-11-03 02:49:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-03 02:49:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2022-11-03 02:49:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:49:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions. [2022-11-03 02:49:27,006 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 22 [2022-11-03 02:49:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:27,006 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions. [2022-11-03 02:49:27,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:49:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions. [2022-11-03 02:49:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:49:27,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:27,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:27,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:27,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:27,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:27,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:49:27,625 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-11-03 02:49:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-11-03 02:49:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:49:27,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252375308] [2022-11-03 02:49:27,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:49:27,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:49:27,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:49:27,627 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:49:27,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-03 02:49:27,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:49:27,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:49:27,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 02:49:27,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:27,936 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:27,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-03 02:49:27,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:49:27,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:27,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:28,193 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:28,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:49:28,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:49:28,401 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:28,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:49:28,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:49:28,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:49:28,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:49:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:28,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:29,087 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_458) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_459) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_458) c_create_data_~data~0.base) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-03 02:49:29,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_459) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:49:29,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_459) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:49:29,378 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_456))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_457) .cse0 v_ArrVal_458) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_459) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_457) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_456) c_create_data_~data~0.base) .cse1) v_ArrVal_458) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-11-03 02:49:29,595 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_456))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_457) .cse1 v_ArrVal_458) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_459) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_457) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_456) c_create_data_~data~0.base) .cse2) v_ArrVal_458) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-11-03 02:49:29,683 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_457) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_456) c_create_data_~data~0.base) .cse2) v_ArrVal_458) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_456))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_457) .cse3 v_ArrVal_458) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_459) c_create_data_~data~0.base) .cse2))))))))) is different from false [2022-11-03 02:49:29,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:29,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-03 02:49:29,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:29,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-03 02:49:29,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2022-11-03 02:49:29,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144 [2022-11-03 02:49:29,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2022-11-03 02:49:29,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 100 [2022-11-03 02:49:29,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-11-03 02:49:29,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:29,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-03 02:49:29,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:29,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-03 02:49:29,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:49:29,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2022-11-03 02:49:29,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:49:29,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2022-11-03 02:49:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-03 02:49:29,997 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:49:29,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252375308] [2022-11-03 02:49:29,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252375308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:29,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364368931] [2022-11-03 02:49:29,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:49:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:49:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:49:30,001 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:49:30,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-03 02:49:30,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:49:30,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:49:30,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:49:30,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:30,404 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:30,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-03 02:49:30,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:49:30,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:30,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:49:30,542 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:30,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:49:30,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:49:30,692 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:49:30,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:49:30,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:49:30,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:49:30,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:49:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:30,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:31,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_521) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_521) c_create_data_~data~0.base) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_520) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-11-03 02:49:31,110 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_521) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_521) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_520) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:49:31,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_521) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_521) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_520) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:49:31,462 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_518))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_519) .cse0 v_ArrVal_521) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_520) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_519) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_518) c_create_data_~data~0.base) .cse1) v_ArrVal_521) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-11-03 02:49:31,710 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_519) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_518) c_create_data_~data~0.base) .cse3) v_ArrVal_521) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_518))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_519) .cse4 v_ArrVal_521) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_520) c_create_data_~data~0.base) .cse3))))))))) is different from false [2022-11-03 02:49:31,800 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_519) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_518) c_create_data_~data~0.base) .cse2) v_ArrVal_521) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_518))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_519) .cse3 v_ArrVal_521) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_520) c_create_data_~data~0.base) .cse2))))))))) is different from false [2022-11-03 02:49:31,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:31,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-03 02:49:31,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:49:31,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-03 02:49:31,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 334 [2022-11-03 02:49:31,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1112 treesize of output 1034 [2022-11-03 02:49:31,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 950 [2022-11-03 02:49:31,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 950 treesize of output 870 [2022-11-03 02:49:31,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 870 treesize of output 838 [2022-11-03 02:49:31,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 686 [2022-11-03 02:50:03,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:03,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-03 02:50:03,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:03,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-03 02:50:03,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2022-11-03 02:50:03,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 244 [2022-11-03 02:50:03,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2022-11-03 02:50:03,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 162 [2022-11-03 02:50:03,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 160 [2022-11-03 02:50:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-03 02:50:08,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1364368931] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:50:08,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188507791] [2022-11-03 02:50:08,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:50:08,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:50:08,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:50:08,620 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:50:08,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 02:50:08,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:50:08,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:50:08,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 02:50:08,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:50:08,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:50:08,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-03 02:50:08,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:50:08,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:50:09,099 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:50:09,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:50:09,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:50:09,296 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:50:09,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:50:09,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:50:09,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:50:09,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:50:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:09,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:50:09,703 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_584) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_584) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_583) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-11-03 02:50:09,767 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_583) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:50:09,869 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_584) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_583) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:50:10,196 WARN L833 $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_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_582))) (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_581) .cse0 v_ArrVal_584) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_583) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_582) c_create_data_~data~0.base) .cse1) v_ArrVal_584) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-11-03 02:50:10,602 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_582))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_581) .cse1 v_ArrVal_584) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_583) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_582) c_create_data_~data~0.base) .cse2) v_ArrVal_584) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-11-03 02:50:10,730 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_582) c_create_data_~data~0.base) .cse2) v_ArrVal_584) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_582))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_581) .cse3 v_ArrVal_584) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_583) c_create_data_~data~0.base) .cse2))))))))) is different from false [2022-11-03 02:50:10,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:10,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-03 02:50:10,779 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:10,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-03 02:50:10,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2022-11-03 02:50:10,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 244 [2022-11-03 02:50:10,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2022-11-03 02:50:10,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 184 [2022-11-03 02:50:10,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 130 [2022-11-03 02:50:10,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:10,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-03 02:50:10,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:10,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-03 02:50:10,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:50:10,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2022-11-03 02:50:10,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:50:10,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2022-11-03 02:50:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-03 02:50:10,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188507791] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:50:10,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:50:10,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9, 11, 9, 11] total 31 [2022-11-03 02:50:10,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252640640] [2022-11-03 02:50:10,956 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:50:10,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:50:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:50:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:50:10,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=156, Unknown=18, NotChecked=738, Total=992 [2022-11-03 02:50:10,959 INFO L87 Difference]: Start difference. First operand 211 states and 235 transitions. Second operand has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:19,114 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2022-11-03 02:50:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:50:19,116 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-03 02:50:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:19,117 INFO L225 Difference]: With dead ends: 223 [2022-11-03 02:50:19,117 INFO L226 Difference]: Without dead ends: 223 [2022-11-03 02:50:19,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=109, Invalid=251, Unknown=18, NotChecked=882, Total=1260 [2022-11-03 02:50:19,119 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 17 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1602 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:19,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2318 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 666 Invalid, 0 Unknown, 1602 Unchecked, 5.1s Time] [2022-11-03 02:50:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-03 02:50:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2022-11-03 02:50:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:50:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2022-11-03 02:50:19,127 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 27 [2022-11-03 02:50:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:19,127 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2022-11-03 02:50:19,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2022-11-03 02:50:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:50:19,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:19,129 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:19,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:50:19,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-03 02:50:19,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2022-11-03 02:50:19,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:50:19,745 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)] === [2022-11-03 02:50:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2022-11-03 02:50:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:50:19,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640266892] [2022-11-03 02:50:19,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:50:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:50:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:50:19,747 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:50:19,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-03 02:50:20,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:50:20,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:50:20,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 02:50:20,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:50:20,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:50:20,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-03 02:50:20,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:50:20,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:50:20,585 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:50:20,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:50:20,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:50:20,910 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:50:20,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:50:20,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:50:21,235 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:50:21,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:50:21,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:50:21,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:50:21,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:50:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:21,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:50:22,349 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_664) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (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_664) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_663) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-11-03 02:50:22,416 WARN L833 $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_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_664) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_663) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_664) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2022-11-03 02:50:22,517 WARN L833 $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_664 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_664) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_664) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_663) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-11-03 02:50:22,632 WARN L833 $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_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_662))) (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_661) .cse0 v_ArrVal_664) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_663) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_661) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_662) c_create_data_~data~0.base) .cse1) v_ArrVal_664) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-11-03 02:50:22,709 WARN L833 $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_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_661) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_662) c_create_data_~data~0.base) .cse3) v_ArrVal_664) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_662))) (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_661) .cse4 v_ArrVal_664) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_663) c_create_data_~data~0.base) .cse3))))))))) is different from false [2022-11-03 02:50:22,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_662))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_661) .cse1 v_ArrVal_664) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_663) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_661) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_662) c_create_data_~data~0.base) .cse2) v_ArrVal_664) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse5 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse3))))))) is different from false [2022-11-03 02:50:23,013 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_659))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_660) .cse2 v_ArrVal_661) (select (select (store .cse3 .cse2 v_ArrVal_662) c_create_data_~data~0.base) .cse4) v_ArrVal_664))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_659))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_662))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_660) .cse5 v_ArrVal_661) .cse6 v_ArrVal_664) c_create_data_~data~0.base) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_663) c_create_data_~data~0.base) .cse4)))))))))) is different from false [2022-11-03 02:50:23,132 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_659))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_662))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_660) .cse1 v_ArrVal_661) .cse2 v_ArrVal_664) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_663) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_659))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_660) .cse8 v_ArrVal_661) (select (select (store .cse9 .cse8 v_ArrVal_662) c_create_data_~data~0.base) .cse3) v_ArrVal_664))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse7 .cse4 (_ bv12 32)) (bvadd (_ bv16 32) .cse7 .cse4))))))) is different from false [2022-11-03 02:50:23,300 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_659))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_662))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_660) .cse1 v_ArrVal_661) .cse2 v_ArrVal_664) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_663) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_659))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_660) .cse7 v_ArrVal_661) (select (select (store .cse8 .cse7 v_ArrVal_662) c_create_data_~data~0.base) .cse3) v_ArrVal_664))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse6))))))) is different from false [2022-11-03 02:50:23,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:23,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2022-11-03 02:50:23,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:23,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2022-11-03 02:50:23,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 588 treesize of output 498 [2022-11-03 02:50:23,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2078 treesize of output 1940 [2022-11-03 02:50:23,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1936 treesize of output 1696 [2022-11-03 02:50:23,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1696 treesize of output 1576 [2022-11-03 02:50:23,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1576 treesize of output 1520 [2022-11-03 02:50:23,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1520 treesize of output 1392 [2022-11-03 02:50:23,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1392 treesize of output 1128 [2022-11-03 02:50:23,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:23,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2022-11-03 02:50:23,923 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:50:23,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2022-11-03 02:50:23,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:50:23,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 310 [2022-11-03 02:50:23,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:50:23,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 314 [2022-11-03 02:50:23,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 286 [2022-11-03 02:50:23,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 270 [2022-11-03 02:50:23,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 210 [2022-11-03 02:50:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-11-03 02:50:24,169 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:50:24,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640266892] [2022-11-03 02:50:24,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640266892] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:50:24,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [334989755] [2022-11-03 02:50:24,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:50:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:50:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:50:24,172 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:50:24,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0fcbc5e-7c13-4d02-bea9-796e10d776ca/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-03 02:50:24,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:50:24,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:50:25,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:50:25,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:50:25,064 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:50:25,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-03 02:50:25,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:50:25,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:50:25,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:50:25,256 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:50:25,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:50:25,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:50:25,458 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:50:25,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:50:25,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:50:25,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-03 02:50:25,778 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:50:25,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-03 02:50:25,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:50:25,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:50:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:25,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:50:27,336 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse5)) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse2 (bvadd (_ bv8 32) .cse0 .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (or (not (bvule (bvadd (_ bv4 32) .cse0 .cse1) .cse2)) (not (bvule .cse2 (select |c_#length| .cse3))) (and (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_743) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv8 32) .cse4 .cse1) (bvadd .cse4 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_743) c_create_data_~data~0.base) .cse5) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_742) c_create_data_~data~0.base) .cse5))))))))) is different from false [2022-11-03 02:51:02,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:02,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 328 [2022-11-03 02:51:02,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:02,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 208 [2022-11-03 02:51:02,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6110 treesize of output 5306 [2022-11-03 02:51:02,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33416 treesize of output 32306 [2022-11-03 02:51:02,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31502 treesize of output 29374 [2022-11-03 02:51:02,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30174 treesize of output 29078 [2022-11-03 02:51:02,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29078 treesize of output 24526 [2022-11-03 02:51:03,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24420 treesize of output 21092 [2022-11-03 02:51:03,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20638 treesize of output 18510 [2022-11-03 02:51:03,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19070 treesize of output 18630