./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V --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 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:35:17,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:35:17,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:35:17,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:35:17,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:35:17,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:35:17,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:35:17,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:35:17,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:35:18,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:35:18,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:35:18,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:35:18,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:35:18,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:35:18,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:35:18,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:35:18,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:35:18,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:35:18,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:35:18,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:35:18,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:35:18,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:35:18,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:35:18,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:35:18,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:35:18,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:35:18,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:35:18,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:35:18,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:35:18,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:35:18,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:35:18,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:35:18,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:35:18,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:35:18,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:35:18,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:35:18,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:35:18,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:35:18,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:35:18,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:35:18,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:35:18,046 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-23 02:35:18,086 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:35:18,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:35:18,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:35:18,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:35:18,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:35:18,092 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:35:18,092 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:35:18,092 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:35:18,092 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:35:18,093 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:35:18,094 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:35:18,094 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:35:18,094 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:35:18,094 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:35:18,095 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:35:18,095 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:35:18,095 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:35:18,095 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:35:18,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:35:18,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:35:18,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:35:18,097 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:35:18,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:35:18,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:35:18,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:35:18,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:35:18,099 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:35:18,100 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:35:18,100 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:35:18,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:35:18,100 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:35:18,101 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:35:18,101 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:35:18,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:35:18,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:35:18,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:35:18,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:35:18,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:35:18,102 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:35:18,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:35:18,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:35:18,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:35:18,103 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/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_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V 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 -> 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 [2021-11-23 02:35:18,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:35:18,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:35:18,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:35:18,462 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:35:18,463 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:35:18,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2021-11-23 02:35:18,544 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data/09ae01207/6387b71fb73b4ac7a81023d220724fe8/FLAGea537d273 [2021-11-23 02:35:19,051 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:35:19,052 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2021-11-23 02:35:19,070 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data/09ae01207/6387b71fb73b4ac7a81023d220724fe8/FLAGea537d273 [2021-11-23 02:35:19,356 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data/09ae01207/6387b71fb73b4ac7a81023d220724fe8 [2021-11-23 02:35:19,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:35:19,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:35:19,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:35:19,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:35:19,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:35:19,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:19" (1/1) ... [2021-11-23 02:35:19,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3262ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:19, skipping insertion in model container [2021-11-23 02:35:19,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:19" (1/1) ... [2021-11-23 02:35:19,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:35:19,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:35:19,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:35:19,964 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-11-23 02:35:19,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ea755b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:19, skipping insertion in model container [2021-11-23 02:35:19,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:35:19,966 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-23 02:35:19,968 INFO L158 Benchmark]: Toolchain (without parser) took 606.42ms. Allocated memory is still 121.6MB. Free memory was 79.7MB in the beginning and 91.2MB in the end (delta: -11.5MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2021-11-23 02:35:19,968 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory was 98.4MB in the beginning and 98.3MB in the end (delta: 93.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:35:19,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.80ms. Allocated memory is still 121.6MB. Free memory was 79.5MB in the beginning and 91.2MB in the end (delta: -11.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2021-11-23 02:35:19,971 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.26ms. Allocated memory is still 121.6MB. Free memory was 98.4MB in the beginning and 98.3MB in the end (delta: 93.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.80ms. Allocated memory is still 121.6MB. Free memory was 79.5MB in the beginning and 91.2MB in the end (delta: -11.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V --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 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:35:22,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:35:22,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:35:22,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:35:22,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:35:22,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:35:22,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:35:22,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:35:22,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:35:22,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:35:22,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:35:22,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:35:22,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:35:22,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:35:22,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:35:22,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:35:22,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:35:22,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:35:22,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:35:22,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:35:22,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:35:22,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:35:22,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:35:22,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:35:22,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:35:22,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:35:22,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:35:22,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:35:22,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:35:22,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:35:22,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:35:22,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:35:22,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:35:22,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:35:22,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:35:22,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:35:22,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:35:22,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:35:22,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:35:22,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:35:22,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:35:22,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-23 02:35:22,309 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:35:22,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:35:22,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:35:22,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:35:22,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:35:22,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:35:22,311 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:35:22,312 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:35:22,312 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:35:22,312 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:35:22,313 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:35:22,313 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:35:22,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:35:22,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:35:22,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:35:22,315 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:35:22,316 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:35:22,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:35:22,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:35:22,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:35:22,316 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:35:22,317 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:35:22,317 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:35:22,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:35:22,317 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:35:22,317 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 02:35:22,318 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 02:35:22,318 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:35:22,318 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:35:22,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:35:22,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 02:35:22,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:35:22,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:35:22,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:35:22,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:35:22,320 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-23 02:35:22,320 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 02:35:22,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:35:22,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:35:22,321 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_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/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_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V 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 -> 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 [2021-11-23 02:35:22,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:35:22,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:35:22,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:35:22,796 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:35:22,797 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:35:22,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2021-11-23 02:35:22,870 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data/73bf6e67f/d72afbdfb7e345d2b65083c55ecc085a/FLAGdff7d3039 [2021-11-23 02:35:23,516 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:35:23,517 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2021-11-23 02:35:23,533 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data/73bf6e67f/d72afbdfb7e345d2b65083c55ecc085a/FLAGdff7d3039 [2021-11-23 02:35:23,736 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/data/73bf6e67f/d72afbdfb7e345d2b65083c55ecc085a [2021-11-23 02:35:23,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:35:23,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:35:23,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:35:23,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:35:23,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:35:23,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:23" (1/1) ... [2021-11-23 02:35:23,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338ccd68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:23, skipping insertion in model container [2021-11-23 02:35:23,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:23" (1/1) ... [2021-11-23 02:35:23,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:35:23,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:35:24,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:35:24,357 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-23 02:35:24,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:35:24,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:35:24,439 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:35:24,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:35:24,589 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:35:24,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24 WrapperNode [2021-11-23 02:35:24,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:35:24,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:35:24,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:35:24,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:35:24,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,682 INFO L137 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 31 [2021-11-23 02:35:24,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:35:24,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:35:24,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:35:24,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:35:24,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:35:24,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:35:24,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:35:24,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:35:24,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (1/1) ... [2021-11-23 02:35:24,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:35:24,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:35:24,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:35:24,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:35:24,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-23 02:35:24,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-23 02:35:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:35:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:35:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:35:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:35:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:35:24,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:35:24,926 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:35:24,928 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:35:25,133 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:35:25,139 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:35:25,139 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 02:35:25,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:25 BoogieIcfgContainer [2021-11-23 02:35:25,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:35:25,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:35:25,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:35:25,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:35:25,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:35:23" (1/3) ... [2021-11-23 02:35:25,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d3e7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:35:25, skipping insertion in model container [2021-11-23 02:35:25,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:24" (2/3) ... [2021-11-23 02:35:25,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d3e7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:35:25, skipping insertion in model container [2021-11-23 02:35:25,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:25" (3/3) ... [2021-11-23 02:35:25,158 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3.i [2021-11-23 02:35:25,163 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:35:25,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-23 02:35:25,212 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:35:25,219 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:35:25,219 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-23 02:35:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 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) [2021-11-23 02:35:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 02:35:25,240 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:35:25,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:35:25,242 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:35:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:35:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash -74700687, now seen corresponding path program 1 times [2021-11-23 02:35:25,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:35:25,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097594640] [2021-11-23 02:35:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:25,260 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:35:25,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:35:25,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:35:25,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 02:35:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:25,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 02:35:25,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:25,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:35:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:25,526 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:35:25,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097594640] [2021-11-23 02:35:25,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097594640] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:35:25,528 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:35:25,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-23 02:35:25,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74745893] [2021-11-23 02:35:25,530 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:35:25,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:35:25,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:35:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:35:25,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:35:25,565 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:35:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:35:25,648 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2021-11-23 02:35:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:35:25,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-23 02:35:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:35:25,659 INFO L225 Difference]: With dead ends: 37 [2021-11-23 02:35:25,659 INFO L226 Difference]: Without dead ends: 33 [2021-11-23 02:35:25,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:35:25,665 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:35:25,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:35:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-11-23 02:35:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2021-11-23 02:35:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-23 02:35:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-11-23 02:35:25,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 11 [2021-11-23 02:35:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:35:25,706 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-23 02:35:25,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:35:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-11-23 02:35:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 02:35:25,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:35:25,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:35:25,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:35:25,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:35:25,924 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:35:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:35:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash 812802994, now seen corresponding path program 1 times [2021-11-23 02:35:25,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:35:25,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106856728] [2021-11-23 02:35:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:25,931 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:35:25,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:35:25,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:35:25,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 02:35:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:26,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 02:35:26,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:26,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:35:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:26,101 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:35:26,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106856728] [2021-11-23 02:35:26,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106856728] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:35:26,102 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:35:26,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-23 02:35:26,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569029338] [2021-11-23 02:35:26,103 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:35:26,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:35:26,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:35:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:35:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:35:26,113 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:35:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:35:26,199 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-11-23 02:35:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:35:26,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-23 02:35:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:35:26,204 INFO L225 Difference]: With dead ends: 32 [2021-11-23 02:35:26,208 INFO L226 Difference]: Without dead ends: 30 [2021-11-23 02:35:26,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:35:26,211 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:35:26,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:35:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-23 02:35:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-11-23 02:35:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-23 02:35:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-11-23 02:35:26,226 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2021-11-23 02:35:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:35:26,227 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-11-23 02:35:26,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:35:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-11-23 02:35:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 02:35:26,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:35:26,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:35:26,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-23 02:35:26,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:35:26,440 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:35:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:35:26,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1979292102, now seen corresponding path program 1 times [2021-11-23 02:35:26,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:35:26,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902462867] [2021-11-23 02:35:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:26,442 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:35:26,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:35:26,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:35:26,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 02:35:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:26,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:35:26,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:26,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:35:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:26,675 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:35:26,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902462867] [2021-11-23 02:35:26,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902462867] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:35:26,675 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:35:26,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-23 02:35:26,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669923470] [2021-11-23 02:35:26,677 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:35:26,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:35:26,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:35:26,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:35:26,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:35:26,680 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2021-11-23 02:35:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:35:26,760 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2021-11-23 02:35:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:35:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) Word has length 12 [2021-11-23 02:35:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:35:26,763 INFO L225 Difference]: With dead ends: 42 [2021-11-23 02:35:26,763 INFO L226 Difference]: Without dead ends: 42 [2021-11-23 02:35:26,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:35:26,773 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:35:26,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:35:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-23 02:35:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-11-23 02:35:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-23 02:35:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2021-11-23 02:35:26,793 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 12 [2021-11-23 02:35:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:35:26,794 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2021-11-23 02:35:26,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2021-11-23 02:35:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2021-11-23 02:35:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:35:26,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:35:26,798 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:35:26,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:35:27,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:35:27,011 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:35:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:35:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -938120081, now seen corresponding path program 1 times [2021-11-23 02:35:27,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:35:27,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598937821] [2021-11-23 02:35:27,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:27,012 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:35:27,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:35:27,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:35:27,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 02:35:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:27,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:35:27,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:27,110 INFO L388 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 [2021-11-23 02:35:27,235 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:35:27,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2021-11-23 02:35:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:27,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:35:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:38,286 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:35:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598937821] [2021-11-23 02:35:38,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598937821] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:35:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [554512076] [2021-11-23 02:35:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:38,287 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:35:38,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:35:38,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:35:38,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-23 02:35:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:38,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:35:38,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:38,432 INFO L388 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 [2021-11-23 02:35:38,533 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:35:38,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2021-11-23 02:35:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:38,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:35:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:47,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [554512076] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:35:47,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485665828] [2021-11-23 02:35:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:47,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:35:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:35:47,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:35:47,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:35:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:47,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:35:47,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:47,205 INFO L388 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 [2021-11-23 02:35:47,291 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:35:47,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2021-11-23 02:35:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:47,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:35:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:53,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485665828] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:35:53,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:35:53,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 12 [2021-11-23 02:35:53,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595726669] [2021-11-23 02:35:53,943 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:35:53,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 02:35:53,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:35:53,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 02:35:53,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=119, Unknown=5, NotChecked=0, Total=156 [2021-11-23 02:35:53,945 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-23 02:35:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:35:54,007 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2021-11-23 02:35:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 02:35:54,008 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2021-11-23 02:35:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:35:54,010 INFO L225 Difference]: With dead ends: 44 [2021-11-23 02:35:54,010 INFO L226 Difference]: Without dead ends: 44 [2021-11-23 02:35:54,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=39, Invalid=138, Unknown=5, NotChecked=0, Total=182 [2021-11-23 02:35:54,011 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:35:54,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 75 Unchecked, 0.0s Time] [2021-11-23 02:35:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-23 02:35:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-11-23 02:35:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.3125) internal successors, (42), 35 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-23 02:35:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2021-11-23 02:35:54,020 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 17 [2021-11-23 02:35:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:35:54,020 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2021-11-23 02:35:54,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-23 02:35:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2021-11-23 02:35:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:35:54,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:35:54,022 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:35:54,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2021-11-23 02:35:54,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:35:54,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:35:54,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:35:54,624 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:35:54,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:35:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash -938120080, now seen corresponding path program 1 times [2021-11-23 02:35:54,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:35:54,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995228797] [2021-11-23 02:35:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:35:54,625 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:35:54,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:35:54,626 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:35:54,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-23 02:35:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:35:54,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:35:54,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:35:54,716 INFO L388 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 [2021-11-23 02:35:54,725 INFO L388 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 [2021-11-23 02:35:57,010 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:35:57,011 INFO L388 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 33 treesize of output 35 [2021-11-23 02:35:57,022 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:35:57,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2021-11-23 02:35:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:35:57,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:13,943 INFO L388 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 30 treesize of output 28 [2021-11-23 02:36:14,587 INFO L388 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 29 treesize of output 27 [2021-11-23 02:36:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:14,740 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:36:14,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995228797] [2021-11-23 02:36:14,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995228797] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:14,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1076705499] [2021-11-23 02:36:14,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:14,741 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:36:14,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:36:14,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:36:14,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-11-23 02:36:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:14,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:36:14,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:14,863 INFO L388 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 [2021-11-23 02:36:14,871 INFO L388 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 [2021-11-23 02:36:15,027 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:36:15,028 INFO L388 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 32 treesize of output 34 [2021-11-23 02:36:15,041 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:36:15,042 INFO L388 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 26 treesize of output 26 [2021-11-23 02:36:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:15,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:33,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| .cse0 (_ bv4 32)))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_49| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_49|)))) (exists ((|v_ldv_malloc_#res.base_40| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_36 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_40| v_ldv_malloc_~size_36) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| .cse1 (_ bv4 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_40|)))))))))) is different from false [2021-11-23 02:36:35,025 INFO L388 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 31 treesize of output 29 [2021-11-23 02:36:35,472 INFO L388 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 29 treesize of output 27 [2021-11-23 02:36:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-23 02:36:35,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1076705499] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:35,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095115062] [2021-11-23 02:36:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:35,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:35,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:35,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:35,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:36:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:35,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:36:35,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:35,586 INFO L388 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 [2021-11-23 02:36:35,594 INFO L388 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 [2021-11-23 02:36:35,805 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:36:35,806 INFO L388 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 32 treesize of output 34 [2021-11-23 02:36:35,822 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:36:35,822 INFO L388 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 26 treesize of output 26 [2021-11-23 02:36:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:35,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:14,744 INFO L388 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 30 treesize of output 28 [2021-11-23 02:37:15,283 INFO L388 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 30 treesize of output 28 [2021-11-23 02:37:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:37:15,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095115062] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:15,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:37:15,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 21 [2021-11-23 02:37:15,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61495114] [2021-11-23 02:37:15,320 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:15,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-23 02:37:15,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-23 02:37:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=347, Unknown=23, NotChecked=38, Total=462 [2021-11-23 02:37:15,322 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 22 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:37:17,921 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| .cse0 (_ bv4 32)))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_49| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_49|)))) (exists ((|v_ldv_malloc_#res.base_40| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_36 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_40| v_ldv_malloc_~size_36) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_4| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_4| .cse1 (_ bv4 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_40|)))))))))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-23 02:37:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:26,918 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2021-11-23 02:37:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 02:37:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 17 [2021-11-23 02:37:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:26,921 INFO L225 Difference]: With dead ends: 75 [2021-11-23 02:37:26,922 INFO L226 Difference]: Without dead ends: 75 [2021-11-23 02:37:26,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 73.9s TimeCoverageRelationStatistics Valid=100, Invalid=583, Unknown=27, NotChecked=102, Total=812 [2021-11-23 02:37:26,926 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:26,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 194 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 106 Invalid, 0 Unknown, 300 Unchecked, 0.4s Time] [2021-11-23 02:37:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-23 02:37:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2021-11-23 02:37:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-23 02:37:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2021-11-23 02:37:26,938 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 17 [2021-11-23 02:37:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:26,938 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2021-11-23 02:37:26,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:37:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2021-11-23 02:37:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:37:26,940 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:26,940 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:26,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:27,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:27,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:27,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:37:27,558 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:37:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:27,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1231523088, now seen corresponding path program 1 times [2021-11-23 02:37:27,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:27,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858564824] [2021-11-23 02:37:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:27,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:27,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:27,563 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:27,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-23 02:37:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:27,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-23 02:37:27,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:37:27,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:37:27,797 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:37:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858564824] [2021-11-23 02:37:27,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858564824] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:27,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:37:27,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-23 02:37:27,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329347608] [2021-11-23 02:37:27,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:37:27,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:37:27,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:27,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:37:27,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:37:27,799 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2021-11-23 02:37:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:27,837 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-11-23 02:37:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:37:27,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 17 [2021-11-23 02:37:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:27,839 INFO L225 Difference]: With dead ends: 44 [2021-11-23 02:37:27,839 INFO L226 Difference]: Without dead ends: 40 [2021-11-23 02:37:27,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:37:27,840 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:27,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:37:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-23 02:37:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-11-23 02:37:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:37:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-11-23 02:37:27,847 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 17 [2021-11-23 02:37:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:27,847 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-11-23 02:37:27,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2021-11-23 02:37:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-11-23 02:37:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 02:37:27,849 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:27,849 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:27,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:28,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:37:28,053 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:37:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -704273650, now seen corresponding path program 1 times [2021-11-23 02:37:28,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:28,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885254841] [2021-11-23 02:37:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:28,054 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:28,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:28,055 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:28,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-23 02:37:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:28,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:37:28,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:28,144 INFO L388 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 [2021-11-23 02:37:28,270 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 02:37:28,270 INFO L388 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 16 treesize of output 21 [2021-11-23 02:37:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:37:28,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:37:28,505 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:37:28,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885254841] [2021-11-23 02:37:28,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885254841] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:37:28,506 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:37:28,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 6 [2021-11-23 02:37:28,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961857543] [2021-11-23 02:37:28,506 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:37:28,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:37:28,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:28,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:37:28,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:37:28,508 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-23 02:37:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:28,591 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2021-11-23 02:37:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:37:28,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 26 [2021-11-23 02:37:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:28,594 INFO L225 Difference]: With dead ends: 45 [2021-11-23 02:37:28,595 INFO L226 Difference]: Without dead ends: 45 [2021-11-23 02:37:28,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:37:28,596 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:28,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2021-11-23 02:37:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-23 02:37:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2021-11-23 02:37:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-11-23 02:37:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-11-23 02:37:28,601 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-11-23 02:37:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:28,602 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-11-23 02:37:28,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-23 02:37:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-11-23 02:37:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 02:37:28,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:28,603 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:28,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:28,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:37:28,811 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:37:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -704273649, now seen corresponding path program 1 times [2021-11-23 02:37:28,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:28,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315228700] [2021-11-23 02:37:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:28,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:28,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:28,813 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:28,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-23 02:37:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:28,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-23 02:37:28,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:28,898 INFO L388 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 [2021-11-23 02:37:28,904 INFO L388 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 [2021-11-23 02:37:31,222 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:37:31,222 INFO L388 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 35 treesize of output 37 [2021-11-23 02:37:31,241 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:37:31,242 INFO L388 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 29 treesize of output 29 [2021-11-23 02:37:31,555 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:37:31,556 INFO L388 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 33 treesize of output 35 [2021-11-23 02:37:31,574 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:37:31,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2021-11-23 02:37:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:37:31,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:42,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ BitVec 32)) (|v_ldv_malloc_#res.base_82| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))))))) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) .cse0))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_82|)))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) .cse1))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_82| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17|)))))) is different from false [2021-11-23 02:37:44,136 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:37:44,137 INFO L388 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 47 treesize of output 46 [2021-11-23 02:37:58,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (or (and (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv8 32))))) (exists ((|v_ldv_malloc_#res.base_85| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv8 32))))) (exists ((v_ldv_malloc_~size_80 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_85| v_ldv_malloc_~size_80) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))))) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_85|)))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))) is different from false [2021-11-23 02:38:17,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_86|)))) (exists ((|v_ldv_malloc_#res.base_85| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv8 32))))) (exists ((v_ldv_malloc_~size_80 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_85| v_ldv_malloc_~size_80) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))))) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_85|)))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_86| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv8 32))))))) is different from false [2021-11-23 02:38:19,370 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_86|)))) (exists ((|v_ldv_malloc_#res.base_85| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv8 32))))) (exists ((v_ldv_malloc_~size_80 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_85| v_ldv_malloc_~size_80) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))))) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_85|)))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_86| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv8 32))))))) is different from true [2021-11-23 02:38:30,599 INFO L388 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 58 treesize of output 56 [2021-11-23 02:38:31,412 INFO L388 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 58 treesize of output 56 [2021-11-23 02:38:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-11-23 02:38:31,553 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:38:31,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315228700] [2021-11-23 02:38:31,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315228700] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:38:31,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [650769071] [2021-11-23 02:38:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:38:31,553 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:38:31,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:38:31,554 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:38:31,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-11-23 02:38:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:31,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-23 02:38:31,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:38:31,706 INFO L388 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 [2021-11-23 02:38:31,713 INFO L388 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 [2021-11-23 02:38:31,900 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:38:31,900 INFO L388 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 35 treesize of output 37 [2021-11-23 02:38:31,919 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:38:31,919 INFO L388 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 29 treesize of output 29 [2021-11-23 02:38:32,074 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:38:32,075 INFO L388 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 32 treesize of output 34 [2021-11-23 02:38:32,088 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:38:32,088 INFO L388 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 26 treesize of output 26 [2021-11-23 02:38:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:38:32,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:39:03,193 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:39:03,193 INFO L388 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 47 treesize of output 46 [2021-11-23 02:39:22,186 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse0))) (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (exists ((|v_ldv_malloc_#res.base_97| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_97|))))) (or (exists ((v_ldv_malloc_~size_92 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_97| v_ldv_malloc_~size_92) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse1))))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|))) is different from false [2021-11-23 02:39:41,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ldv_malloc_#res.base_98| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_98|)))) (exists ((|v_ldv_malloc_#res.base_97| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_97|))))) (or (exists ((v_ldv_malloc_~size_92 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_97| v_ldv_malloc_~size_92) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse0))))))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse1))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_98| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|))) is different from false [2021-11-23 02:39:54,913 INFO L388 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 61 treesize of output 59 [2021-11-23 02:39:57,511 INFO L388 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 55 treesize of output 53 [2021-11-23 02:39:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-23 02:39:57,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [650769071] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:39:57,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659484123] [2021-11-23 02:39:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:39:57,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:39:57,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:39:57,536 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:39:57,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 02:39:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:39:57,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-23 02:39:57,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:39:57,618 INFO L388 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 [2021-11-23 02:39:57,627 INFO L388 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 [2021-11-23 02:39:57,819 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:39:57,820 INFO L388 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 35 treesize of output 37 [2021-11-23 02:39:57,837 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:39:57,837 INFO L388 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 29 treesize of output 29 [2021-11-23 02:39:58,036 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:39:58,037 INFO L388 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 33 treesize of output 35 [2021-11-23 02:39:58,058 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:39:58,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2021-11-23 02:39:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:39:58,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:40:18,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ BitVec 32)) (|v_ldv_malloc_#res.base_106| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_106|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_106| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse0 (_ bv4 32))))) (exists ((|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))))))) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse1 (_ bv4 32)))))))))) is different from false [2021-11-23 02:40:20,643 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:40:20,643 INFO L388 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 47 treesize of output 46 [2021-11-23 02:40:41,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26| (_ BitVec 32))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (or (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (and (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (bvule .cse0 (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((|v_ldv_malloc_#res.base_109| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (v_ldv_malloc_~size_104 (_ BitVec 32))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse2 (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (and (bvule .cse2 (select (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (or (not (bvule .cse2 (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_109|)))))))))))))) is different from false [2021-11-23 02:41:15,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ldv_malloc_#res.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26| (_ BitVec 32))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (or (not (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#res.base_110| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_110|))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|) (and (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_110| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (bvule .cse0 (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((|v_ldv_malloc_#res.base_109| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (v_ldv_malloc_~size_104 (_ BitVec 32))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse2 (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (and (bvule .cse2 (select (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (or (not (bvule .cse2 (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_109|)))))))))))))) is different from false [2021-11-23 02:41:42,273 INFO L388 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 79 treesize of output 77 [2021-11-23 02:41:44,928 INFO L388 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 74 treesize of output 72 [2021-11-23 02:41:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-11-23 02:41:45,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659484123] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:41:45,312 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:41:45,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11, 14, 11, 14] total 40 [2021-11-23 02:41:45,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105560562] [2021-11-23 02:41:45,313 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:41:45,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-23 02:41:45,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:41:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-23 02:41:45,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=919, Unknown=44, NotChecked=552, Total=1640 [2021-11-23 02:41:45,316 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 41 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 37 states have internal predecessors, (60), 9 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2021-11-23 02:41:55,849 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_86|)))) (exists ((|v_ldv_malloc_#res.base_85| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv8 32))))) (exists ((v_ldv_malloc_~size_80 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_85| v_ldv_malloc_~size_80) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))))) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_85|)))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_86| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv8 32))))))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ BitVec 32)) (|v_ldv_malloc_#res.base_82| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))))))) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) .cse2))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_82|)))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_82| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17|)))))) (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ldv_malloc_#res.base_98| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_98|)))) (exists ((|v_ldv_malloc_#res.base_97| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_97|))))) (or (exists ((v_ldv_malloc_~size_92 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_97| v_ldv_malloc_~size_92) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (not (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse4))))))) (and (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse5))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_98| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|))) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ldv_malloc_#res.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26| (_ BitVec 32))) (let ((.cse7 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse6 (bvadd .cse7 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (or (not (bvule .cse6 (select (store |c_#length| |v_ldv_malloc_#res.base_110| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_110|))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|) (and (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_110| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (bvule .cse6 (bvadd .cse7 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((|v_ldv_malloc_#res.base_109| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (v_ldv_malloc_~size_104 (_ BitVec 32))) (let ((.cse9 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse8 (bvadd .cse9 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (and (bvule .cse8 (select (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (or (not (bvule .cse8 (bvadd .cse9 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_109|)))))))))))))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ BitVec 32)) (|v_ldv_malloc_#res.base_106| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_106|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_106| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (let ((.cse10 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse10) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse10 (_ bv4 32))))) (exists ((|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))))))) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)))) (not (let ((.cse11 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse11) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse11 (_ bv4 32))))))))))) is different from false [2021-11-23 02:41:57,953 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_86|)))) (exists ((|v_ldv_malloc_#res.base_85| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse0 (_ bv8 32))))) (exists ((v_ldv_malloc_~size_80 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_85| v_ldv_malloc_~size_80) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))))) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_85|)))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_86| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse1 (_ bv8 32))))))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ BitVec 32)) (|v_ldv_malloc_#res.base_82| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))))))) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) .cse2))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_82|)))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_82| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17|)))))) (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ldv_malloc_#res.base_98| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_98|)))) (exists ((|v_ldv_malloc_#res.base_97| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_97|))))) (or (exists ((v_ldv_malloc_~size_92 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_97| v_ldv_malloc_~size_92) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (not (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse4))))))) (and (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse5))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_98| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ldv_malloc_#res.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26| (_ BitVec 32))) (let ((.cse7 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse6 (bvadd .cse7 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (or (not (bvule .cse6 (select (store |c_#length| |v_ldv_malloc_#res.base_110| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_110|))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|) (and (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_110| ldv_malloc_~size) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (bvule .cse6 (bvadd .cse7 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((|v_ldv_malloc_#res.base_109| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (v_ldv_malloc_~size_104 (_ BitVec 32))) (let ((.cse9 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse8 (bvadd .cse9 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (and (bvule .cse8 (select (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (or (not (bvule .cse8 (bvadd .cse9 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_109|)))))))))))))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ BitVec 32)) (|v_ldv_malloc_#res.base_106| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_106|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_106| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (let ((.cse10 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse10) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse10 (_ bv4 32))))) (exists ((|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))))))) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)))) (not (let ((.cse11 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse11) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse11 (_ bv4 32))))))))))) is different from false [2021-11-23 02:42:00,052 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26| (_ BitVec 32))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (or (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (and (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (bvule .cse0 (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((|v_ldv_malloc_#res.base_109| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (v_ldv_malloc_~size_104 (_ BitVec 32))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)))) (let ((.cse2 (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv4 32)))) (and (bvule .cse2 (select (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (or (not (bvule .cse2 (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)))) (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_18| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_18| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_109| v_ldv_malloc_~size_104) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_109|)))))))))))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |ldv_malloc_#res.base|)))))))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ BitVec 32))) (or (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse4))) (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (exists ((|v_ldv_malloc_#res.base_97| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_97|))))) (or (exists ((v_ldv_malloc_~size_92 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_97| v_ldv_malloc_~size_92) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|)))) (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_14| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv4 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_14| (_ bv8 32) .cse5))))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_22|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (or (and (forall ((v_ldv_malloc_~size_76 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))) (let ((.cse6 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse6 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse6 (_ bv8 32))))) (exists ((|v_ldv_malloc_#res.base_85| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (or (not (let ((.cse7 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse7 (_ bv4 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| .cse7 (_ bv8 32))))) (exists ((v_ldv_malloc_~size_80 (_ BitVec 32)) (v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_10| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_10| (_ bv4 32)) (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_85| v_ldv_malloc_~size_80) |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|))))) (not (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_85|)))))) (= |v_ldv_malloc_#res.base_81| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_18|)))) is different from false [2021-11-23 02:42:09,249 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ BitVec 32)) (|v_ldv_malloc_#res.base_82| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))))))) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) .cse0))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_82|)))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) .cse1))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_9| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_9| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_82| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_17|)))))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ BitVec 32)) (|v_ldv_malloc_#res.base_106| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_106|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_106| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse2 (_ bv4 32))))) (exists ((|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))))))) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)))) (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_17| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_17| .cse3 (_ bv4 32))))))))))) is different from false [2021-11-23 02:42:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:42,517 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2021-11-23 02:42:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-23 02:42:42,518 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 37 states have internal predecessors, (60), 9 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 26 [2021-11-23 02:42:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:42,519 INFO L225 Difference]: With dead ends: 64 [2021-11-23 02:42:42,519 INFO L226 Difference]: Without dead ends: 64 [2021-11-23 02:42:42,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 104 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 167.1s TimeCoverageRelationStatistics Valid=155, Invalid=1099, Unknown=54, NotChecked=948, Total=2256 [2021-11-23 02:42:42,522 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:42,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 188 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 410 Unchecked, 0.3s Time] [2021-11-23 02:42:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-23 02:42:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2021-11-23 02:42:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 49 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 9 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-23 02:42:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2021-11-23 02:42:42,531 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 26 [2021-11-23 02:42:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:42,531 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2021-11-23 02:42:42,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 37 states have internal predecessors, (60), 9 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2021-11-23 02:42:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2021-11-23 02:42:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 02:42:42,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:42,533 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:42,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:42,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:42,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-11-23 02:42:43,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:43,139 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:42:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1209832274, now seen corresponding path program 1 times [2021-11-23 02:42:43,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:42:43,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143629134] [2021-11-23 02:42:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:43,140 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:42:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:42:43,141 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:42:43,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-23 02:42:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:43,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:42:43,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:43,238 INFO L388 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 [2021-11-23 02:42:43,250 INFO L388 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 [2021-11-23 02:42:45,865 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:42:45,866 INFO L388 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 31 treesize of output 33 [2021-11-23 02:42:45,884 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:42:45,884 INFO L388 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 25 treesize of output 25 [2021-11-23 02:42:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:42:45,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:43:22,742 INFO L388 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 29 treesize of output 27 [2021-11-23 02:43:23,572 INFO L388 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 28 treesize of output 26 [2021-11-23 02:43:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:43:23,852 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:43:23,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143629134] [2021-11-23 02:43:23,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143629134] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:43:23,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1029634094] [2021-11-23 02:43:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:43:23,853 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:43:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:43:23,854 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:43:23,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-11-23 02:43:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:43:23,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:43:23,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:43:23,993 INFO L388 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 [2021-11-23 02:43:24,002 INFO L388 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 [2021-11-23 02:43:24,413 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:43:24,413 INFO L388 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 32 treesize of output 34 [2021-11-23 02:43:24,432 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:43:24,432 INFO L388 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 26 treesize of output 26 [2021-11-23 02:43:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:43:24,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:43:45,937 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_130| (_ BitVec 32))) (or (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_130| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ bv4 32) .cse0)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_130|)))) (exists ((|v_ldv_malloc_#res.base_117| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_117|)))) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ bv4 32) .cse1)))) (exists ((v_ldv_malloc_~size_112 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_117| v_ldv_malloc_~size_112) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))))) is different from false [2021-11-23 02:43:52,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ BitVec 32)) (|v_ldv_malloc_#res.base_117| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_26| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_26| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_26| (_ bv8 32) .cse0))) (forall ((v_ldv_malloc_~size_112 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_26| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_117| v_ldv_malloc_~size_112) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_117|)))) (exists ((|v_ldv_malloc_#res.base_117| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_117|)))) (or (exists ((v_ldv_malloc_~size_112 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_26| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_117| v_ldv_malloc_~size_112) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_26| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_26| (_ bv8 32) .cse1))))))))) is different from false [2021-11-23 02:43:56,668 INFO L388 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 31 treesize of output 29 [2021-11-23 02:43:57,373 INFO L388 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 27 treesize of output 25 [2021-11-23 02:43:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-11-23 02:43:57,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1029634094] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:43:57,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592735095] [2021-11-23 02:43:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:43:57,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:43:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:43:57,403 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:43:57,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 02:43:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:43:57,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:43:57,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:43:57,495 INFO L388 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 [2021-11-23 02:43:57,507 INFO L388 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 [2021-11-23 02:43:57,937 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:43:57,937 INFO L388 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 31 treesize of output 33 [2021-11-23 02:43:57,960 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:43:57,961 INFO L388 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 25 treesize of output 25 [2021-11-23 02:43:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:43:57,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:44:47,872 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_ldv_malloc_#res.base_117| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_30| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_117|)))) (and (forall ((v_ldv_malloc_~size_112 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_30| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_117| v_ldv_malloc_~size_112) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_30| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv8 32) .cse0)))) (exists ((|v_ldv_malloc_#res.base_117| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_117|)))) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_30| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_112 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_30| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_117| v_ldv_malloc_~size_112) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))))))))) is different from false [2021-11-23 02:44:52,847 INFO L388 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 29 treesize of output 27 [2021-11-23 02:44:53,625 INFO L388 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 28 treesize of output 26 [2021-11-23 02:44:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-23 02:44:53,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592735095] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:44:53,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:44:53,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 11, 10, 11] total 26 [2021-11-23 02:44:53,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176260936] [2021-11-23 02:44:53,656 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:44:53,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-23 02:44:53,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:44:53,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-23 02:44:53,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=458, Unknown=37, NotChecked=138, Total=702 [2021-11-23 02:44:53,658 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 27 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-23 02:46:13,400 WARN L227 SmtUtils]: Spent 10.42s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:46:15,433 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_130| (_ BitVec 32))) (or (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_130| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ bv4 32) .cse0)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_130|)))) (exists ((|v_ldv_malloc_#res.base_117| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_117|)))) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ bv4 32) .cse1)))) (exists ((v_ldv_malloc_~size_112 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_25| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_117| v_ldv_malloc_~size_112) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))))) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_29| (_ BitVec 32)) (|v_ldv_malloc_#res.base_118| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_21| (_ BitVec 32))) (or (and (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_21| (_ bv4 32)))) (bvule (bvadd .cse2 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21|) (bvadd .cse2 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32)))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_21| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_118| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_29|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_118|))))) (exists ((|v_ldv_malloc_#res.base_117| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_112 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_21| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_117| v_ldv_malloc_~size_112) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_29|)))) (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_21| (_ bv4 32)))) (bvule (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21|) (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32)))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_117|)))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_29| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32)) (|v_ldv_malloc_#res.base_142| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_142|))))))) (exists ((|v_ldv_malloc_#res.base_117| (_ BitVec 32))) (and (or (not (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_29| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv4 32) .cse4)))) (exists ((v_ldv_malloc_~size_112 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_29| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_117| v_ldv_malloc_~size_112) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_117|)))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_29| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_142| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_29| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv4 32) .cse5))))))) is different from false [2021-11-23 02:46:41,492 WARN L227 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:46:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:46:41,509 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2021-11-23 02:46:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-23 02:46:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 26 [2021-11-23 02:46:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:46:41,512 INFO L225 Difference]: With dead ends: 85 [2021-11-23 02:46:41,512 INFO L226 Difference]: Without dead ends: 85 [2021-11-23 02:46:41,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 119 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 196.1s TimeCoverageRelationStatistics Valid=150, Invalid=924, Unknown=64, NotChecked=268, Total=1406 [2021-11-23 02:46:41,513 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:46:41,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 262 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 0 Unknown, 469 Unchecked, 0.5s Time] [2021-11-23 02:46:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-23 02:46:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2021-11-23 02:46:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 7 states have call successors, (7), 6 states have call predecessors, (7), 10 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-23 02:46:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2021-11-23 02:46:41,525 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2021-11-23 02:46:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:46:41,526 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2021-11-23 02:46:41,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-23 02:46:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2021-11-23 02:46:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 02:46:41,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:46:41,528 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:46:41,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2021-11-23 02:46:41,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:46:41,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-23 02:46:42,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:46:42,131 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:46:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:46:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1161906918, now seen corresponding path program 1 times [2021-11-23 02:46:42,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:46:42,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792547394] [2021-11-23 02:46:42,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:46:42,132 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:46:42,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:46:42,134 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:46:42,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-23 02:46:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:46:42,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:46:42,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:46:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:46:42,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:46:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:46:42,721 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:46:42,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792547394] [2021-11-23 02:46:42,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792547394] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:46:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1283508176] [2021-11-23 02:46:42,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:46:42,722 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:46:42,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:46:42,723 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:46:42,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-11-23 02:46:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:46:42,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:46:42,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:46:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:46:43,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:46:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:46:43,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1283508176] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:46:43,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965376104] [2021-11-23 02:46:43,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:46:43,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:46:43,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:46:43,136 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:46:43,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-23 02:46:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:46:43,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:46:43,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:46:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:46:43,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:46:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:46:43,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965376104] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:46:43,550 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:46:43,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2021-11-23 02:46:43,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722747079] [2021-11-23 02:46:43,551 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:46:43,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:46:43,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:46:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:46:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:46:43,553 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-23 02:46:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:46:43,934 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2021-11-23 02:46:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:46:43,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2021-11-23 02:46:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:46:43,936 INFO L225 Difference]: With dead ends: 92 [2021-11-23 02:46:43,936 INFO L226 Difference]: Without dead ends: 92 [2021-11-23 02:46:43,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:46:43,938 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:46:43,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 87 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:46:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-23 02:46:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2021-11-23 02:46:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2021-11-23 02:46:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2021-11-23 02:46:43,953 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 30 [2021-11-23 02:46:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:46:43,954 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2021-11-23 02:46:43,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-23 02:46:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2021-11-23 02:46:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 02:46:43,956 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:46:43,957 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:46:43,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-11-23 02:46:44,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-23 02:46:44,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2021-11-23 02:46:44,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:46:44,569 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-23 02:46:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:46:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1382185263, now seen corresponding path program 2 times [2021-11-23 02:46:44,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:46:44,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541871399] [2021-11-23 02:46:44,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 02:46:44,570 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:46:44,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:46:44,572 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:46:44,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-23 02:46:44,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 02:46:44,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:46:44,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 02:46:44,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:46:44,715 INFO L388 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 [2021-11-23 02:46:44,730 INFO L388 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 [2021-11-23 02:46:47,201 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:46:47,201 INFO L388 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 32 treesize of output 34 [2021-11-23 02:46:47,222 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:46:47,223 INFO L388 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 26 treesize of output 26 [2021-11-23 02:46:47,555 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:46:47,555 INFO L388 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 35 treesize of output 37 [2021-11-23 02:46:47,578 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:46:47,578 INFO L388 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 29 treesize of output 29 [2021-11-23 02:46:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 26 refuted. 4 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:46:49,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:47:16,092 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:47:16,092 INFO L388 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 47 treesize of output 46 [2021-11-23 02:47:54,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_189| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_48| (_ BitVec 32)) (|v_ldv_malloc_#res.base_184| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_44| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_48| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse0 (_ bv12 32)))) (forall ((v_ldv_malloc_~size_179 (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_48| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_189| ldv_malloc_~size) |v_ldv_malloc_#res.base_184| v_ldv_malloc_~size_179) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_44|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_44| |v_ldv_malloc_#res.base_184|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_189|)))) (exists ((|v_ldv_malloc_#res.base_184| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_184|)))))) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_48| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse1 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_179 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_48| (_ bv4 32)) (_ bv12 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_184| v_ldv_malloc_~size_179) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_44|))))))))) is different from false [2021-11-23 02:48:01,540 INFO L388 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 31 treesize of output 29 [2021-11-23 02:48:02,613 INFO L388 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 29 treesize of output 27 [2021-11-23 02:48:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 25 refuted. 4 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-23 02:48:02,901 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:48:02,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541871399] [2021-11-23 02:48:02,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541871399] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:48:02,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1711630151] [2021-11-23 02:48:02,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 02:48:02,902 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:48:02,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:48:02,904 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:48:02,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32f94049-90db-4407-8079-4133de990ef1/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-11-23 02:48:03,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 02:48:03,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:48:03,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 02:48:03,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:48:03,101 INFO L388 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 [2021-11-23 02:48:03,116 INFO L388 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 [2021-11-23 02:48:03,377 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:48:03,377 INFO L388 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 31 treesize of output 33 [2021-11-23 02:48:03,397 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:48:03,397 INFO L388 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 25 treesize of output 25 [2021-11-23 02:48:03,630 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:48:03,631 INFO L388 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 32 treesize of output 34 [2021-11-23 02:48:03,656 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:48:03,657 INFO L388 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 26 treesize of output 26 [2021-11-23 02:48:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 26 refuted. 4 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:48:03,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:48:41,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_201| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_41| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_49| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_201|)))) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_41| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_41| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_41| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_201| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_49|)))) (exists ((|v_ldv_malloc_#res.base_184| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_41| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_41| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_179 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_41| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_184| v_ldv_malloc_~size_179) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_49|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_184|))))))))))) is different from false [2021-11-23 02:48:43,548 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:48:43,549 INFO L388 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 47 treesize of output 46 [2021-11-23 02:49:02,137 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_42| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_50| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ldv_malloc_#res.base_184| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_50| |v_ldv_malloc_#res.base_184|) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_42| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_42| .cse0 (_ bv12 32)))) (forall ((v_ldv_malloc_~size_179 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_42| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_184| v_ldv_malloc_~size_179) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_50|)))) (exists ((|v_ldv_malloc_#res.base_204| (_ BitVec 32)) (|v_ldv_malloc_#res.base_184| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_50| |v_ldv_malloc_#res.base_184|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_204|))))))) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_42| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_42| .cse1 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_179 (_ BitVec 32)) (v_ldv_malloc_~size_199 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_42| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_204| v_ldv_malloc_~size_199) |v_ldv_malloc_#res.base_184| v_ldv_malloc_~size_179) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_50|))))))))) is different from false