./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:58:50,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:58:50,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:58:50,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:58:50,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:58:50,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:58:50,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:58:50,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:58:50,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:58:50,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:58:50,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:58:50,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:58:50,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:58:50,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:58:50,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:58:50,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:58:50,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:58:50,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:58:50,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:58:50,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:58:50,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:58:50,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:58:50,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:58:50,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:58:50,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:58:50,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:58:50,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:58:50,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:58:50,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:58:50,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:58:50,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:58:50,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:58:50,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:58:50,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:58:50,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:58:50,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:58:50,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:58:50,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:58:50,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:58:50,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:58:50,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:58:50,341 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-20 05:58:50,365 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:58:50,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:58:50,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:58:50,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:58:50,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 05:58:50,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 05:58:50,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:58:50,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:58:50,368 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:58:50,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:58:50,369 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 05:58:50,369 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 05:58:50,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:58:50,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 05:58:50,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:58:50,370 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 05:58:50,370 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 05:58:50,370 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 05:58:50,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 05:58:50,370 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 05:58:50,370 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 05:58:50,371 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:58:50,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:58:50,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:58:50,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 05:58:50,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:58:50,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:58:50,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 05:58:50,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 05:58:50,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 05:58:50,373 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:58:50,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/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_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF 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 -> Automizer 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-20 05:58:50,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:58:50,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:58:50,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:58:50,667 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:58:50,668 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:58:50,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2021-11-20 05:58:50,749 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data/9b7d21bf7/e4372212b68f441492a4443480dba094/FLAG969fc54e0 [2021-11-20 05:58:51,483 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:58:51,485 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2021-11-20 05:58:51,512 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data/9b7d21bf7/e4372212b68f441492a4443480dba094/FLAG969fc54e0 [2021-11-20 05:58:51,527 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data/9b7d21bf7/e4372212b68f441492a4443480dba094 [2021-11-20 05:58:51,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:58:51,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:58:51,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:58:51,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:58:51,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:58:51,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:58:51" (1/1) ... [2021-11-20 05:58:51,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b95e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:51, skipping insertion in model container [2021-11-20 05:58:51,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:58:51" (1/1) ... [2021-11-20 05:58:51,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:58:51,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:58:52,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:58:52,169 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-20 05:58:52,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@34b75033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:52, skipping insertion in model container [2021-11-20 05:58:52,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:58:52,171 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-20 05:58:52,174 INFO L158 Benchmark]: Toolchain (without parser) took 639.41ms. Allocated memory is still 113.2MB. Free memory was 68.8MB in the beginning and 81.9MB in the end (delta: -13.1MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2021-11-20 05:58:52,174 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:58:52,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.19ms. Allocated memory is still 113.2MB. Free memory was 68.6MB in the beginning and 81.9MB in the end (delta: -13.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2021-11-20 05:58:52,178 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.19ms. Allocated memory is still 113.2MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.19ms. Allocated memory is still 113.2MB. Free memory was 68.6MB in the beginning and 81.9MB in the end (delta: -13.4MB). Peak memory consumption was 6.5MB. 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_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:58:54,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:58:54,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:58:54,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:58:54,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:58:54,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:58:54,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:58:54,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:58:54,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:58:54,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:58:54,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:58:54,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:58:54,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:58:54,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:58:54,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:58:54,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:58:54,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:58:54,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:58:54,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:58:54,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:58:54,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:58:54,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:58:54,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:58:54,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:58:54,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:58:54,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:58:54,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:58:54,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:58:54,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:58:54,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:58:54,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:58:54,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:58:54,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:58:54,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:58:54,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:58:54,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:58:54,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:58:54,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:58:54,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:58:54,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:58:54,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:58:54,614 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-11-20 05:58:54,642 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:58:54,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:58:54,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:58:54,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:58:54,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 05:58:54,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 05:58:54,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:58:54,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:58:54,645 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:58:54,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:58:54,646 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 05:58:54,646 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 05:58:54,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:58:54,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 05:58:54,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:58:54,647 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 05:58:54,647 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 05:58:54,647 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 05:58:54,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 05:58:54,648 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 05:58:54,648 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 05:58:54,648 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 05:58:54,649 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 05:58:54,649 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:58:54,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:58:54,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:58:54,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 05:58:54,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:58:54,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:58:54,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 05:58:54,651 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-20 05:58:54,651 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 05:58:54,651 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:58:54,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 05:58:54,652 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_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/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_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF 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 -> Automizer 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-20 05:58:54,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:58:55,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:58:55,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:58:55,027 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:58:55,028 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:58:55,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2021-11-20 05:58:55,123 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data/db73b3b4c/72f4281d901a4c408aecfc13df1cb120/FLAGb091e23fd [2021-11-20 05:58:55,856 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:58:55,856 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2021-11-20 05:58:55,879 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data/db73b3b4c/72f4281d901a4c408aecfc13df1cb120/FLAGb091e23fd [2021-11-20 05:58:56,094 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/data/db73b3b4c/72f4281d901a4c408aecfc13df1cb120 [2021-11-20 05:58:56,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:58:56,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:58:56,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:58:56,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:58:56,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:58:56,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:56,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fca0d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56, skipping insertion in model container [2021-11-20 05:58:56,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:56,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:58:56,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:58:56,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:58:56,690 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-20 05:58:56,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:58:56,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:58:56,824 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 05:58:56,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:58:56,934 INFO L208 MainTranslator]: Completed translation [2021-11-20 05:58:56,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56 WrapperNode [2021-11-20 05:58:56,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:58:56,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 05:58:56,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 05:58:56,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 05:58:56,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:56,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:56,997 INFO L137 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 31 [2021-11-20 05:58:56,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 05:58:56,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 05:58:56,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 05:58:56,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 05:58:57,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:57,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:57,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:57,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:57,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:57,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:57,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:57,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 05:58:57,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 05:58:57,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 05:58:57,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 05:58:57,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (1/1) ... [2021-11-20 05:58:57,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:58:57,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:58:57,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 05:58:57,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 05:58:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-20 05:58:57,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-20 05:58:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 05:58:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 05:58:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 05:58:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 05:58:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 05:58:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 05:58:57,297 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 05:58:57,298 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 05:58:57,467 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 05:58:57,476 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 05:58:57,477 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 05:58:57,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:58:57 BoogieIcfgContainer [2021-11-20 05:58:57,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 05:58:57,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 05:58:57,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 05:58:57,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 05:58:57,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:58:56" (1/3) ... [2021-11-20 05:58:57,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b64409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:58:57, skipping insertion in model container [2021-11-20 05:58:57,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:58:56" (2/3) ... [2021-11-20 05:58:57,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b64409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:58:57, skipping insertion in model container [2021-11-20 05:58:57,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:58:57" (3/3) ... [2021-11-20 05:58:57,500 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3.i [2021-11-20 05:58:57,510 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 05:58:57,512 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-20 05:58:57,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 05:58:57,564 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-20 05:58:57,564 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-20 05:58:57,578 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-20 05:58:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 05:58:57,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:58:57,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:58:57,590 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 05:58:57,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:58:57,596 INFO L85 PathProgramCache]: Analyzing trace with hash -74700687, now seen corresponding path program 1 times [2021-11-20 05:58:57,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 05:58:57,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430599992] [2021-11-20 05:58:57,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:58:57,609 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 05:58:57,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 05:58:57,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 05:58:57,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 05:58:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:58:57,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 05:58:57,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:58:57,896 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-20 05:58:57,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:58:57,974 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-20 05:58:57,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 05:58:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430599992] [2021-11-20 05:58:57,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430599992] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 05:58:57,975 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:58:57,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-20 05:58:57,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504631201] [2021-11-20 05:58:57,978 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 05:58:57,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:58:57,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 05:58:58,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:58:58,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:58:58,012 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-20 05:58:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:58:58,097 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2021-11-20 05:58:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 05:58:58,100 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-20 05:58:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:58:58,108 INFO L225 Difference]: With dead ends: 37 [2021-11-20 05:58:58,108 INFO L226 Difference]: Without dead ends: 33 [2021-11-20 05:58:58,110 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-20 05:58:58,114 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-20 05:58:58,115 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-20 05:58:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-11-20 05:58:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2021-11-20 05:58:58,152 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-20 05:58:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-11-20 05:58:58,155 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 11 [2021-11-20 05:58:58,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:58:58,155 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-20 05:58:58,155 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-20 05:58:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-11-20 05:58:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 05:58:58,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:58:58,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:58:58,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 05:58:58,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 05:58:58,369 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 05:58:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:58:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash 812802994, now seen corresponding path program 1 times [2021-11-20 05:58:58,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 05:58:58,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475977868] [2021-11-20 05:58:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:58:58,374 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 05:58:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 05:58:58,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 05:58:58,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 05:58:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:58:58,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 05:58:58,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:58:58,515 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-20 05:58:58,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:58:58,570 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-20 05:58:58,571 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 05:58:58,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475977868] [2021-11-20 05:58:58,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475977868] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 05:58:58,572 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:58:58,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-20 05:58:58,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10625103] [2021-11-20 05:58:58,572 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 05:58:58,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 05:58:58,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 05:58:58,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 05:58:58,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 05:58:58,576 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-20 05:58:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:58:58,662 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-11-20 05:58:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 05:58:58,666 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-20 05:58:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:58:58,667 INFO L225 Difference]: With dead ends: 32 [2021-11-20 05:58:58,667 INFO L226 Difference]: Without dead ends: 30 [2021-11-20 05:58:58,668 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-20 05:58:58,670 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-20 05:58:58,672 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-20 05:58:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-20 05:58:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-11-20 05:58:58,681 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-20 05:58:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-11-20 05:58:58,682 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2021-11-20 05:58:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:58:58,683 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-11-20 05:58:58,683 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-20 05:58:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-11-20 05:58:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 05:58:58,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:58:58,684 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:58:58,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-20 05:58:58,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 05:58:58,895 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 05:58:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:58:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1979292102, now seen corresponding path program 1 times [2021-11-20 05:58:58,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 05:58:58,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284568327] [2021-11-20 05:58:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:58:58,897 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 05:58:58,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 05:58:58,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 05:58:58,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 05:58:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:58:58,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 05:58:58,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:58:59,072 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-20 05:58:59,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:58:59,135 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-20 05:58:59,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 05:58:59,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284568327] [2021-11-20 05:58:59,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284568327] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 05:58:59,136 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:58:59,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-20 05:58:59,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17699386] [2021-11-20 05:58:59,146 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 05:58:59,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:58:59,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 05:58:59,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:58:59,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:58:59,148 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-20 05:58:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:58:59,238 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2021-11-20 05:58:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 05:58:59,239 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-20 05:58:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:58:59,243 INFO L225 Difference]: With dead ends: 42 [2021-11-20 05:58:59,243 INFO L226 Difference]: Without dead ends: 42 [2021-11-20 05:58:59,244 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-20 05:58:59,250 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-20 05:58:59,251 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-20 05:58:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-20 05:58:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-11-20 05:58:59,259 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-20 05:58:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2021-11-20 05:58:59,260 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 12 [2021-11-20 05:58:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:58:59,261 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2021-11-20 05:58:59,261 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-20 05:58:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2021-11-20 05:58:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 05:58:59,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:58:59,265 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:58:59,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-20 05:58:59,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 05:58:59,477 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 05:58:59,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:58:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash -938120081, now seen corresponding path program 1 times [2021-11-20 05:58:59,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 05:58:59,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141898345] [2021-11-20 05:58:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:58:59,479 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 05:58:59,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 05:58:59,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 05:58:59,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 05:58:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:58:59,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 05:58:59,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:58:59,599 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-20 05:58:59,780 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 05:58:59,781 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-20 05:58:59,873 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-20 05:58:59,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:59:12,590 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-20 05:59:12,591 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 05:59:12,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141898345] [2021-11-20 05:59:12,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141898345] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:59:12,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 05:59:12,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-11-20 05:59:12,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003453814] [2021-11-20 05:59:12,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 05:59:12,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 05:59:12,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 05:59:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 05:59:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=118, Unknown=6, NotChecked=0, Total=156 [2021-11-20 05:59:12,594 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-20 05:59:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:59:12,664 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2021-11-20 05:59:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 05:59:12,665 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-20 05:59:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:59:12,666 INFO L225 Difference]: With dead ends: 44 [2021-11-20 05:59:12,667 INFO L226 Difference]: Without dead ends: 44 [2021-11-20 05:59:12,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=39, Invalid=137, Unknown=6, NotChecked=0, Total=182 [2021-11-20 05:59:12,668 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-20 05:59:12,668 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-20 05:59:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-20 05:59:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-11-20 05:59:12,677 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-20 05:59:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2021-11-20 05:59:12,678 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 17 [2021-11-20 05:59:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:59:12,679 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2021-11-20 05:59:12,679 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-20 05:59:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2021-11-20 05:59:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 05:59:12,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:59:12,681 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:59:12,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-20 05:59:12,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 05:59:12,892 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 05:59:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:59:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -938120080, now seen corresponding path program 1 times [2021-11-20 05:59:12,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 05:59:12,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242963327] [2021-11-20 05:59:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:59:12,894 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 05:59:12,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 05:59:12,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 05:59:12,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-20 05:59:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:59:12,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 05:59:12,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:59:12,991 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-20 05:59:12,996 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-20 05:59:15,319 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 05:59:15,320 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 29 treesize of output 31 [2021-11-20 05:59:15,332 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 05:59:15,332 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 23 treesize of output 23 [2021-11-20 05:59:15,390 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-20 05:59:15,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:59:32,541 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-20 05:59:33,102 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-20 05:59:33,271 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-20 05:59:33,271 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 05:59:33,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242963327] [2021-11-20 05:59:33,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242963327] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:59:33,272 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 05:59:33,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-11-20 05:59:33,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133295345] [2021-11-20 05:59:33,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 05:59:33,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 05:59:33,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 05:59:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 05:59:33,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=257, Unknown=6, NotChecked=0, Total=306 [2021-11-20 05:59:33,274 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 18 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:59:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:59:36,039 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2021-11-20 05:59:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 05:59:36,040 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2021-11-20 05:59:36,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:59:36,041 INFO L225 Difference]: With dead ends: 54 [2021-11-20 05:59:36,041 INFO L226 Difference]: Without dead ends: 54 [2021-11-20 05:59:36,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=62, Invalid=352, Unknown=6, NotChecked=0, Total=420 [2021-11-20 05:59:36,042 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 05:59:36,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 150 Invalid, 0 Unknown, 139 Unchecked, 0.4s Time] [2021-11-20 05:59:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-20 05:59:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2021-11-20 05:59:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 39 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 05:59:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2021-11-20 05:59:36,057 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 17 [2021-11-20 05:59:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:59:36,057 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-11-20 05:59:36,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:59:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2021-11-20 05:59:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 05:59:36,059 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:59:36,059 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:59:36,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-20 05:59:36,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 05:59:36,271 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 05:59:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:59:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1231523088, now seen corresponding path program 1 times [2021-11-20 05:59:36,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 05:59:36,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990826770] [2021-11-20 05:59:36,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:59:36,272 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 05:59:36,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 05:59:36,273 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 05:59:36,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-20 05:59:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:59:36,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 05:59:36,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:59:36,397 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-20 05:59:36,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:59:36,488 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-20 05:59:36,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 05:59:36,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990826770] [2021-11-20 05:59:36,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990826770] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 05:59:36,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:59:36,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-20 05:59:36,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344671490] [2021-11-20 05:59:36,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:59:36,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:59:36,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 05:59:36,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:59:36,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:59:36,491 INFO L87 Difference]: Start difference. First operand 49 states and 64 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-20 05:59:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:59:36,527 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2021-11-20 05:59:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 05:59:36,529 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-20 05:59:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:59:36,530 INFO L225 Difference]: With dead ends: 38 [2021-11-20 05:59:36,530 INFO L226 Difference]: Without dead ends: 34 [2021-11-20 05:59:36,530 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-20 05:59:36,531 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-20 05:59:36,531 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-20 05:59:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-20 05:59:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-11-20 05:59:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 05:59:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-11-20 05:59:36,537 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2021-11-20 05:59:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:59:36,538 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-11-20 05:59:36,538 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-20 05:59:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2021-11-20 05:59:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 05:59:36,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:59:36,539 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:59:36,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-20 05:59:36,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 05:59:36,745 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 05:59:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:59:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -704273650, now seen corresponding path program 1 times [2021-11-20 05:59:36,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 05:59:36,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061822098] [2021-11-20 05:59:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:59:36,746 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 05:59:36,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 05:59:36,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 05:59:36,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-20 05:59:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:59:36,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 05:59:36,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:59:36,843 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-20 05:59:36,964 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-20 05:59:36,965 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-20 05:59:36,989 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-20 05:59:36,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:59:37,175 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-20 05:59:37,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 05:59:37,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061822098] [2021-11-20 05:59:37,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061822098] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 05:59:37,176 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:59:37,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 6 [2021-11-20 05:59:37,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902376775] [2021-11-20 05:59:37,176 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 05:59:37,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:59:37,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 05:59:37,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:59:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:59:37,177 INFO L87 Difference]: Start difference. First operand 34 states and 40 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-20 05:59:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:59:37,221 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-11-20 05:59:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:59:37,222 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-20 05:59:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:59:37,223 INFO L225 Difference]: With dead ends: 41 [2021-11-20 05:59:37,223 INFO L226 Difference]: Without dead ends: 41 [2021-11-20 05:59:37,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:59:37,224 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:59:37,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2021-11-20 05:59:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-11-20 05:59:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2021-11-20 05:59:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 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-20 05:59:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2021-11-20 05:59:37,230 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2021-11-20 05:59:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:59:37,230 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-11-20 05:59:37,231 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-20 05:59:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2021-11-20 05:59:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 05:59:37,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:59:37,233 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:59:37,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-20 05:59:37,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 05:59:37,442 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 05:59:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:59:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -704273649, now seen corresponding path program 1 times [2021-11-20 05:59:37,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 05:59:37,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973080279] [2021-11-20 05:59:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:59:37,445 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 05:59:37,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 05:59:37,446 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 05:59:37,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-20 05:59:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:59:37,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 05:59:37,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:59:37,563 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-20 05:59:37,573 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-20 05:59:39,913 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 05:59:39,914 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 30 treesize of output 32 [2021-11-20 05:59:39,926 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 05:59:39,927 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 24 treesize of output 24 [2021-11-20 05:59:40,171 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 05:59:40,172 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-20 05:59:40,187 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 05:59:40,187 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-20 05:59:40,255 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-20 05:59:40,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:59:57,209 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 05:59:57,209 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 44 treesize of output 43 [2021-11-20 06:00:11,757 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_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ BitVec 32))) (or (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|) (exists ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ldv_malloc_#res.base_53| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)) (or (exists ((v_ldv_malloc_~size_46 (_ BitVec 32)) (v_ldv_malloc_~size_50 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_53| v_ldv_malloc_~size_50) |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse0))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|)))))))))) (and (forall ((v_ldv_malloc_~size_46 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse1)))))) is different from false [2021-11-20 06:00:29,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ldv_malloc_#res.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ BitVec 32))) (or (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_54|)))) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_46 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_54| ldv_malloc_~size) |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ldv_malloc_#res.base_53| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)) (or (exists ((v_ldv_malloc_~size_46 (_ BitVec 32)) (v_ldv_malloc_~size_50 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_53| v_ldv_malloc_~size_50) |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |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_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse1))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|)))))))))))) is different from false [2021-11-20 06:00:38,881 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 60 treesize of output 58 [2021-11-20 06:00:39,954 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-20 06:00:40,122 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-20 06:00:40,123 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:00:40,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973080279] [2021-11-20 06:00:40,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973080279] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:00:40,123 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:00:40,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2021-11-20 06:00:40,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647129305] [2021-11-20 06:00:40,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:00:40,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 06:00:40,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:00:40,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 06:00:40,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=432, Unknown=12, NotChecked=86, Total=600 [2021-11-20 06:00:40,126 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:00:44,502 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ldv_malloc_#res.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ BitVec 32))) (or (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_54|)))) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_46 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_54| ldv_malloc_~size) |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ldv_malloc_#res.base_53| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)) (or (exists ((v_ldv_malloc_~size_46 (_ BitVec 32)) (v_ldv_malloc_~size_50 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_53| v_ldv_malloc_~size_50) |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |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_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse1))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|))))))))))))) is different from false [2021-11-20 06:00:46,520 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ldv_malloc_#res.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ BitVec 32))) (or (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_54|)))) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_46 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_54| ldv_malloc_~size) |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ldv_malloc_#res.base_53| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)) (or (exists ((v_ldv_malloc_~size_46 (_ BitVec 32)) (v_ldv_malloc_~size_50 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_53| v_ldv_malloc_~size_50) |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |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_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse1))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|))))))))))))) is different from false [2021-11-20 06:00:48,541 WARN L838 $PredicateComparison]: unable to prove that (and (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|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32)) (forall ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ BitVec 32))) (or (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|) (exists ((|v_ldv_malloc_#res.base_49| (_ BitVec 32)) (|v_ldv_malloc_#res.base_53| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_49| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)) (or (exists ((v_ldv_malloc_~size_46 (_ BitVec 32)) (v_ldv_malloc_~size_50 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_53| v_ldv_malloc_~size_50) |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse0))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|)))))))))) (and (forall ((v_ldv_malloc_~size_46 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_49| v_ldv_malloc_~size_46) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_10|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_6| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32) .cse1))))))) is different from false [2021-11-20 06:00:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:00:51,333 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-11-20 06:00:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 06:00:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2021-11-20 06:00:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:00:51,335 INFO L225 Difference]: With dead ends: 57 [2021-11-20 06:00:51,335 INFO L226 Difference]: Without dead ends: 57 [2021-11-20 06:00:51,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=96, Invalid=558, Unknown=16, NotChecked=260, Total=930 [2021-11-20 06:00:51,336 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:00:51,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 186 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 190 Unchecked, 0.4s Time] [2021-11-20 06:00:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-20 06:00:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2021-11-20 06:00:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-20 06:00:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-11-20 06:00:51,351 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 26 [2021-11-20 06:00:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:00:51,351 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-11-20 06:00:51,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:00:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-11-20 06:00:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 06:00:51,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:00:51,353 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:00:51,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-20 06:00:51,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:00:51,561 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 06:00:51,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:00:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1209832274, now seen corresponding path program 1 times [2021-11-20 06:00:51,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:00:51,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568182484] [2021-11-20 06:00:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:00:51,562 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:00:51,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:00:51,566 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:00:51,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-20 06:00:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:00:51,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 06:00:51,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:00:51,671 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-20 06:00:51,684 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-20 06:00:54,214 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:00:54,214 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 29 treesize of output 31 [2021-11-20 06:00:54,232 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:00:54,232 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 23 treesize of output 23 [2021-11-20 06:00:54,320 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-20 06:00:54,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:01:27,573 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-20 06:01:28,348 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-20 06:01:28,606 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-20 06:01:28,606 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:01:28,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568182484] [2021-11-20 06:01:28,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568182484] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:01:28,607 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:01:28,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2021-11-20 06:01:28,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989973227] [2021-11-20 06:01:28,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:01:28,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 06:01:28,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:01:28,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 06:01:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=355, Unknown=11, NotChecked=0, Total=420 [2021-11-20 06:01:28,609 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:01:38,204 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_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (|v_ldv_malloc_#res.base_62| (_ BitVec 32))) (or (and (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))) (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_62| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13|)))) (exists ((|v_ldv_malloc_#res.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_61|))))) (or (not (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)))) (exists ((v_ldv_malloc_~size_58 (_ 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_61| v_ldv_malloc_~size_58) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13|))))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_62|)))))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|)) is different from false [2021-11-20 06:01:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:01:46,700 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2021-11-20 06:01:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 06:01:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2021-11-20 06:01:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:01:46,702 INFO L225 Difference]: With dead ends: 85 [2021-11-20 06:01:46,702 INFO L226 Difference]: Without dead ends: 85 [2021-11-20 06:01:46,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=124, Invalid=731, Unknown=19, NotChecked=56, Total=930 [2021-11-20 06:01:46,704 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:01:46,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 212 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 206 Unchecked, 0.3s Time] [2021-11-20 06:01:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-20 06:01:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2021-11-20 06:01:46,712 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-20 06:01:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2021-11-20 06:01:46,713 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2021-11-20 06:01:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:01:46,714 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2021-11-20 06:01:46,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:01:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2021-11-20 06:01:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 06:01:46,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:01:46,716 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-20 06:01:46,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:01:46,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:01:46,918 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 06:01:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:01:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1161906918, now seen corresponding path program 1 times [2021-11-20 06:01:46,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:01:46,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544972877] [2021-11-20 06:01:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:01:46,919 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:01:46,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:01:46,920 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:01:46,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-20 06:01:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:01:46,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:01:46,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:01:47,125 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-20 06:01:47,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:01:47,288 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-20 06:01:47,288 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:01:47,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544972877] [2021-11-20 06:01:47,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544972877] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:01:47,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:01:47,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-20 06:01:47,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623394653] [2021-11-20 06:01:47,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:01:47,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:01:47,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:01:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:01:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:01:47,290 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-20 06:01:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:01:47,530 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2021-11-20 06:01:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:01:47,531 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-20 06:01:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:01:47,532 INFO L225 Difference]: With dead ends: 92 [2021-11-20 06:01:47,532 INFO L226 Difference]: Without dead ends: 92 [2021-11-20 06:01:47,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:01:47,533 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 83 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:01:47,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:01:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-20 06:01:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2021-11-20 06:01:47,543 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-20 06:01:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2021-11-20 06:01:47,545 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 30 [2021-11-20 06:01:47,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:01:47,545 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2021-11-20 06:01:47,545 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-20 06:01:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2021-11-20 06:01:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 06:01:47,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:01:47,547 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:01:47,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-20 06:01:47,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:01:47,761 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 06:01:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:01:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1382185263, now seen corresponding path program 2 times [2021-11-20 06:01:47,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:01:47,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431655370] [2021-11-20 06:01:47,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:01:47,763 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:01:47,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:01:47,764 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:01:47,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-20 06:01:47,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:01:47,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:01:47,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 06:01:47,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:01:47,897 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-20 06:01:47,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-20 06:01:50,184 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:01:50,184 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 30 treesize of output 32 [2021-11-20 06:01:50,196 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:01:50,196 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 24 treesize of output 24 [2021-11-20 06:01:50,420 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:01:50,420 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-20 06:01:50,431 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:01:50,431 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-20 06:01:52,626 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-20 06:01:52,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:02:17,048 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:02:17,048 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 48 treesize of output 47 [2021-11-20 06:02:47,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ldv_malloc_#res.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ldv_malloc_#res.base_91| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_86| (_ BitVec 32))) (and (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) .cse0)))) (exists ((v_ldv_malloc_~size_83 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_86| v_ldv_malloc_~size_83) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_86|)))))))))))) (= |v_ldv_malloc_#res.base_86| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_91|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_83 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_91| ldv_malloc_~size) |v_ldv_malloc_#res.base_86| v_ldv_malloc_~size_83) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) .cse1)))))) is different from false [2021-11-20 06:02:49,837 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 33 treesize of output 31 [2021-11-20 06:02:50,554 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-20 06:02:50,767 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-20 06:02:50,768 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:02:50,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431655370] [2021-11-20 06:02:50,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431655370] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:02:50,768 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:02:50,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2021-11-20 06:02:50,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291411778] [2021-11-20 06:02:50,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:02:50,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 06:02:50,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:02:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 06:02:50,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=603, Unknown=19, NotChecked=50, Total=756 [2021-11-20 06:02:50,770 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 28 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-20 06:03:10,950 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ldv_malloc_#res.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ldv_malloc_#res.base_91| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_86| (_ BitVec 32))) (and (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) .cse0)))) (exists ((v_ldv_malloc_~size_83 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_86| v_ldv_malloc_~size_83) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_86|)))))))))))) (= |v_ldv_malloc_#res.base_86| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_91|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_83 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_91| ldv_malloc_~size) |v_ldv_malloc_#res.base_86| v_ldv_malloc_~size_83) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) .cse1)))))) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_19| (_ BitVec 32)) (|v_ldv_malloc_#res.base_87| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_87|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_87| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_19|))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv8 32) .cse2)))) (exists ((|v_ldv_malloc_#res.base_86| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_86|))))))) (or (exists ((v_ldv_malloc_~size_83 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_86| v_ldv_malloc_~size_83) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_19|)))) (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv8 32) .cse3))))))))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:03:12,981 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ldv_malloc_#res.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ldv_malloc_#res.base_91| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_86| (_ BitVec 32))) (and (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) .cse0)))) (exists ((v_ldv_malloc_~size_83 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_86| v_ldv_malloc_~size_83) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_86|)))))))))))) (= |v_ldv_malloc_#res.base_86| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_91|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_83 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_91| ldv_malloc_~size) |v_ldv_malloc_#res.base_86| v_ldv_malloc_~size_83) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_20|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_20| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_16| (_ bv12 32) .cse1)))))) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_19| (_ BitVec 32)) (|v_ldv_malloc_#res.base_87| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_87|))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_87| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_19|))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv8 32) .cse2)))) (exists ((|v_ldv_malloc_#res.base_86| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_86|))))))) (or (exists ((v_ldv_malloc_~size_83 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_86| v_ldv_malloc_~size_83) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_19|)))) (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_19| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_15| (_ bv8 32) .cse3))))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:03:34,796 WARN L227 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:03:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:03:43,190 INFO L93 Difference]: Finished difference Result 151 states and 179 transitions. [2021-11-20 06:03:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-20 06:03:43,191 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2021-11-20 06:03:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:03:43,192 INFO L225 Difference]: With dead ends: 151 [2021-11-20 06:03:43,192 INFO L226 Difference]: Without dead ends: 151 [2021-11-20 06:03:43,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 101.0s TimeCoverageRelationStatistics Valid=224, Invalid=1478, Unknown=32, NotChecked=246, Total=1980 [2021-11-20 06:03:43,194 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:03:43,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 282 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 255 Invalid, 0 Unknown, 400 Unchecked, 0.7s Time] [2021-11-20 06:03:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-20 06:03:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 107. [2021-11-20 06:03:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.146341463414634) internal successors, (94), 84 states have internal predecessors, (94), 12 states have call successors, (12), 7 states have call predecessors, (12), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) [2021-11-20 06:03:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2021-11-20 06:03:43,208 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 35 [2021-11-20 06:03:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:03:43,209 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2021-11-20 06:03:43,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-20 06:03:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2021-11-20 06:03:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 06:03:43,210 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:03:43,210 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:03:43,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-20 06:03:43,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:03:43,418 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 06:03:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:03:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1888667409, now seen corresponding path program 3 times [2021-11-20 06:03:43,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:03:43,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223589038] [2021-11-20 06:03:43,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:03:43,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:03:43,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:03:43,420 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:03:43,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-20 06:03:43,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-20 06:03:43,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:03:43,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-20 06:03:43,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:03:43,542 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-20 06:03:47,848 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-20 06:03:47,848 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 12 treesize of output 18 [2021-11-20 06:03:56,775 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-20 06:03:56,775 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 3 case distinctions, treesize of input 36 treesize of output 45 [2021-11-20 06:03:56,789 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:03:56,790 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 34 treesize of output 34 [2021-11-20 06:03:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 27 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:03:56,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:04:13,093 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:04:13,093 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 44 treesize of output 43 [2021-11-20 06:04:20,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (let ((.cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse2))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|) (and (bvule .cse0 (select |c_old(#length)| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 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_99| v_ldv_malloc_~size_95) |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_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse1)))))))) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (bvule .cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse2))))))) is different from false [2021-11-20 06:05:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 1 times theorem prover too weak. 0 trivial. 11 not checked. [2021-11-20 06:05:12,210 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:05:12,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223589038] [2021-11-20 06:05:12,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223589038] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:05:12,211 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:05:12,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2021-11-20 06:05:12,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593268873] [2021-11-20 06:05:12,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:05:12,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-20 06:05:12,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:05:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-20 06:05:12,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=868, Unknown=17, NotChecked=60, Total=1056 [2021-11-20 06:05:12,213 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 33 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-20 06:05:14,939 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (let ((.cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse2))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|) (and (bvule .cse0 (select |c_old(#length)| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 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_99| v_ldv_malloc_~size_95) |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_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse1)))))))) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (bvule .cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse2))))))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:05:16,955 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (let ((.cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse2))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|) (and (bvule .cse0 (select |c_old(#length)| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 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_99| v_ldv_malloc_~size_95) |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_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse1)))))))) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (bvule .cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse2))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:05:50,263 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (let ((.cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse2))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|) (and (bvule .cse0 (select |c_old(#length)| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 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_99| v_ldv_malloc_~size_95) |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_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse1)))))))) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (bvule .cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse2))))))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:05:52,295 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (let ((.cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse2))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|) (and (bvule .cse0 (select |c_old(#length)| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 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_99| v_ldv_malloc_~size_95) |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_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse1)))))))) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (bvule .cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse2))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|)) is different from false [2021-11-20 06:05:54,322 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (= (_ bv4 32) |c_ldv_malloc_#in~size|)) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ BitVec 32)) (|v_ldv_malloc_#res.base_108| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26| (_ BitVec 32))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ bv4 32)))) (let ((.cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_22| (_ bv8 32) .cse3))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|) (not (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#res.base_108| c_ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (exists ((|v_ldv_malloc_#res.base_107| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ bv4 32)))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_22| (_ bv8 32) .cse2))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (bvule .cse1 (select (store |c_old(#length)| |v_ldv_malloc_#res.base_107| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_22| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_107| (_ bv4 32)) |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|)))) (not (bvule .cse1 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_22| .cse2 (_ bv12 32))))))))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_22| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_26| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_108| c_ldv_malloc_~size) |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_26|))) (bvule .cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_22| .cse3 (_ bv12 32))))))))) (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse6 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (let ((.cse4 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse6))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|) (and (bvule .cse4 (select |c_old(#length)| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 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_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)))) (not (let ((.cse5 (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_21| (_ bv4 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse5)))))))) (not (bvule .cse4 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (bvule .cse4 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse6))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:06:21,365 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (let ((.cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse2))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|) (and (bvule .cse0 (select |c_old(#length)| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 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_99| v_ldv_malloc_~size_95) |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_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse1)))))))) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (bvule .cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse2))))))) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_24| (_ BitVec 32)) (|v_ldv_malloc_#res.base_100| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_100|))))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ bv4 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_100| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_24|)))) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_99|))))))) (or (not (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ bv4 32) .cse4)))) (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_24|)))))))))) is different from false [2021-11-20 06:06:23,448 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_99| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32)))) (let ((.cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse2))) (or (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|) (and (bvule .cse0 (select |c_old(#length)| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (not (= |v_ldv_malloc_#res.base_99| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|)) (or (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 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_99| v_ldv_malloc_~size_95) |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_25| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse1)))))))) (not (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (and (forall ((v_ldv_malloc_~size_95 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_25| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_25|))) (bvule .cse0 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_21| (_ bv8 32) .cse2))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_24| (_ BitVec 32)) (|v_ldv_malloc_#res.base_100| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_100|))))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ bv4 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_100| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_24|)))) (exists ((|v_ldv_malloc_#res.base_99| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_99|))))))) (or (not (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ bv4 32) .cse4)))) (exists ((v_ldv_malloc_~size_95 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_20| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_24| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_99| v_ldv_malloc_~size_95) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_24|)))))))))) is different from false [2021-11-20 06:06:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:36,155 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2021-11-20 06:06:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-20 06:06:36,156 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2021-11-20 06:06:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:06:36,157 INFO L225 Difference]: With dead ends: 163 [2021-11-20 06:06:36,158 INFO L226 Difference]: Without dead ends: 163 [2021-11-20 06:06:36,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 134.5s TimeCoverageRelationStatistics Valid=193, Invalid=1513, Unknown=48, NotChecked=696, Total=2450 [2021-11-20 06:06:36,159 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:06:36,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 332 Unchecked, 0.2s Time] [2021-11-20 06:06:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-20 06:06:36,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2021-11-20 06:06:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 122 states have internal predecessors, (133), 17 states have call successors, (17), 11 states have call predecessors, (17), 18 states have return successors, (31), 20 states have call predecessors, (31), 17 states have call successors, (31) [2021-11-20 06:06:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2021-11-20 06:06:36,170 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 35 [2021-11-20 06:06:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:06:36,171 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2021-11-20 06:06:36,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-20 06:06:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2021-11-20 06:06:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-20 06:06:36,173 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:36,173 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:36,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:36,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:06:36,378 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-20 06:06:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -856630225, now seen corresponding path program 2 times [2021-11-20 06:06:36,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:06:36,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557405274] [2021-11-20 06:06:36,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:06:36,379 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:06:36,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:06:36,380 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:06:36,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d5dd64c-dad0-4d44-9452-3440bd27e826/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-20 06:06:36,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:06:36,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:06:36,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-20 06:06:36,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:36,541 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-20 06:06:36,550 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-20 06:06:38,896 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:06:38,896 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-20 06:06:38,911 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:06:38,911 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-20 06:06:39,152 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:06:39,152 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 30 treesize of output 32 [2021-11-20 06:06:39,166 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:06:39,166 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 24 treesize of output 24 [2021-11-20 06:06:39,440 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:06:39,440 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-20 06:06:39,455 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:06:39,455 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-20 06:06:39,730 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:06:39,730 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 34 treesize of output 36 [2021-11-20 06:06:39,744 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:06:39,744 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 28 treesize of output 28 [2021-11-20 06:06:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:06:39,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:53,677 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:06:53,677 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 45 treesize of output 44 [2021-11-20 06:07:10,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) is different from false [2021-11-20 06:07:29,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32)) (|v_ldv_malloc_#res.base_120| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_120| ldv_malloc_~size) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_120|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) is different from false [2021-11-20 06:07:56,660 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:07:56,660 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 57 treesize of output 56 [2021-11-20 06:07:59,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (or (= |c_ULTIMATE.start_entry_point_~array~0#1.base| |v_ldv_malloc_#res.base_119|) (and (forall ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |c_ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul |c_ULTIMATE.start_entry_point_~i~0#1| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |c_ULTIMATE.start_entry_point_~array~0#1.base|))) (let ((.cse0 (bvmul |c_ULTIMATE.start_entry_point_~i~0#1| (_ bv4 32)))) (bvule (bvadd |c_ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) .cse0) (bvadd |c_ULTIMATE.start_entry_point_~array~0#1.offset| .cse0 (_ bv12 32))))) (= |c_ULTIMATE.start_entry_point_~array~0#1.base| |v_ldv_malloc_#res.base_115|))) is different from false [2021-11-20 06:08:20,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ 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_33| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse0 (_ bv12 32)))) (forall ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_123|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|)) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse1 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|))) is different from false [2021-11-20 06:08:46,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_124| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ 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_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_124|)))) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse0 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_124| ldv_malloc_~size) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_123|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|)) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse1 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|))) is different from false [2021-11-20 06:09:09,343 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:09:09,344 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 56 treesize of output 55 [2021-11-20 06:09:42,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|) (and (forall ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse0)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_127| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_127|)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|)) (or (exists ((v_ldv_malloc_~size_123 (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_127| v_ldv_malloc_~size_123) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |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_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse1))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|))) is different from false [2021-11-20 06:09:44,258 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|) (and (forall ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse0)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_127| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_127|)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|)) (or (exists ((v_ldv_malloc_~size_123 (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_127| v_ldv_malloc_~size_123) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |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_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse1))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|))) is different from true [2021-11-20 06:10:19,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_128| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_127| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_127|)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|)) (or (exists ((v_ldv_malloc_~size_123 (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_127| v_ldv_malloc_~size_123) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse0))))))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_#length| |v_ldv_malloc_#res.base_128| ldv_malloc_~size) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse1)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_128|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|))) is different from false [2021-11-20 06:10:40,002 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 221 treesize of output 219 [2021-11-20 06:10:41,963 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 3337 treesize of output 3335 [2021-11-20 06:10:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2021-11-20 06:10:42,667 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:10:42,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557405274] [2021-11-20 06:10:42,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557405274] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:10:42,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:10:42,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2021-11-20 06:10:42,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413816916] [2021-11-20 06:10:42,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:10:42,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-20 06:10:42,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:10:42,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-20 06:10:42,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=901, Unknown=37, NotChecked=476, Total=1560 [2021-11-20 06:10:42,669 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 38 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-11-20 06:10:45,407 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32)) (|v_ldv_malloc_#res.base_120| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_120| ldv_malloc_~size) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_120|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_128| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_127| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_127|)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|)) (or (exists ((v_ldv_malloc_~size_123 (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_127| v_ldv_malloc_~size_123) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse2 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse2))))))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_#length| |v_ldv_malloc_#res.base_128| ldv_malloc_~size) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse3 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse3)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_128|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|))) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_124| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ 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_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_124|)))) (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse4 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_124| ldv_malloc_~size) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_123|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|)) (or (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse5 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)))) is different from false [2021-11-20 06:10:47,475 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32)) (|v_ldv_malloc_#res.base_120| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_120| ldv_malloc_~size) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_120|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_128| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_127| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_127|)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|)) (or (exists ((v_ldv_malloc_~size_123 (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_127| v_ldv_malloc_~size_123) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse2 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse2))))))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_#length| |v_ldv_malloc_#res.base_128| ldv_malloc_~size) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse3 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse3)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_128|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|))) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_124| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ 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_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_124|)))) (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse4 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_124| ldv_malloc_~size) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_123|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|)) (or (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse5 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)))) is different from false [2021-11-20 06:10:49,549 WARN L838 $PredicateComparison]: unable to prove that (and (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|)))))))) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ 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_33| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse0 (_ bv12 32)))) (forall ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_123|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|)) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse1 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32)) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32))) (or (and (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse2))) (forall ((v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse3)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|) (and (forall ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|))) (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse4 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse4)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ldv_malloc_#res.base_127| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_127|)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_115|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_119|)) (or (exists ((v_ldv_malloc_~size_123 (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_127| v_ldv_malloc_~size_123) |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34|)))) (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_34| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| .cse5 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_30| (_ bv16 32) .cse5))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_34| |v_ldv_malloc_#res.base_123|)))) is different from false [2021-11-20 06:11:07,690 WARN L227 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 72 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:11:25,825 WARN L227 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 71 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:11:27,835 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32)) (|v_ldv_malloc_#res.base_120| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_120| ldv_malloc_~size) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_120|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_124| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ 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_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_124|)))) (and (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse2 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_124| ldv_malloc_~size) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_123|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|)) (or (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse3 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)))) is different from false [2021-11-20 06:11:29,869 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32)) (|v_ldv_malloc_#res.base_120| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_120| ldv_malloc_~size) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_120|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_124| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ 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_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_124|)))) (and (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse2 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_124| ldv_malloc_~size) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_123|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|)) (or (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse3 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)))) is different from false [2021-11-20 06:11:31,911 WARN L838 $PredicateComparison]: unable to prove that (and (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|)))))))) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ 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_33| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse0 (_ bv12 32)))) (forall ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_123| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|)) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_123|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|)) (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| .cse1 (_ bv12 32))))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_119 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_29| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_33| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_123| v_ldv_malloc_~size_119) |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33|))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_115|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_33| |v_ldv_malloc_#res.base_119|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32)) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32))) (or (and (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse2))) (forall ((v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse3)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)))) is different from false [2021-11-20 06:12:34,311 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32)) (|v_ldv_malloc_#res.base_120| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_120| ldv_malloc_~size) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_120|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:12:36,330 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32)) (|v_ldv_malloc_#res.base_120| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_120| ldv_malloc_~size) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_120|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:12:38,359 WARN L838 $PredicateComparison]: unable to prove that (and (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|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32)) (forall ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse0))) (forall ((v_ldv_malloc_~size_111 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|)))) (exists ((|v_ldv_malloc_#res.base_115| (_ BitVec 32)) (|v_ldv_malloc_#res.base_119| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) .cse1)))) (exists ((v_ldv_malloc_~size_111 (_ BitVec 32)) (v_ldv_malloc_~size_115 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_28| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_32| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_119| v_ldv_malloc_~size_115) |v_ldv_malloc_#res.base_115| v_ldv_malloc_~size_111) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_119|)))))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_32| |v_ldv_malloc_#res.base_115|)))) is different from false