./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 470ea952a017f85e061633b44d76c252a8c00f3d .............................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 470ea952a017f85e061633b44d76c252a8c00f3d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:17:48,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:17:48,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:17:48,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:17:48,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:17:48,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:17:48,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:17:48,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:17:48,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:17:48,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:17:48,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:17:48,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:17:48,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:17:48,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:17:48,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:17:48,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:17:48,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:17:48,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:17:48,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:17:48,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:17:48,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:17:48,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:17:48,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:17:48,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:17:48,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:17:48,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:17:48,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:17:48,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:17:48,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:17:48,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:17:48,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:17:48,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:17:48,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:17:48,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:17:48,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:17:48,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:17:48,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:17:48,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:17:48,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:17:48,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:17:48,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:17:48,531 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-11-30 02:17:48,555 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:17:48,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:17:48,556 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:17:48,557 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:17:48,557 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:17:48,557 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:17:48,557 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:17:48,558 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:17:48,558 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:17:48,558 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:17:48,558 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:17:48,558 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:17:48,559 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:17:48,559 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:17:48,559 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:17:48,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 02:17:48,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 02:17:48,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:17:48,560 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:17:48,560 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 02:17:48,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:17:48,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:17:48,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:17:48,561 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 02:17:48,561 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 02:17:48,561 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 02:17:48,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:17:48,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:17:48,562 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:17:48,562 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:17:48,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:17:48,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:17:48,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:17:48,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:17:48,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:17:48,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:17:48,563 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:17:48,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:17:48,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:17:48,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:17:48,564 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/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-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 470ea952a017f85e061633b44d76c252a8c00f3d [2020-11-30 02:17:48,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:17:48,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:17:48,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:17:48,829 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:17:48,830 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:17:48,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2020-11-30 02:17:48,898 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data/e33d557e7/f9959f64dcc24a958fc5bc893ed1a07d/FLAG64567dc19 [2020-11-30 02:17:49,559 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:17:49,559 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2020-11-30 02:17:49,589 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data/e33d557e7/f9959f64dcc24a958fc5bc893ed1a07d/FLAG64567dc19 [2020-11-30 02:17:49,827 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data/e33d557e7/f9959f64dcc24a958fc5bc893ed1a07d [2020-11-30 02:17:49,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:17:49,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:17:49,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:17:49,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:17:49,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:17:49,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:17:49" (1/1) ... [2020-11-30 02:17:49,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1355218a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:49, skipping insertion in model container [2020-11-30 02:17:49,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:17:49" (1/1) ... [2020-11-30 02:17:49,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:17:49,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:17:50,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:17:50,230 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) [2020-11-30 02:17:50,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@204db181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:50, skipping insertion in model container [2020-11-30 02:17:50,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:17:50,232 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2020-11-30 02:17:50,234 INFO L168 Benchmark]: Toolchain (without parser) took 402.33 ms. Allocated memory is still 130.0 MB. Free memory was 97.4 MB in the beginning and 104.5 MB in the end (delta: -7.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:17:50,235 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 88.1 MB. Free memory is still 46.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:17:50,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.12 ms. Allocated memory is still 130.0 MB. Free memory was 97.1 MB in the beginning and 104.7 MB in the end (delta: -7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:17:50,238 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.22 ms. Allocated memory is still 88.1 MB. Free memory is still 46.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 399.12 ms. Allocated memory is still 130.0 MB. Free memory was 97.1 MB in the beginning and 104.7 MB in the end (delta: -7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: 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... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:17:52,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:17:52,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:17:52,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:17:52,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:17:52,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:17:52,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:17:52,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:17:52,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:17:52,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:17:52,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:17:52,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:17:52,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:17:52,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:17:52,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:17:52,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:17:52,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:17:52,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:17:52,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:17:52,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:17:52,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:17:52,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:17:52,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:17:52,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:17:52,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:17:52,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:17:52,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:17:52,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:17:52,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:17:52,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:17:52,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:17:52,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:17:52,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:17:52,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:17:52,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:17:52,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:17:52,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:17:52,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:17:52,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:17:52,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:17:52,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:17:52,426 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-11-30 02:17:52,451 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:17:52,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:17:52,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:17:52,452 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:17:52,453 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:17:52,453 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:17:52,453 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:17:52,453 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:17:52,453 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:17:52,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 02:17:52,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 02:17:52,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:17:52,454 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:17:52,455 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 02:17:52,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:17:52,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:17:52,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:17:52,455 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 02:17:52,456 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 02:17:52,456 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 02:17:52,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:17:52,464 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:17:52,464 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 02:17:52,464 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 02:17:52,465 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:17:52,465 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:17:52,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:17:52,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 02:17:52,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:17:52,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:17:52,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:17:52,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:17:52,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:17:52,466 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-11-30 02:17:52,467 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 02:17:52,467 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:17:52,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:17:52,467 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-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/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-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 470ea952a017f85e061633b44d76c252a8c00f3d [2020-11-30 02:17:52,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:17:52,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:17:52,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:17:52,847 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:17:52,852 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:17:52,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2020-11-30 02:17:52,912 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data/0bc6af210/4c9e990176424a1faef241da7056f802/FLAGf9638cea1 [2020-11-30 02:17:53,557 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:17:53,562 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2020-11-30 02:17:53,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data/0bc6af210/4c9e990176424a1faef241da7056f802/FLAGf9638cea1 [2020-11-30 02:17:53,875 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/data/0bc6af210/4c9e990176424a1faef241da7056f802 [2020-11-30 02:17:53,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:17:53,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:17:53,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:17:53,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:17:53,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:17:53,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:17:53" (1/1) ... [2020-11-30 02:17:53,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29318d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:53, skipping insertion in model container [2020-11-30 02:17:53,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:17:53" (1/1) ... [2020-11-30 02:17:53,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:17:53,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:17:54,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:17:54,301 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-11-30 02:17:54,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:17:54,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:17:54,366 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:17:54,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:17:54,484 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:17:54,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54 WrapperNode [2020-11-30 02:17:54,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:17:54,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:17:54,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:17:54,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:17:54,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:17:54,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:17:54,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:17:54,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:17:54,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... [2020-11-30 02:17:54,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:17:54,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:17:54,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:17:54,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:17:54,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:17:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 02:17:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 02:17:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:17:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 02:17:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 02:17:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 02:17:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 02:17:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 02:17:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:17:54,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:17:55,756 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:17:55,757 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-11-30 02:17:55,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:17:55 BoogieIcfgContainer [2020-11-30 02:17:55,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:17:55,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:17:55,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:17:55,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:17:55,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:17:53" (1/3) ... [2020-11-30 02:17:55,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f365447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:17:55, skipping insertion in model container [2020-11-30 02:17:55,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:17:54" (2/3) ... [2020-11-30 02:17:55,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f365447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:17:55, skipping insertion in model container [2020-11-30 02:17:55,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:17:55" (3/3) ... [2020-11-30 02:17:55,787 INFO L111 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2020-11-30 02:17:55,796 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:17:55,812 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2020-11-30 02:17:55,850 INFO L253 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2020-11-30 02:17:55,871 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:17:55,871 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 02:17:55,871 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:17:55,872 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:17:55,872 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:17:55,872 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:17:55,872 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:17:55,872 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:17:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2020-11-30 02:17:55,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-30 02:17:55,895 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:17:55,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-30 02:17:55,896 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:17:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:17:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2020-11-30 02:17:55,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:17:55,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130936340] [2020-11-30 02:17:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 02:17:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:17:56,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:17:56,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:17:56,076 INFO L384 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 [2020-11-30 02:17:56,076 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:17:56,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:17:56,084 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:17:56,084 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:17:56,162 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:17:56,163 INFO L384 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 17 treesize of output 39 [2020-11-30 02:17:56,165 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:17:56,205 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-11-30 02:17:56,207 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:17:56,207 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2020-11-30 02:17:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:17:56,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:17:59,619 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 13 [2020-11-30 02:17:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:17:59,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130936340] [2020-11-30 02:17:59,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:17:59,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 02:17:59,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661608778] [2020-11-30 02:17:59,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:17:59,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:17:59,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:17:59,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2020-11-30 02:17:59,673 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 6 states. [2020-11-30 02:18:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:00,334 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2020-11-30 02:18:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:18:00,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2020-11-30 02:18:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:00,347 INFO L225 Difference]: With dead ends: 147 [2020-11-30 02:18:00,347 INFO L226 Difference]: Without dead ends: 145 [2020-11-30 02:18:00,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=17, Invalid=24, Unknown=1, NotChecked=0, Total=42 [2020-11-30 02:18:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-30 02:18:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-11-30 02:18:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-30 02:18:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2020-11-30 02:18:00,394 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 4 [2020-11-30 02:18:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:00,394 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2020-11-30 02:18:00,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:18:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2020-11-30 02:18:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-30 02:18:00,395 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:00,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-30 02:18:00,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 02:18:00,613 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:00,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:00,614 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2020-11-30 02:18:00,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:00,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937886325] [2020-11-30 02:18:00,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:00,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 02:18:00,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:00,724 INFO L384 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 [2020-11-30 02:18:00,724 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:00,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:00,742 INFO L384 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 [2020-11-30 02:18:00,743 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:00,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:00,752 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:00,752 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 02:18:00,804 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:00,805 INFO L384 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 11 treesize of output 15 [2020-11-30 02:18:00,806 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:00,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:00,832 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-11-30 02:18:00,833 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:00,859 INFO L625 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2020-11-30 02:18:00,860 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:18:00,860 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-11-30 02:18:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:00,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:00,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:18:05,548 WARN L193 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 21 [2020-11-30 02:18:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:05,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937886325] [2020-11-30 02:18:05,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:05,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 02:18:05,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317544430] [2020-11-30 02:18:05,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:18:05,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:18:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:18:05,587 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 6 states. [2020-11-30 02:18:08,900 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 35 [2020-11-30 02:18:19,860 WARN L193 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-11-30 02:18:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:28,350 INFO L93 Difference]: Finished difference Result 262 states and 288 transitions. [2020-11-30 02:18:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:18:28,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2020-11-30 02:18:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:28,354 INFO L225 Difference]: With dead ends: 262 [2020-11-30 02:18:28,354 INFO L226 Difference]: Without dead ends: 262 [2020-11-30 02:18:28,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:18:28,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-30 02:18:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 108. [2020-11-30 02:18:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-30 02:18:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2020-11-30 02:18:28,382 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 4 [2020-11-30 02:18:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:28,383 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2020-11-30 02:18:28,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:18:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2020-11-30 02:18:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 02:18:28,383 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:28,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 02:18:28,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 02:18:28,598 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:28,599 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2020-11-30 02:18:28,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:28,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948088271] [2020-11-30 02:18:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:28,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:18:28,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:28,693 INFO L384 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 [2020-11-30 02:18:28,693 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:28,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:28,696 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:28,696 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:18:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:28,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:28,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948088271] [2020-11-30 02:18:28,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:28,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 02:18:28,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511836937] [2020-11-30 02:18:28,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:18:28,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:28,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:18:28,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:18:28,708 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 3 states. [2020-11-30 02:18:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:28,899 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2020-11-30 02:18:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:18:28,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-30 02:18:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:28,900 INFO L225 Difference]: With dead ends: 137 [2020-11-30 02:18:28,900 INFO L226 Difference]: Without dead ends: 137 [2020-11-30 02:18:28,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:18:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-30 02:18:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2020-11-30 02:18:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-30 02:18:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2020-11-30 02:18:28,910 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 5 [2020-11-30 02:18:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:28,910 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2020-11-30 02:18:28,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:18:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2020-11-30 02:18:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 02:18:28,911 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:28,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 02:18:29,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 02:18:29,123 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:29,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:29,123 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2020-11-30 02:18:29,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:29,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321262116] [2020-11-30 02:18:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:29,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:18:29,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:29,207 INFO L384 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 [2020-11-30 02:18:29,207 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:29,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:29,214 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:29,215 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 02:18:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:29,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:29,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321262116] [2020-11-30 02:18:29,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:29,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-11-30 02:18:29,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198176104] [2020-11-30 02:18:29,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:18:29,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:29,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:18:29,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:18:29,293 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 4 states. [2020-11-30 02:18:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:29,763 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2020-11-30 02:18:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:18:29,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-11-30 02:18:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:29,769 INFO L225 Difference]: With dead ends: 174 [2020-11-30 02:18:29,769 INFO L226 Difference]: Without dead ends: 174 [2020-11-30 02:18:29,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:18:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-30 02:18:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 105. [2020-11-30 02:18:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-30 02:18:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2020-11-30 02:18:29,777 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 5 [2020-11-30 02:18:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:29,777 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2020-11-30 02:18:29,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:18:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2020-11-30 02:18:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 02:18:29,783 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:29,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:18:30,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 02:18:30,005 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:30,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2020-11-30 02:18:30,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:30,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38145164] [2020-11-30 02:18:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:30,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:18:30,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:30,121 INFO L384 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 [2020-11-30 02:18:30,121 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:30,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:30,125 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:30,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:18:30,161 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:30,161 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2020-11-30 02:18:30,162 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:30,189 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-30 02:18:30,190 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:18:30,190 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-11-30 02:18:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:30,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:30,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38145164] [2020-11-30 02:18:30,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:30,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 02:18:30,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500265062] [2020-11-30 02:18:30,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:18:30,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:30,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:18:30,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:18:30,223 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 3 states. [2020-11-30 02:18:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:30,509 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2020-11-30 02:18:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:18:30,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 02:18:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:30,511 INFO L225 Difference]: With dead ends: 151 [2020-11-30 02:18:30,511 INFO L226 Difference]: Without dead ends: 151 [2020-11-30 02:18:30,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:18:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-11-30 02:18:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 101. [2020-11-30 02:18:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-30 02:18:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2020-11-30 02:18:30,520 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 9 [2020-11-30 02:18:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:30,521 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2020-11-30 02:18:30,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:18:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2020-11-30 02:18:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 02:18:30,522 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:30,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:18:30,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 02:18:30,740 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2020-11-30 02:18:30,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:30,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487229291] [2020-11-30 02:18:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:30,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:18:30,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:30,860 INFO L384 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 [2020-11-30 02:18:30,860 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:30,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:30,877 INFO L384 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 [2020-11-30 02:18:30,877 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:30,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:30,891 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:30,891 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 02:18:30,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:18:30,932 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-11-30 02:18:30,933 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:30,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:30,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:18:30,963 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:18:30,967 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:30,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:30,989 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:18:30,990 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2020-11-30 02:18:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:31,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:31,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:18:33,119 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_create_data_#t~malloc8.base_5| (_ BitVec 32))) (or (bvule (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_create_data_#t~malloc8.base_5| (_ bv80 32)) c_ULTIMATE.start_create_data_~data~0.base)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_data_#t~malloc8.base_5|))))) (or (forall ((|v_ULTIMATE.start_create_data_#t~malloc8.base_5| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_data_#t~malloc8.base_5|)))) (bvule (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv8 32))))) is different from false [2020-11-30 02:18:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:33,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487229291] [2020-11-30 02:18:33,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:33,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 02:18:33,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634806063] [2020-11-30 02:18:33,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:18:33,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:33,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:18:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=12, Unknown=1, NotChecked=6, Total=30 [2020-11-30 02:18:33,140 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2020-11-30 02:18:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:34,258 INFO L93 Difference]: Finished difference Result 296 states and 323 transitions. [2020-11-30 02:18:34,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:18:34,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-30 02:18:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:34,260 INFO L225 Difference]: With dead ends: 296 [2020-11-30 02:18:34,260 INFO L226 Difference]: Without dead ends: 296 [2020-11-30 02:18:34,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=16, Invalid=17, Unknown=1, NotChecked=8, Total=42 [2020-11-30 02:18:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-11-30 02:18:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 97. [2020-11-30 02:18:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-30 02:18:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2020-11-30 02:18:34,268 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 9 [2020-11-30 02:18:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:34,269 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2020-11-30 02:18:34,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:18:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2020-11-30 02:18:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 02:18:34,269 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:34,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:18:34,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 02:18:34,482 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2020-11-30 02:18:34,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:34,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116311734] [2020-11-30 02:18:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:34,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:18:34,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:34,564 INFO L384 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 [2020-11-30 02:18:34,564 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:34,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:34,566 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:34,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:18:34,575 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:18:34,575 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:34,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:34,583 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:34,583 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 02:18:34,617 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2020-11-30 02:18:34,617 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:34,619 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:34,619 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:34,620 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-11-30 02:18:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:34,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:34,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116311734] [2020-11-30 02:18:34,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:34,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:18:34,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892515529] [2020-11-30 02:18:34,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:18:34,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:18:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:18:34,638 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 5 states. [2020-11-30 02:18:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:35,248 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2020-11-30 02:18:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:18:35,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-30 02:18:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:35,250 INFO L225 Difference]: With dead ends: 152 [2020-11-30 02:18:35,250 INFO L226 Difference]: Without dead ends: 152 [2020-11-30 02:18:35,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:18:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-30 02:18:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2020-11-30 02:18:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 02:18:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2020-11-30 02:18:35,257 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 13 [2020-11-30 02:18:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:35,257 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2020-11-30 02:18:35,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:18:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2020-11-30 02:18:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 02:18:35,259 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:35,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:18:35,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 02:18:35,459 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:35,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:35,460 INFO L82 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2020-11-30 02:18:35,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:35,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386336809] [2020-11-30 02:18:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:35,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:18:35,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:35,590 INFO L384 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 [2020-11-30 02:18:35,590 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:35,599 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:35,600 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:35,600 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 02:18:35,636 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:18:35,636 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:35,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:35,660 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:18:35,660 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:35,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:35,675 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:35,675 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-11-30 02:18:35,746 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-11-30 02:18:35,746 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:35,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:35,776 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2020-11-30 02:18:35,777 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:35,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:35,801 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:35,801 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-11-30 02:18:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:35,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:36,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386336809] [2020-11-30 02:18:36,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:36,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-11-30 02:18:36,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341057439] [2020-11-30 02:18:36,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:18:36,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:36,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:18:36,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:18:36,195 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand 10 states. [2020-11-30 02:18:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:38,565 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2020-11-30 02:18:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:18:38,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-11-30 02:18:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:38,568 INFO L225 Difference]: With dead ends: 170 [2020-11-30 02:18:38,568 INFO L226 Difference]: Without dead ends: 170 [2020-11-30 02:18:38,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-11-30 02:18:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-11-30 02:18:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2020-11-30 02:18:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 02:18:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2020-11-30 02:18:38,574 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 13 [2020-11-30 02:18:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:38,574 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2020-11-30 02:18:38,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:18:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2020-11-30 02:18:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 02:18:38,575 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:38,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:18:38,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 02:18:38,789 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:38,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1960329087, now seen corresponding path program 1 times [2020-11-30 02:18:38,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:38,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395730871] [2020-11-30 02:18:38,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:38,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:18:38,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:38,894 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:18:38,895 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:38,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:38,903 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:38,903 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-11-30 02:18:38,916 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-11-30 02:18:38,917 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:38,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:38,923 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:38,923 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-11-30 02:18:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:38,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:38,964 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2020-11-30 02:18:38,966 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 02:18:38,988 INFO L625 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2020-11-30 02:18:38,988 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-30 02:18:38,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2020-11-30 02:18:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:38,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395730871] [2020-11-30 02:18:38,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:38,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 02:18:38,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280554168] [2020-11-30 02:18:38,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:18:38,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:18:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:18:38,994 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 5 states. [2020-11-30 02:18:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:39,337 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2020-11-30 02:18:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:18:39,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-30 02:18:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:39,339 INFO L225 Difference]: With dead ends: 139 [2020-11-30 02:18:39,339 INFO L226 Difference]: Without dead ends: 139 [2020-11-30 02:18:39,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:18:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-30 02:18:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 100. [2020-11-30 02:18:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 02:18:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2020-11-30 02:18:39,343 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 16 [2020-11-30 02:18:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:39,343 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2020-11-30 02:18:39,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:18:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2020-11-30 02:18:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 02:18:39,344 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:39,344 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:18:39,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 02:18:39,545 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1960329083, now seen corresponding path program 1 times [2020-11-30 02:18:39,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:39,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560501065] [2020-11-30 02:18:39,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:39,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:18:39,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:39,673 INFO L384 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 [2020-11-30 02:18:39,674 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:39,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:39,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:39,691 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-30 02:18:39,721 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:18:39,721 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:39,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:39,727 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:39,727 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 02:18:39,749 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-11-30 02:18:39,749 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:39,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:39,751 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:39,752 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 02:18:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:39,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:39,771 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2020-11-30 02:18:39,772 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:18:39,794 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:39,795 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:18:39,795 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2020-11-30 02:18:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:40,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560501065] [2020-11-30 02:18:40,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:40,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2020-11-30 02:18:40,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993363812] [2020-11-30 02:18:40,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:18:40,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:40,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:18:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:18:40,023 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 6 states. [2020-11-30 02:18:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:40,487 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2020-11-30 02:18:40,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:18:40,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-30 02:18:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:40,488 INFO L225 Difference]: With dead ends: 131 [2020-11-30 02:18:40,489 INFO L226 Difference]: Without dead ends: 131 [2020-11-30 02:18:40,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:18:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-11-30 02:18:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2020-11-30 02:18:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 02:18:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2020-11-30 02:18:40,492 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 16 [2020-11-30 02:18:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:40,492 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2020-11-30 02:18:40,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:18:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2020-11-30 02:18:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 02:18:40,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:40,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:18:40,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 02:18:40,702 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1960329082, now seen corresponding path program 1 times [2020-11-30 02:18:40,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:40,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684907263] [2020-11-30 02:18:40,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:40,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 02:18:40,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:40,804 INFO L384 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 [2020-11-30 02:18:40,804 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:40,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:40,816 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:40,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-11-30 02:18:40,851 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:18:40,851 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:40,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:40,868 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:18:40,869 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:40,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:40,881 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:40,881 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-11-30 02:18:40,927 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-30 02:18:40,928 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:40,939 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:40,941 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-11-30 02:18:40,942 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:40,949 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:40,949 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:40,949 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-11-30 02:18:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:40,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:18:41,137 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2020-11-30 02:18:41,141 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 02:18:41,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:41,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:18:41,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:18:41,196 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:41,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:41,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:18:41,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:18:41,261 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:41,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:41,297 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-11-30 02:18:41,297 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:63, output treesize:21 [2020-11-30 02:18:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:18:41,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684907263] [2020-11-30 02:18:41,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:18:41,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:18:41,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544584029] [2020-11-30 02:18:41,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:18:41,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:18:41,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:18:41,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:18:41,380 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 8 states. [2020-11-30 02:18:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:18:43,187 INFO L93 Difference]: Finished difference Result 235 states and 251 transitions. [2020-11-30 02:18:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:18:43,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-30 02:18:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:18:43,190 INFO L225 Difference]: With dead ends: 235 [2020-11-30 02:18:43,190 INFO L226 Difference]: Without dead ends: 235 [2020-11-30 02:18:43,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:18:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-30 02:18:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 100. [2020-11-30 02:18:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 02:18:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2020-11-30 02:18:43,194 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 16 [2020-11-30 02:18:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:18:43,195 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2020-11-30 02:18:43,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:18:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2020-11-30 02:18:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 02:18:43,195 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:18:43,196 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:18:43,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 02:18:43,396 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:18:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:18:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2020-11-30 02:18:43,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:18:43,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033310107] [2020-11-30 02:18:43,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-11-30 02:18:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:18:43,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:18:43,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:18:43,513 INFO L384 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 [2020-11-30 02:18:43,514 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:43,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:43,516 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:43,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:18:43,540 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:43,541 INFO L384 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 19 treesize of output 41 [2020-11-30 02:18:43,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:18:43,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:18:43,547 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:43,563 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-11-30 02:18:43,563 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:43,563 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2020-11-30 02:18:43,579 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:18:43,579 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:18:43,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:18:43,610 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:18:43,611 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2020-11-30 02:19:22,662 WARN L193 SmtUtils]: Spent 38.99 s on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-11-30 02:19:22,663 INFO L350 Elim1Store]: treesize reduction 453, result has 33.6 percent of original size [2020-11-30 02:19:22,663 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 262 [2020-11-30 02:19:22,665 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-11-30 02:19:22,666 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:22,704 INFO L625 ElimStorePlain]: treesize reduction 138, result has 17.4 percent of original size [2020-11-30 02:19:22,704 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:19:22,704 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:139, output treesize:29 [2020-11-30 02:19:22,727 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-11-30 02:19:22,727 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:22,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:19:22,747 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:19:22,747 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:17 [2020-11-30 02:19:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:19:22,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:19:22,814 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:19:22,872 INFO L625 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2020-11-30 02:19:22,873 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-11-30 02:19:22,873 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:49 [2020-11-30 02:19:29,985 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 02:19:30,008 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:30,792 WARN L193 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2020-11-30 02:19:30,793 INFO L625 ElimStorePlain]: treesize reduction 2177, result has 6.5 percent of original size [2020-11-30 02:19:30,798 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:19:30,823 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:19:30,824 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:19:30,825 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:19:30,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:30,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:30,837 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:30,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:30,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:30,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:30,867 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:30,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:30,878 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:30,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:30,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:30,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:30,897 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:19:30,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:30,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:30,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:30,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:30,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:30,946 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:19:30,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:30,952 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:19:30,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:30,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:30,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:30,974 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 02:19:30,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:30,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 02:19:30,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:31,007 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:31,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:31,012 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:19:31,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:31,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:31,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:31,032 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:31,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:31,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:31,049 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 40 dim-0 vars, and 9 xjuncts. [2020-11-30 02:19:31,049 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:67, output treesize:1206 [2020-11-30 02:19:35,276 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 13 [2020-11-30 02:19:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:19:35,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033310107] [2020-11-30 02:19:35,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [527385261] [2020-11-30 02:19:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:19:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:19:35,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 02:19:35,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:19:35,573 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:19:35,573 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2020-11-30 02:19:35,574 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:35,587 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-30 02:19:35,588 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:19:35,588 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-11-30 02:19:35,620 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:19:35,620 INFO L384 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 19 treesize of output 41 [2020-11-30 02:19:35,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:19:35,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:19:35,625 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:35,652 INFO L625 ElimStorePlain]: treesize reduction 16, result has 51.5 percent of original size [2020-11-30 02:19:35,652 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:19:35,652 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2020-11-30 02:19:35,661 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:19:35,661 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:35,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:19:35,679 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:19:35,679 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2020-11-30 02:19:46,164 WARN L193 SmtUtils]: Spent 10.47 s on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2020-11-30 02:19:46,164 INFO L350 Elim1Store]: treesize reduction 521, result has 23.6 percent of original size [2020-11-30 02:19:46,165 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 194 [2020-11-30 02:19:46,166 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-30 02:19:46,167 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-11-30 02:19:46,168 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 02:19:46,169 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 02:19:46,232 INFO L625 ElimStorePlain]: treesize reduction 81, result has 26.4 percent of original size [2020-11-30 02:19:46,232 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:19:46,232 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:139, output treesize:29 [2020-11-30 02:19:46,244 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-11-30 02:19:46,245 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:46,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:19:46,256 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:19:46,256 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:17 [2020-11-30 02:19:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:19:46,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:19:46,267 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:19:46,354 INFO L625 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2020-11-30 02:19:46,355 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-11-30 02:19:46,355 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:49 [2020-11-30 02:19:48,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (ULTIMATE.start_create_data_~counter~0 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (let ((.cse0 (bvmul ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset|) v_DerPreprocessor_5) (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32)) v_DerPreprocessor_6) (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32)) v_DerPreprocessor_7) (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)) v_DerPreprocessor_8))) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1))) is different from false [2020-11-30 02:19:51,123 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:51,833 WARN L193 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2020-11-30 02:19:51,834 INFO L625 ElimStorePlain]: treesize reduction 2177, result has 6.5 percent of original size [2020-11-30 02:19:51,837 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:19:51,868 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:19:51,869 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:19:51,870 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:19:51,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,877 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:51,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,887 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:51,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,892 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:51,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,901 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:19:51,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:51,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,914 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:51,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,918 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:19:51,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:19:51,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:51,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:51,950 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 02:19:51,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:51,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 02:19:51,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,969 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:51,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,972 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:19:51,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:19:51,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,985 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:19:51,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:19:51,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:19:51,995 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 40 dim-0 vars, and 9 xjuncts. [2020-11-30 02:19:51,995 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:67, output treesize:1206 [2020-11-30 02:19:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-11-30 02:19:52,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881859455] [2020-11-30 02:19:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:19:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:19:52,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:19:52,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:19:52,200 INFO L384 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 [2020-11-30 02:19:52,201 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:52,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:19:52,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:19:52,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:19:52,241 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:19:52,241 INFO L384 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 19 treesize of output 41 [2020-11-30 02:19:52,242 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:52,260 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-11-30 02:19:52,260 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:19:52,260 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-11-30 02:19:52,265 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:19:52,266 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:19:52,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:19:52,277 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:19:52,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2020-11-30 02:20:04,860 WARN L193 SmtUtils]: Spent 12.56 s on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2020-11-30 02:20:04,860 INFO L350 Elim1Store]: treesize reduction 521, result has 23.6 percent of original size [2020-11-30 02:20:04,861 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 194 [2020-11-30 02:20:04,862 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 02:20:04,862 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:04,899 INFO L625 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2020-11-30 02:20:04,900 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:20:04,900 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:139, output treesize:29 [2020-11-30 02:20:04,915 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-11-30 02:20:04,915 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:04,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:20:04,926 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:20:04,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:17 [2020-11-30 02:20:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:20:04,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:04,937 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:20:05,026 INFO L625 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2020-11-30 02:20:05,027 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-11-30 02:20:05,027 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:49 [2020-11-30 02:20:10,637 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-30 02:20:17,288 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 02:20:17,303 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:18,015 WARN L193 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-11-30 02:20:18,016 INFO L625 ElimStorePlain]: treesize reduction 993, result has 13.2 percent of original size [2020-11-30 02:20:18,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:20:18,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:20:18,035 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:20:18,036 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:20:18,037 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:20:18,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:20:18,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:20:18,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:20:18,045 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:20:18,055 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:20:18,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:20:18,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:20:18,060 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:20:18,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:20:18,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:20:18,070 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:20:18,077 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:20:18,079 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:20:18,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:20:18,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:20:18,084 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:20:18,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:20:18,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 02:20:18,094 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:20:18,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:20:18,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:20:18,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:20:18,105 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:20:18,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:20:18,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:20:18,112 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:20:18,119 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 42 dim-0 vars, and 10 xjuncts. [2020-11-30 02:20:18,119 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:67, output treesize:770 [2020-11-30 02:20:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:18,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:20:18,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7, 7, 6, 7] total 16 [2020-11-30 02:20:18,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944172063] [2020-11-30 02:20:18,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 02:20:18,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:20:18,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 02:20:18,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=168, Unknown=7, NotChecked=28, Total=272 [2020-11-30 02:20:18,230 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 17 states. [2020-11-30 02:20:19,005 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-11-30 02:20:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:20,483 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2020-11-30 02:20:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:20:20,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-11-30 02:20:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:20,486 INFO L225 Difference]: With dead ends: 202 [2020-11-30 02:20:20,486 INFO L226 Difference]: Without dead ends: 202 [2020-11-30 02:20:20,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=116, Invalid=223, Unknown=7, NotChecked=34, Total=380 [2020-11-30 02:20:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-11-30 02:20:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 99. [2020-11-30 02:20:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-30 02:20:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2020-11-30 02:20:20,490 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 18 [2020-11-30 02:20:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:20,490 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2020-11-30 02:20:20,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 02:20:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2020-11-30 02:20:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 02:20:20,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:20,491 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:21,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:21,109 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:20:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2020-11-30 02:20:21,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:20:21,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977081768] [2020-11-30 02:20:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-11-30 02:20:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:21,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 02:20:21,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:21,330 INFO L384 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 [2020-11-30 02:20:21,330 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:20:21,333 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,333 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:20:21,339 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_76|], 1=[|v_#valid_102|]} [2020-11-30 02:20:21,342 INFO L384 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 [2020-11-30 02:20:21,342 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:20:21,365 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:20:21,365 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 02:20:21,366 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:20:21,387 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,388 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2020-11-30 02:20:21,412 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:20:21,412 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:20:21,447 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:20:21,447 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:20:21,466 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,466 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2020-11-30 02:20:21,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:20:21,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:20:21,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:20:21,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:20:21,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:20:21,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:20:21,599 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 13 [2020-11-30 02:20:21,600 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:20:21,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:00,760 WARN L193 SmtUtils]: Spent 39.10 s on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-11-30 02:21:00,768 INFO L350 Elim1Store]: treesize reduction 453, result has 33.6 percent of original size [2020-11-30 02:21:00,768 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 262 [2020-11-30 02:21:00,769 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 02:21:00,770 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 02:21:00,778 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 02:21:00,779 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 02:21:00,780 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-11-30 02:21:00,780 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 02:21:00,781 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 02:21:00,781 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 02:21:00,782 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 02:21:00,782 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-30 02:21:00,783 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 02:21:00,783 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-11-30 02:21:00,784 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 02:21:00,784 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 02:21:00,785 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 02:21:00,790 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2020-11-30 02:21:01,215 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 22 [2020-11-30 02:21:01,215 INFO L625 ElimStorePlain]: treesize reduction 1373, result has 2.4 percent of original size [2020-11-30 02:21:01,215 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:21:01,215 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:254, output treesize:34 [2020-11-30 02:21:01,251 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-11-30 02:21:01,252 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:01,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:01,270 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-11-30 02:21:01,270 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:01,279 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:01,280 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:21:01,280 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:14 [2020-11-30 02:21:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:21:01,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:21:01,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:21:01,812 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:21:01,835 INFO L545 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:21:03,282 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-11-30 02:21:03,283 INFO L625 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2020-11-30 02:21:03,362 INFO L545 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:21:03,381 INFO L545 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:21:03,876 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-11-30 02:21:03,876 INFO L625 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2020-11-30 02:21:03,878 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2020-11-30 02:21:03,878 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2020-11-30 02:21:14,406 WARN L193 SmtUtils]: Spent 4.94 s on a formula simplification that was a NOOP. DAG size: 68 [2020-11-30 02:21:16,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse0 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse3 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse3))) (store |c_#memory_$Pointer$.offset| .cse2 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse2) (bvadd .cse0 v_prenex_112) v_DerPreprocessor_13) (bvadd .cse0 v_prenex_112 (_ bv1 32)) v_DerPreprocessor_14) (bvadd .cse0 v_prenex_112 (_ bv2 32)) v_DerPreprocessor_15) (bvadd .cse0 v_prenex_112 (_ bv3 32)) v_DerPreprocessor_16))) c_ULTIMATE.start_create_data_~data~0.base) .cse3)))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32)))))) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse4 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32))) (.cse10 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse10)) (.cse6 (bvadd .cse4 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse7 (bvadd .cse4 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse8 (bvadd .cse4 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse9 (bvadd .cse4 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)))) (bvule (bvadd .cse4 (select (select (store |c_#memory_$Pointer$.offset| .cse5 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_18) .cse8 v_DerPreprocessor_19) .cse9 v_DerPreprocessor_20)) c_ULTIMATE.start_create_data_~data~0.base) .cse10) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse5 (store (store (store (store (select |c_#memory_$Pointer$.base| .cse5) .cse6 v_DerPreprocessor_25) .cse7 v_DerPreprocessor_26) .cse8 v_DerPreprocessor_27) .cse9 v_DerPreprocessor_28)) c_ULTIMATE.start_create_data_~data~0.base) .cse10))))))) is different from false [2020-11-30 02:21:18,564 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse2))) (store |c_#memory_$Pointer$.offset| .cse1 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse1) v_prenex_112 v_DerPreprocessor_13) (bvadd v_prenex_112 (_ bv1 32)) v_DerPreprocessor_14) (bvadd v_prenex_112 (_ bv2 32)) v_DerPreprocessor_15) (bvadd v_prenex_112 (_ bv3 32)) v_DerPreprocessor_16))) c_ULTIMATE.start_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse7 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse7)) (.cse4 (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse5 (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse6 (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse3) |ULTIMATE.start_create_data_#t~mem10.offset| v_DerPreprocessor_17) .cse4 v_DerPreprocessor_18) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_20)) c_ULTIMATE.start_create_data_~data~0.base) .cse7) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 (store (store (store (store (select |c_#memory_$Pointer$.base| .cse3) |ULTIMATE.start_create_data_#t~mem10.offset| v_DerPreprocessor_25) .cse4 v_DerPreprocessor_26) .cse5 v_DerPreprocessor_27) .cse6 v_DerPreprocessor_28)) c_ULTIMATE.start_create_data_~data~0.base) .cse7))))))) is different from false [2020-11-30 02:21:18,659 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:29,875 WARN L193 SmtUtils]: Spent 11.22 s on a formula simplification. DAG size of input: 136 DAG size of output: 98 [2020-11-30 02:21:29,876 INFO L625 ElimStorePlain]: treesize reduction 4826, result has 9.1 percent of original size [2020-11-30 02:21:29,905 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:34,868 WARN L193 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 230 DAG size of output: 91 [2020-11-30 02:21:34,868 INFO L625 ElimStorePlain]: treesize reduction 2455, result has 8.9 percent of original size [2020-11-30 02:21:34,896 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:40,255 WARN L193 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 190 DAG size of output: 115 [2020-11-30 02:21:40,256 INFO L625 ElimStorePlain]: treesize reduction 3935, result has 6.4 percent of original size [2020-11-30 02:21:40,257 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:21:40,263 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:21:40,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:21:40,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:21:40,266 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:21:40,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:21:40,267 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:21:40,278 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:21:40,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:21:40,283 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:21:40,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:21:40,290 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:21:40,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:21:40,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:21:40,294 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:21:40,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:21:40,302 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:21:40,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:21:40,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:21:40,315 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 02:21:40,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 02:21:40,317 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:21:40,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:21:40,322 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:21:40,325 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:21:40,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:21:40,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:21:40,333 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:21:40,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:21:40,335 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:21:40,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:21:40,338 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:21:40,341 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:21:40,365 INFO L545 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 44 dim-0 vars, and 10 xjuncts. [2020-11-30 02:21:40,365 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:631 [2020-11-30 02:21:41,204 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 15 [2020-11-30 02:21:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-11-30 02:21:41,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977081768] [2020-11-30 02:21:41,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [50945739] [2020-11-30 02:21:41,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:21:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:21:41,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 02:21:41,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:21:41,460 INFO L384 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 [2020-11-30 02:21:41,460 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:41,462 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,462 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:21:41,464 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_79|], 1=[|v_#valid_106|]} [2020-11-30 02:21:41,467 INFO L384 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 [2020-11-30 02:21:41,468 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:41,485 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:41,485 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 02:21:41,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:21:41,487 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:41,495 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,495 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2020-11-30 02:21:41,503 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:21:41,503 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:41,522 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:21:41,522 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:21:41,535 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,535 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2020-11-30 02:21:41,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:21:41,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:21:41,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:21:41,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:21:41,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:21:41,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:21:41,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:21:41,570 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 13 [2020-11-30 02:21:41,570 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:21:41,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:22:20,529 WARN L193 SmtUtils]: Spent 38.91 s on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-11-30 02:22:20,530 INFO L350 Elim1Store]: treesize reduction 453, result has 33.6 percent of original size [2020-11-30 02:22:20,530 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 262 [2020-11-30 02:22:20,531 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-11-30 02:22:20,531 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:22:20,635 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 21 [2020-11-30 02:22:20,635 INFO L625 ElimStorePlain]: treesize reduction 138, result has 19.8 percent of original size [2020-11-30 02:22:20,635 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:22:20,636 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:254, output treesize:34 [2020-11-30 02:22:20,697 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-11-30 02:22:20,697 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:22:20,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:22:20,723 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-11-30 02:22:20,723 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:22:20,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:22:20,738 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:22:20,738 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:14 [2020-11-30 02:22:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:22:20,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:22:20,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:22:20,767 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:22:20,789 INFO L545 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:22:22,029 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-11-30 02:22:22,029 INFO L625 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2020-11-30 02:22:22,061 INFO L545 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:22:22,125 INFO L545 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:22:22,781 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-11-30 02:22:22,781 INFO L625 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2020-11-30 02:22:22,783 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2020-11-30 02:22:22,783 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2020-11-30 02:22:46,442 WARN L193 SmtUtils]: Spent 8.63 s on a formula simplification that was a NOOP. DAG size: 68 [2020-11-30 02:23:07,269 WARN L193 SmtUtils]: Spent 4.54 s on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 02:23:09,316 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_31 (_ BitVec 32)) (v_DerPreprocessor_32 (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse2))) (store |c_#memory_$Pointer$.offset| .cse1 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse1) |ULTIMATE.start_create_data_#t~mem10.offset| v_DerPreprocessor_29) (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32)) v_DerPreprocessor_30) (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32)) v_DerPreprocessor_31) (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)) v_DerPreprocessor_32))) c_ULTIMATE.start_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_prenex_151 (_ BitVec 32)) (v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_35 (_ BitVec 32)) (v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_33 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32)) (v_DerPreprocessor_37 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (let ((.cse7 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse7)) (.cse4 (bvadd v_prenex_151 (_ bv1 32))) (.cse5 (bvadd v_prenex_151 (_ bv2 32))) (.cse6 (bvadd v_prenex_151 (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse3) v_prenex_151 v_DerPreprocessor_33) .cse4 v_DerPreprocessor_34) .cse5 v_DerPreprocessor_35) .cse6 v_DerPreprocessor_36)) c_ULTIMATE.start_create_data_~data~0.base) .cse7) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 (store (store (store (store (select |c_#memory_$Pointer$.base| .cse3) v_prenex_151 v_DerPreprocessor_37) .cse4 v_DerPreprocessor_38) .cse5 v_DerPreprocessor_39) .cse6 v_DerPreprocessor_40)) c_ULTIMATE.start_create_data_~data~0.base) .cse7))))))) is different from false [2020-11-30 02:23:09,382 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:23:35,012 WARN L193 SmtUtils]: Spent 25.63 s on a formula simplification. DAG size of input: 259 DAG size of output: 98 [2020-11-30 02:23:35,013 INFO L625 ElimStorePlain]: treesize reduction 20458, result has 2.3 percent of original size [2020-11-30 02:23:35,056 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:23:43,045 WARN L193 SmtUtils]: Spent 7.99 s on a formula simplification. DAG size of input: 214 DAG size of output: 122 [2020-11-30 02:23:43,046 INFO L625 ElimStorePlain]: treesize reduction 3999, result has 11.4 percent of original size [2020-11-30 02:23:43,105 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 02:23:54,653 WARN L193 SmtUtils]: Spent 11.55 s on a formula simplification. DAG size of input: 683 DAG size of output: 113 [2020-11-30 02:23:54,654 INFO L625 ElimStorePlain]: treesize reduction 83035, result has 0.3 percent of original size [2020-11-30 02:23:54,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:54,695 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:23:54,696 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:23:54,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:54,699 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:23:54,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:54,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:54,706 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:23:54,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:54,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:23:54,714 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:23:54,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:54,722 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:23:54,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:23:54,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 02:23:54,728 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:23:54,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:54,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:23:54,741 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:23:54,747 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:23:54,747 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:23:54,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:54,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:54,752 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:23:54,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:54,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:54,759 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:23:54,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:54,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:54,765 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:23:54,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:54,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:23:54,774 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:23:54,781 INFO L545 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 82 dim-0 vars, and 11 xjuncts. [2020-11-30 02:23:54,781 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:927 [2020-11-30 02:23:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:55,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143956838] [2020-11-30 02:23:55,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:55,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 02:23:55,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:23:55,926 INFO L384 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 [2020-11-30 02:23:55,926 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:23:55,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:23:55,928 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:23:55,928 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:23:55,932 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_82|], 1=[|v_#valid_110|]} [2020-11-30 02:23:55,935 INFO L384 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 [2020-11-30 02:23:55,936 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:23:55,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:23:55,952 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:23:55,953 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 02:23:55,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:23:55,955 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:23:55,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:23:55,962 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:23:55,962 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2020-11-30 02:23:55,970 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:23:55,970 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:23:55,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:23:55,992 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 02:23:55,992 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:23:56,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:23:56,007 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:23:56,007 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2020-11-30 02:24:35,661 WARN L193 SmtUtils]: Spent 39.63 s on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-11-30 02:24:35,662 INFO L350 Elim1Store]: treesize reduction 453, result has 33.6 percent of original size [2020-11-30 02:24:35,662 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 242 treesize of output 336 [2020-11-30 02:24:35,663 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-30 02:24:35,663 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-11-30 02:24:35,664 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 7 disjuncts [2020-11-30 02:24:35,665 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 02:24:43,955 WARN L193 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-11-30 02:24:43,956 INFO L625 ElimStorePlain]: treesize reduction 577, result has 20.0 percent of original size [2020-11-30 02:24:43,978 INFO L350 Elim1Store]: treesize reduction 331, result has 0.3 percent of original size [2020-11-30 02:24:43,978 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 13 [2020-11-30 02:24:43,979 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:24:43,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:24:43,992 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:24:43,992 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:254, output treesize:34 [2020-11-30 02:24:44,041 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-11-30 02:24:44,042 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:24:44,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:24:44,063 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-11-30 02:24:44,063 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:24:44,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:24:44,074 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:24:44,075 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:14 [2020-11-30 02:24:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:24:44,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:24:44,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:24:44,139 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:24:44,180 INFO L545 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:24:44,727 WARN L193 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2020-11-30 02:24:44,728 INFO L625 ElimStorePlain]: treesize reduction 262, result has 47.4 percent of original size [2020-11-30 02:24:44,752 INFO L545 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:24:44,778 INFO L545 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 02:24:45,335 WARN L193 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-11-30 02:24:45,336 INFO L625 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2020-11-30 02:24:45,337 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2020-11-30 02:24:45,337 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2020-11-30 02:25:14,299 WARN L193 SmtUtils]: Spent 4.53 s on a formula simplification that was a NOOP. DAG size: 68 [2020-11-30 02:25:16,325 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (v_prenex_228 (_ BitVec 32)) (v_DerPreprocessor_57 (_ BitVec 32)) (v_DerPreprocessor_58 (_ BitVec 32)) (v_DerPreprocessor_59 (_ BitVec 32))) (let ((.cse0 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse3 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse3))) (store |c_#memory_$Pointer$.offset| .cse2 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse2) (bvadd .cse0 v_prenex_228) v_DerPreprocessor_57) (bvadd .cse0 v_prenex_228 (_ bv1 32)) v_DerPreprocessor_58) (bvadd .cse0 v_prenex_228 (_ bv2 32)) v_DerPreprocessor_59) (bvadd .cse0 v_prenex_228 (_ bv3 32)) v_DerPreprocessor_60))) c_ULTIMATE.start_create_data_~data~0.base) .cse3)))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32)))))) (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_56 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse4 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32))) (.cse10 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse10)) (.cse6 (bvadd .cse4 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse7 (bvadd .cse4 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse8 (bvadd .cse4 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse9 (bvadd .cse4 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)))) (bvule (bvadd .cse4 (select (select (store |c_#memory_$Pointer$.offset| .cse5 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_DerPreprocessor_53) .cse7 v_DerPreprocessor_54) .cse8 v_DerPreprocessor_55) .cse9 v_DerPreprocessor_56)) c_ULTIMATE.start_create_data_~data~0.base) .cse10) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse5 (store (store (store (store (select |c_#memory_$Pointer$.base| .cse5) .cse6 v_DerPreprocessor_45) .cse7 v_DerPreprocessor_46) .cse8 v_DerPreprocessor_47) .cse9 v_DerPreprocessor_48)) c_ULTIMATE.start_create_data_~data~0.base) .cse10))))))) is different from false [2020-11-30 02:25:41,908 WARN L193 SmtUtils]: Spent 2.65 s on a formula simplification that was a NOOP. DAG size: 65 [2020-11-30 02:25:42,065 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:25:50,659 WARN L193 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2020-11-30 02:25:50,660 INFO L625 ElimStorePlain]: treesize reduction 3935, result has 5.8 percent of original size [2020-11-30 02:25:50,690 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:26:00,159 WARN L193 SmtUtils]: Spent 9.47 s on a formula simplification. DAG size of input: 184 DAG size of output: 123 [2020-11-30 02:26:00,160 INFO L625 ElimStorePlain]: treesize reduction 4836, result has 9.6 percent of original size [2020-11-30 02:26:00,202 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 02:26:06,997 WARN L193 SmtUtils]: Spent 6.79 s on a formula simplification. DAG size of input: 326 DAG size of output: 111 [2020-11-30 02:26:06,997 INFO L625 ElimStorePlain]: treesize reduction 5095, result has 5.0 percent of original size [2020-11-30 02:26:07,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:26:07,020 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:26:07,021 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:26:07,023 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:26:07,024 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:26:07,051 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,064 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:26:07,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 02:26:07,067 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 02:26:07,094 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:26:07,095 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:26:07,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,101 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:26:07,115 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,124 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,125 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,126 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:26:07,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:26:07,128 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:26:07,135 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:26:07,142 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:26:07,152 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:26:07,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:26:07,156 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:26:07,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:26:07,169 INFO L545 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 58 dim-0 vars, and 11 xjuncts. [2020-11-30 02:26:07,170 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:615 [2020-11-30 02:26:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-11-30 02:26:07,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:26:07,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9, 8, 9] total 21 [2020-11-30 02:26:07,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637135229] [2020-11-30 02:26:07,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 02:26:07,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:26:07,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 02:26:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=226, Unknown=33, NotChecked=140, Total=462 [2020-11-30 02:26:07,972 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 22 states. [2020-11-30 02:26:19,937 WARN L193 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 132 DAG size of output: 32 [2020-11-30 02:26:23,000 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse9))) (and (not (= .cse0 c_ULTIMATE.start_create_data_~data~0.base)) (= (bvadd (select |c_#valid| c_ULTIMATE.start_create_data_~data~0.base) (_ bv1 1)) (_ bv0 1)) (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse1 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse4))) (store |c_#memory_$Pointer$.offset| .cse3 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse3) (bvadd .cse1 v_prenex_112) v_DerPreprocessor_13) (bvadd .cse1 v_prenex_112 (_ bv1 32)) v_DerPreprocessor_14) (bvadd .cse1 v_prenex_112 (_ bv2 32)) v_DerPreprocessor_15) (bvadd .cse1 v_prenex_112 (_ bv3 32)) v_DerPreprocessor_16))) c_ULTIMATE.start_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (v_prenex_228 (_ BitVec 32)) (v_DerPreprocessor_57 (_ BitVec 32)) (v_DerPreprocessor_58 (_ BitVec 32)) (v_DerPreprocessor_59 (_ BitVec 32))) (let ((.cse5 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse6 (let ((.cse8 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse8))) (store |c_#memory_$Pointer$.offset| .cse7 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse7) (bvadd .cse5 v_prenex_228) v_DerPreprocessor_57) (bvadd .cse5 v_prenex_228 (_ bv1 32)) v_DerPreprocessor_58) (bvadd .cse5 v_prenex_228 (_ bv2 32)) v_DerPreprocessor_59) (bvadd .cse5 v_prenex_228 (_ bv3 32)) v_DerPreprocessor_60))) c_ULTIMATE.start_create_data_~data~0.base) .cse8)))) (bvule (bvadd .cse5 .cse6 (_ bv4 32)) (bvadd .cse5 .cse6 (_ bv8 32)))))) (= (_ bv0 32) c_ULTIMATE.start_create_data_~counter~0) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_data_~data~0.base) .cse9)) (not (= c_ULTIMATE.start_create_data_~data~0.base |c_ULTIMATE.start_create_data_#t~malloc8.base|)) (= (_ bv80 32) (select |c_#length| .cse0)) (= |c_ULTIMATE.start_create_data_#t~malloc8.offset| (_ bv0 32)) (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_56 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse10 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32))) (.cse16 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse16)) (.cse12 (bvadd .cse10 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse13 (bvadd .cse10 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse14 (bvadd .cse10 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse15 (bvadd .cse10 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)))) (bvule (bvadd .cse10 (select (select (store |c_#memory_$Pointer$.offset| .cse11 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse11) .cse12 v_DerPreprocessor_53) .cse13 v_DerPreprocessor_54) .cse14 v_DerPreprocessor_55) .cse15 v_DerPreprocessor_56)) c_ULTIMATE.start_create_data_~data~0.base) .cse16) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse11 (store (store (store (store (select |c_#memory_$Pointer$.base| .cse11) .cse12 v_DerPreprocessor_45) .cse13 v_DerPreprocessor_46) .cse14 v_DerPreprocessor_47) .cse15 v_DerPreprocessor_48)) c_ULTIMATE.start_create_data_~data~0.base) .cse16)))))) (= (_ bv80 32) (select |c_#length| |c_ULTIMATE.start_create_data_#t~malloc8.base|)) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse17 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32))) (.cse23 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse23)) (.cse19 (bvadd .cse17 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse20 (bvadd .cse17 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse21 (bvadd .cse17 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse22 (bvadd .cse17 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)))) (bvule (bvadd .cse17 (select (select (store |c_#memory_$Pointer$.offset| .cse18 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse18) .cse19 v_DerPreprocessor_17) .cse20 v_DerPreprocessor_18) .cse21 v_DerPreprocessor_19) .cse22 v_DerPreprocessor_20)) c_ULTIMATE.start_create_data_~data~0.base) .cse23) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse18 (store (store (store (store (select |c_#memory_$Pointer$.base| .cse18) .cse19 v_DerPreprocessor_25) .cse20 v_DerPreprocessor_26) .cse21 v_DerPreprocessor_27) .cse22 v_DerPreprocessor_28)) c_ULTIMATE.start_create_data_~data~0.base) .cse23))))))))) is different from true [2020-11-30 02:26:36,866 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse10))) (and (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32)) (v_DerPreprocessor_56 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse0 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse1 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse2 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse3 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse4 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32))) (.cse5 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse1 v_DerPreprocessor_53) .cse2 v_DerPreprocessor_54) .cse3 v_DerPreprocessor_55) .cse4 v_DerPreprocessor_56)) c_ULTIMATE.start_create_data_~data~0.base) .cse5) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse1 v_DerPreprocessor_45) .cse2 v_DerPreprocessor_46) .cse3 v_DerPreprocessor_47) .cse4 v_DerPreprocessor_48)) c_ULTIMATE.start_create_data_~data~0.base) .cse5)))))) (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (v_prenex_228 (_ BitVec 32)) (v_DerPreprocessor_57 (_ BitVec 32)) (v_DerPreprocessor_58 (_ BitVec 32)) (v_DerPreprocessor_59 (_ BitVec 32))) (let ((.cse6 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse6 v_prenex_228) v_DerPreprocessor_57) (bvadd .cse6 v_prenex_228 (_ bv1 32)) v_DerPreprocessor_58) (bvadd .cse6 v_prenex_228 (_ bv2 32)) v_DerPreprocessor_59) (bvadd .cse6 v_prenex_228 (_ bv3 32)) v_DerPreprocessor_60)) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd .cse6 .cse7 (_ bv4 32)) (bvadd .cse6 .cse7 (_ bv8 32)))))) (= (bvadd (select |c_#valid| c_ULTIMATE.start_create_data_~data~0.base) (_ bv1 1)) (_ bv0 1)) (forall ((v_DerPreprocessor_31 (_ BitVec 32)) (v_DerPreprocessor_32 (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (let ((.cse8 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse8 |ULTIMATE.start_create_data_#t~mem10.offset|) v_DerPreprocessor_29) (bvadd .cse8 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32)) v_DerPreprocessor_30) (bvadd .cse8 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32)) v_DerPreprocessor_31) (bvadd .cse8 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)) v_DerPreprocessor_32)) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd .cse8 .cse9 (_ bv4 32)) (bvadd .cse8 .cse9 (_ bv8 32)))))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_data_~data~0.base) .cse10)) (= (bvadd c_ULTIMATE.start_create_data_~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv80 32) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem10.base|)) (not (= .cse11 c_ULTIMATE.start_create_data_~data~0.base)) (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_prenex_112 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse13 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse13 v_prenex_112) v_DerPreprocessor_13) (bvadd .cse13 v_prenex_112 (_ bv1 32)) v_DerPreprocessor_14) (bvadd .cse13 v_prenex_112 (_ bv2 32)) v_DerPreprocessor_15) (bvadd .cse13 v_prenex_112 (_ bv3 32)) v_DerPreprocessor_16)) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd .cse12 .cse13 (_ bv4 32)) (bvadd .cse12 .cse13 (_ bv8 32)))))) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse14 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse15 (bvadd .cse14 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse16 (bvadd .cse14 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse17 (bvadd .cse14 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse18 (bvadd .cse14 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32))) (.cse19 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd .cse14 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse15 v_DerPreprocessor_17) .cse16 v_DerPreprocessor_18) .cse17 v_DerPreprocessor_19) .cse18 v_DerPreprocessor_20)) c_ULTIMATE.start_create_data_~data~0.base) .cse19) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse15 v_DerPreprocessor_25) .cse16 v_DerPreprocessor_26) .cse17 v_DerPreprocessor_27) .cse18 v_DerPreprocessor_28)) c_ULTIMATE.start_create_data_~data~0.base) .cse19)))))) (= (_ bv80 32) (select |c_#length| .cse11)) (forall ((v_prenex_151 (_ BitVec 32)) (v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_35 (_ BitVec 32)) (v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_33 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32)) (v_DerPreprocessor_37 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (let ((.cse20 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse21 (bvadd .cse20 v_prenex_151)) (.cse22 (bvadd .cse20 v_prenex_151 (_ bv1 32))) (.cse23 (bvadd .cse20 v_prenex_151 (_ bv2 32))) (.cse24 (bvadd .cse20 v_prenex_151 (_ bv3 32))) (.cse25 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd .cse20 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse21 v_DerPreprocessor_33) .cse22 v_DerPreprocessor_34) .cse23 v_DerPreprocessor_35) .cse24 v_DerPreprocessor_36)) c_ULTIMATE.start_create_data_~data~0.base) .cse25) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse21 v_DerPreprocessor_37) .cse22 v_DerPreprocessor_38) .cse23 v_DerPreprocessor_39) .cse24 v_DerPreprocessor_40)) c_ULTIMATE.start_create_data_~data~0.base) .cse25)))))) (= (_ bv0 32) |c_ULTIMATE.start_create_data_#t~mem10.offset|)))) is different from true [2020-11-30 02:26:46,393 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 02:27:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:27:13,837 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2020-11-30 02:27:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 02:27:13,844 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 18 [2020-11-30 02:27:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:27:13,845 INFO L225 Difference]: With dead ends: 161 [2020-11-30 02:27:13,845 INFO L226 Difference]: Without dead ends: 161 [2020-11-30 02:27:13,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 136.8s TimeCoverageRelationStatistics Valid=133, Invalid=505, Unknown=36, NotChecked=318, Total=992 [2020-11-30 02:27:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-30 02:27:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 109. [2020-11-30 02:27:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-30 02:27:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2020-11-30 02:27:13,852 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 18 [2020-11-30 02:27:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:27:13,853 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2020-11-30 02:27:13,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 02:27:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2020-11-30 02:27:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 02:27:13,854 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:27:13,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:27:14,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:27:14,467 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:27:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:27:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1493326340, now seen corresponding path program 1 times [2020-11-30 02:27:14,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:27:14,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327105723] [2020-11-30 02:27:14,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-11-30 02:27:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:27:14,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:27:14,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:27:14,603 INFO L384 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 [2020-11-30 02:27:14,603 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:14,620 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:14,620 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:14,621 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-30 02:27:14,662 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:14,662 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:14,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:14,678 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:14,679 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 02:27:14,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-11-30 02:27:14,694 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:14,697 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:14,697 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:14,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 02:27:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:27:14,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:27:14,734 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2020-11-30 02:27:14,735 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:14,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:14,778 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:14,778 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2020-11-30 02:27:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:27:14,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327105723] [2020-11-30 02:27:14,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:27:14,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2020-11-30 02:27:14,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400179699] [2020-11-30 02:27:14,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:27:14,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:27:14,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:27:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:27:14,952 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 6 states. [2020-11-30 02:27:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:27:15,472 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2020-11-30 02:27:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:27:15,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-30 02:27:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:27:15,474 INFO L225 Difference]: With dead ends: 144 [2020-11-30 02:27:15,474 INFO L226 Difference]: Without dead ends: 144 [2020-11-30 02:27:15,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:27:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-30 02:27:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 109. [2020-11-30 02:27:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-30 02:27:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2020-11-30 02:27:15,478 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 19 [2020-11-30 02:27:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:27:15,478 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2020-11-30 02:27:15,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:27:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2020-11-30 02:27:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 02:27:15,479 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:27:15,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:27:15,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-11-30 02:27:15,690 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:27:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:27:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1493326339, now seen corresponding path program 1 times [2020-11-30 02:27:15,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:27:15,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048591817] [2020-11-30 02:27:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-11-30 02:27:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:27:15,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 02:27:15,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:27:15,839 INFO L384 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 [2020-11-30 02:27:15,839 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:15,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:15,851 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:15,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-11-30 02:27:15,876 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:15,876 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:15,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:15,891 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:15,892 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:15,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:15,901 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:15,901 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-11-30 02:27:15,920 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-30 02:27:15,920 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:15,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:15,933 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-11-30 02:27:15,933 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:15,939 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:15,939 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:15,939 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-11-30 02:27:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:27:15,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:27:16,086 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2020-11-30 02:27:16,090 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 02:27:16,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:16,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:27:16,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:27:16,133 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:16,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:16,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:27:16,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:27:16,165 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:16,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:16,189 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-11-30 02:27:16,189 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2020-11-30 02:27:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:27:16,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048591817] [2020-11-30 02:27:16,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:27:16,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:27:16,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055942474] [2020-11-30 02:27:16,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:27:16,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:27:16,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:27:16,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:27:16,256 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 8 states. [2020-11-30 02:27:17,509 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-11-30 02:27:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:27:17,873 INFO L93 Difference]: Finished difference Result 239 states and 256 transitions. [2020-11-30 02:27:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:27:17,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-11-30 02:27:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:27:17,876 INFO L225 Difference]: With dead ends: 239 [2020-11-30 02:27:17,876 INFO L226 Difference]: Without dead ends: 239 [2020-11-30 02:27:17,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:27:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-11-30 02:27:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 108. [2020-11-30 02:27:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-30 02:27:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2020-11-30 02:27:17,881 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 19 [2020-11-30 02:27:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:27:17,881 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2020-11-30 02:27:17,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:27:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2020-11-30 02:27:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 02:27:17,882 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:27:17,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:27:18,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-11-30 02:27:18,086 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 02:27:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:27:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash -413674294, now seen corresponding path program 1 times [2020-11-30 02:27:18,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:27:18,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784805888] [2020-11-30 02:27:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-11-30 02:27:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:27:18,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-30 02:27:18,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:27:18,249 INFO L384 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 [2020-11-30 02:27:18,249 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,253 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,253 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:27:18,272 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,272 INFO L384 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 11 treesize of output 15 [2020-11-30 02:27:18,273 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,286 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,286 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,286 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-30 02:27:18,379 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:18,379 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,399 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,404 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:18,404 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,420 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,420 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2020-11-30 02:27:18,459 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 02:27:18,459 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,483 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 02:27:18,483 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,500 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,500 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2020-11-30 02:27:18,574 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2020-11-30 02:27:18,575 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:18,588 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,599 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,599 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2020-11-30 02:27:18,600 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 02:27:18,601 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:18,606 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:18,606 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2020-11-30 02:27:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:27:18,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:27:18,834 INFO L441 ElimStorePlain]: Different costs {2=[v_prenex_283, |#memory_$Pointer$.base|], 6=[|#memory_$Pointer$.offset|, v_prenex_284]} [2020-11-30 02:27:18,923 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 290 [2020-11-30 02:27:18,924 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:20,070 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 67 [2020-11-30 02:27:20,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:20,103 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 290 [2020-11-30 02:27:20,104 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:21,113 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 76 [2020-11-30 02:27:21,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:22,799 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 166 DAG size of output: 112 [2020-11-30 02:27:22,799 INFO L350 Elim1Store]: treesize reduction 198, result has 55.2 percent of original size [2020-11-30 02:27:22,800 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 8785 treesize of output 8264 [2020-11-30 02:27:22,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784805888] [2020-11-30 02:27:22,805 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-11-30 02:27:22,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1717558024] [2020-11-30 02:27:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:27:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:27:23,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-30 02:27:23,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:27:23,374 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:23,374 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:23,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:23,412 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:23,412 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:23,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:23,437 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:23,437 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2020-11-30 02:27:23,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:27:23,544 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 02:27:23,544 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:23,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:23,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:27:23,587 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 02:27:23,588 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:23,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:23,622 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:23,622 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:44 [2020-11-30 02:27:23,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:27:23,885 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2020-11-30 02:27:23,886 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:23,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:23,917 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:23,917 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2020-11-30 02:27:23,917 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 02:27:23,918 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 02:27:23,919 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:23,953 INFO L625 ElimStorePlain]: treesize reduction 12, result has 52.0 percent of original size [2020-11-30 02:27:23,955 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:23,955 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2020-11-30 02:27:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:27:23,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:27:23,969 INFO L441 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, v_prenex_286], 6=[|#memory_$Pointer$.offset|, v_prenex_287]} [2020-11-30 02:27:24,048 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 290 [2020-11-30 02:27:24,049 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:25,088 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 02:27:25,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:25,141 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 606 treesize of output 598 [2020-11-30 02:27:25,141 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:27:25,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:27:25,143 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:27:25,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:27:25,144 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:27,903 WARN L193 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-11-30 02:27:27,904 INFO L625 ElimStorePlain]: treesize reduction 385, result has 56.7 percent of original size [2020-11-30 02:27:28,970 WARN L193 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 96 [2020-11-30 02:27:28,971 INFO L350 Elim1Store]: treesize reduction 154, result has 56.6 percent of original size [2020-11-30 02:27:28,971 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 4967 treesize of output 4643 [2020-11-30 02:27:28,973 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-11-30 02:27:28,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295463666] [2020-11-30 02:27:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd800591-7051-4abe-9667-a178175662e5/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:27:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:27:29,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-30 02:27:29,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:27:29,050 INFO L384 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 [2020-11-30 02:27:29,050 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,052 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,052 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,052 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:27:29,063 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,063 INFO L384 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 11 treesize of output 15 [2020-11-30 02:27:29,063 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,073 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,073 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-30 02:27:29,089 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:29,089 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,119 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:27:29,119 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,134 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2020-11-30 02:27:29,144 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 02:27:29,144 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,196 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 02:27:29,196 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,219 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,219 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2020-11-30 02:27:29,230 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2020-11-30 02:27:29,231 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:29,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,266 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,266 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2020-11-30 02:27:29,267 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 02:27:29,268 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,274 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:29,275 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:27:29,275 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2020-11-30 02:27:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:27:29,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:27:29,291 INFO L441 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, v_prenex_289], 6=[|#memory_$Pointer$.offset|, v_prenex_290]} [2020-11-30 02:27:29,379 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 290 [2020-11-30 02:27:29,380 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:30,428 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 02:27:30,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:27:30,463 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 606 treesize of output 598 [2020-11-30 02:27:30,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:27:30,464 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:27:30,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:27:30,466 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:27:30,467 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:27:33,479 WARN L193 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-11-30 02:27:33,480 INFO L625 ElimStorePlain]: treesize reduction 385, result has 56.7 percent of original size [2020-11-30 02:27:34,651 WARN L193 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 96 [2020-11-30 02:27:34,651 INFO L350 Elim1Store]: treesize reduction 154, result has 56.6 percent of original size [2020-11-30 02:27:34,652 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 6048 treesize of output 5724 [2020-11-30 02:27:34,654 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-11-30 02:27:34,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:27:34,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-30 02:27:34,655 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-11-30 02:27:34,655 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:27:35,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:27:35,275 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-30 02:27:35,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:27:35 BoogieIcfgContainer [2020-11-30 02:27:35,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:27:35,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:27:35,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:27:35,276 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:27:35,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:17:55" (3/4) ... [2020-11-30 02:27:35,281 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 02:27:35,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:27:35,282 INFO L168 Benchmark]: Toolchain (without parser) took 581403.05 ms. Allocated memory was 58.7 MB in the beginning and 94.4 MB in the end (delta: 35.7 MB). Free memory was 36.0 MB in the beginning and 63.7 MB in the end (delta: -27.7 MB). Peak memory consumption was 8.3 MB. Max. memory is 16.1 GB. [2020-11-30 02:27:35,283 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 58.7 MB. Free memory is still 40.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:27:35,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.10 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 35.8 MB in the beginning and 54.9 MB in the end (delta: -19.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2020-11-30 02:27:35,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.85 ms. Allocated memory is still 75.5 MB. Free memory was 54.9 MB in the beginning and 52.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:27:35,284 INFO L168 Benchmark]: Boogie Preprocessor took 66.18 ms. Allocated memory is still 75.5 MB. Free memory was 52.5 MB in the beginning and 50.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:27:35,285 INFO L168 Benchmark]: RCFGBuilder took 1118.89 ms. Allocated memory is still 75.5 MB. Free memory was 50.7 MB in the beginning and 54.9 MB in the end (delta: -4.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:27:35,285 INFO L168 Benchmark]: TraceAbstraction took 579515.08 ms. Allocated memory was 75.5 MB in the beginning and 94.4 MB in the end (delta: 18.9 MB). Free memory was 54.3 MB in the beginning and 64.6 MB in the end (delta: -10.2 MB). Peak memory consumption was 52.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:27:35,285 INFO L168 Benchmark]: Witness Printer took 5.07 ms. Allocated memory is still 94.4 MB. Free memory was 64.6 MB in the beginning and 63.7 MB in the end (delta: 944.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:27:35,287 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.25 ms. Allocated memory is still 58.7 MB. Free memory is still 40.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 602.10 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 35.8 MB in the beginning and 54.9 MB in the end (delta: -19.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 84.85 ms. Allocated memory is still 75.5 MB. Free memory was 54.9 MB in the beginning and 52.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.18 ms. Allocated memory is still 75.5 MB. Free memory was 52.5 MB in the beginning and 50.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1118.89 ms. Allocated memory is still 75.5 MB. Free memory was 50.7 MB in the beginning and 54.9 MB in the end (delta: -4.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 579515.08 ms. Allocated memory was 75.5 MB in the beginning and 94.4 MB in the end (delta: 18.9 MB). Free memory was 54.3 MB in the beginning and 64.6 MB in the end (delta: -10.2 MB). Peak memory consumption was 52.7 MB. Max. memory is 16.1 GB. * Witness Printer took 5.07 ms. Allocated memory is still 94.4 MB. Free memory was 64.6 MB in the beginning and 63.7 MB in the end (delta: 944.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L582] struct node_t *list = ((void *)0); [L583] int dataNotFinished = 0; [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR \read(**pointerToList) [L577] node->next = *pointerToList [L550] COND TRUE __VERIFIER_nondet_int() [L551] return ((void *)0); [L578] node->data = create_data() [L579] *pointerToList = node [L586] COND FALSE !(__VERIFIER_nondet_int()) [L587] \read(*list) [L587] COND TRUE \read(*list) [L588] EXPR \read(*list) [L588] EXPR list->next [L588] struct node_t *next = list->next; [L589] EXPR \read(*list) [L589] list->data [L567] COND FALSE !(data == ((void *)0)) [L570] data->array - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 97 locations, 46 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 579.3s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 101.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1137 SDtfs, 3283 SDslu, 3307 SDs, 0 SdLazy, 3618 SolverSat, 185 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 76.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 361 SyntacticMatches, 30 SemanticMatches, 130 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 182.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1204 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 454.4s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 474 ConstructedInterpolants, 58 QuantifiedInterpolants, 147736 SizeOfPredicates, 195 NumberOfNonLiveVariables, 1572 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 PerfectInterpolantSequences, 6/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...