./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version de1bb103 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-de1bb10 [2019-11-27 13:26:32,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 13:26:32,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 13:26:32,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 13:26:32,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 13:26:32,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 13:26:32,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 13:26:32,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 13:26:32,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 13:26:32,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 13:26:32,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 13:26:32,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 13:26:32,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 13:26:32,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 13:26:32,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 13:26:32,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 13:26:32,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 13:26:32,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 13:26:32,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 13:26:32,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 13:26:32,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 13:26:32,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 13:26:32,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 13:26:32,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 13:26:32,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 13:26:32,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 13:26:32,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 13:26:32,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 13:26:32,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 13:26:32,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 13:26:32,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 13:26:32,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 13:26:32,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 13:26:32,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 13:26:32,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 13:26:32,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 13:26:32,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 13:26:32,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 13:26:32,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 13:26:32,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 13:26:32,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 13:26:32,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-27 13:26:32,906 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 13:26:32,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 13:26:32,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 13:26:32,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 13:26:32,909 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 13:26:32,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 13:26:32,909 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 13:26:32,910 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 13:26:32,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 13:26:32,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 13:26:32,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 13:26:32,911 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 13:26:32,912 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 13:26:32,912 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 13:26:32,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 13:26:32,913 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 13:26:32,913 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 13:26:32,913 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 13:26:32,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 13:26:32,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 13:26:32,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 13:26:32,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 13:26:32,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:26:32,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 13:26:32,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 13:26:32,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 13:26:32,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 13:26:32,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2019-11-27 13:26:33,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 13:26:33,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 13:26:33,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 13:26:33,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 13:26:33,272 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 13:26:33,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-27 13:26:33,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7908719/052e4df966e44f4fbb005533579f940f/FLAGf84073c91 [2019-11-27 13:26:33,918 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 13:26:33,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-27 13:26:33,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7908719/052e4df966e44f4fbb005533579f940f/FLAGf84073c91 [2019-11-27 13:26:34,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7908719/052e4df966e44f4fbb005533579f940f [2019-11-27 13:26:34,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 13:26:34,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 13:26:34,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 13:26:34,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 13:26:34,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 13:26:34,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:26:34" (1/1) ... [2019-11-27 13:26:34,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aed937a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:34, skipping insertion in model container [2019-11-27 13:26:34,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:26:34" (1/1) ... [2019-11-27 13:26:34,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 13:26:34,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:26:34,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:26:34,712 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) [2019-11-27 13:26:34,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@580404b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:34, skipping insertion in model container [2019-11-27 13:26:34,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 13:26:34,714 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 13:26:34,717 INFO L168 Benchmark]: Toolchain (without parser) took 499.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-27 13:26:34,718 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:26:34,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-27 13:26:34,721 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 496.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 545]: 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.1.24-de1bb10 [2019-11-27 13:26:36,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 13:26:36,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 13:26:36,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 13:26:36,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 13:26:36,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 13:26:36,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 13:26:36,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 13:26:36,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 13:26:36,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 13:26:36,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 13:26:36,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 13:26:36,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 13:26:36,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 13:26:36,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 13:26:36,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 13:26:36,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 13:26:36,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 13:26:36,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 13:26:36,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 13:26:36,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 13:26:36,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 13:26:36,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 13:26:36,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 13:26:36,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 13:26:36,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 13:26:36,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 13:26:36,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 13:26:36,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 13:26:36,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 13:26:36,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 13:26:36,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 13:26:36,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 13:26:36,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 13:26:36,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 13:26:36,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 13:26:36,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 13:26:36,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 13:26:36,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 13:26:36,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 13:26:36,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 13:26:36,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-27 13:26:36,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 13:26:36,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 13:26:36,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 13:26:36,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 13:26:36,458 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 13:26:36,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 13:26:36,459 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 13:26:36,459 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 13:26:36,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 13:26:36,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 13:26:36,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 13:26:36,461 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 13:26:36,461 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 13:26:36,462 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 13:26:36,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 13:26:36,462 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 13:26:36,463 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 13:26:36,463 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 13:26:36,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 13:26:36,463 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 13:26:36,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 13:26:36,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 13:26:36,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 13:26:36,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 13:26:36,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:26:36,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 13:26:36,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 13:26:36,466 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 13:26:36,466 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 13:26:36,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 13:26:36,467 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2019-11-27 13:26:36,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 13:26:36,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 13:26:36,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 13:26:36,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 13:26:36,754 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 13:26:36,755 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-27 13:26:36,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/558a1a017/22cfce81928f4342aa42afc46820be9f/FLAG615a94f0e [2019-11-27 13:26:37,323 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 13:26:37,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-27 13:26:37,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/558a1a017/22cfce81928f4342aa42afc46820be9f/FLAG615a94f0e [2019-11-27 13:26:37,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/558a1a017/22cfce81928f4342aa42afc46820be9f [2019-11-27 13:26:37,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 13:26:37,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 13:26:37,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 13:26:37,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 13:26:37,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 13:26:37,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:26:37" (1/1) ... [2019-11-27 13:26:37,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573c7019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:37, skipping insertion in model container [2019-11-27 13:26:37,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:26:37" (1/1) ... [2019-11-27 13:26:37,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 13:26:37,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:26:38,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:26:38,081 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 13:26:38,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:26:38,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:26:38,165 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 13:26:38,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:26:38,281 INFO L208 MainTranslator]: Completed translation [2019-11-27 13:26:38,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38 WrapperNode [2019-11-27 13:26:38,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 13:26:38,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 13:26:38,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 13:26:38,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 13:26:38,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (1/1) ... [2019-11-27 13:26:38,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (1/1) ... [2019-11-27 13:26:38,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (1/1) ... [2019-11-27 13:26:38,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (1/1) ... [2019-11-27 13:26:38,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (1/1) ... [2019-11-27 13:26:38,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (1/1) ... [2019-11-27 13:26:38,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (1/1) ... [2019-11-27 13:26:38,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 13:26:38,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 13:26:38,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 13:26:38,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 13:26:38,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:38,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 13:26:38,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 13:26:38,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 13:26:38,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 13:26:38,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 13:26:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-27 13:26:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-27 13:26:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-27 13:26:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 13:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-27 13:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 13:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 13:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 13:26:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 13:26:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 13:26:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 13:26:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 13:26:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 13:26:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 13:26:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 13:26:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 13:26:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 13:26:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 13:26:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 13:26:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 13:26:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 13:26:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 13:26:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 13:26:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 13:26:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 13:26:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 13:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 13:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 13:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 13:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 13:26:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 13:26:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 13:26:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 13:26:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 13:26:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 13:26:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 13:26:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 13:26:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 13:26:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 13:26:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 13:26:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 13:26:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 13:26:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 13:26:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 13:26:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 13:26:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 13:26:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 13:26:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 13:26:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 13:26:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 13:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 13:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 13:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 13:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 13:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 13:26:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 13:26:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 13:26:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 13:26:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 13:26:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 13:26:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 13:26:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-27 13:26:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 13:26:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 13:26:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 13:26:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 13:26:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 13:26:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 13:26:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 13:26:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 13:26:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 13:26:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 13:26:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 13:26:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 13:26:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 13:26:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 13:26:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 13:26:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 13:26:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 13:26:38,459 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 13:26:38,459 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 13:26:38,459 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 13:26:38,459 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 13:26:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 13:26:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 13:26:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 13:26:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 13:26:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 13:26:38,461 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 13:26:38,461 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 13:26:38,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 13:26:38,461 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 13:26:38,461 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 13:26:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 13:26:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 13:26:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 13:26:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 13:26:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 13:26:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 13:26:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 13:26:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 13:26:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 13:26:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 13:26:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 13:26:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 13:26:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 13:26:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 13:26:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 13:26:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 13:26:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 13:26:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 13:26:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-27 13:26:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 13:26:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 13:26:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 13:26:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 13:26:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 13:26:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-27 13:26:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 13:26:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-27 13:26:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 13:26:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 13:26:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 13:26:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 13:26:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 13:26:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 13:26:39,765 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 13:26:39,767 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 13:26:39,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:26:39 BoogieIcfgContainer [2019-11-27 13:26:39,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 13:26:39,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 13:26:39,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 13:26:39,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 13:26:39,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 01:26:37" (1/3) ... [2019-11-27 13:26:39,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad2827c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:26:39, skipping insertion in model container [2019-11-27 13:26:39,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:26:38" (2/3) ... [2019-11-27 13:26:39,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad2827c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:26:39, skipping insertion in model container [2019-11-27 13:26:39,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:26:39" (3/3) ... [2019-11-27 13:26:39,791 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-27 13:26:39,802 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 13:26:39,812 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-27 13:26:39,825 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-27 13:26:39,848 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 13:26:39,848 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 13:26:39,849 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 13:26:39,849 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 13:26:39,849 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 13:26:39,850 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 13:26:39,850 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 13:26:39,850 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 13:26:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-27 13:26:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 13:26:39,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:26:39,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:26:39,906 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:26:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:26:39,915 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-27 13:26:39,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:26:39,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642994833] [2019-11-27 13:26:39,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:26:40,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 13:26:40,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:26:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:40,141 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:26:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:40,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642994833] [2019-11-27 13:26:40,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:26:40,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 13:26:40,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416799932] [2019-11-27 13:26:40,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 13:26:40,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:40,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 13:26:40,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 13:26:40,181 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-27 13:26:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:26:40,211 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-27 13:26:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 13:26:40,212 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-27 13:26:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:26:40,225 INFO L225 Difference]: With dead ends: 199 [2019-11-27 13:26:40,226 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 13:26:40,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 13:26:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 13:26:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-27 13:26:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-27 13:26:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-27 13:26:40,292 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-27 13:26:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:26:40,293 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-27 13:26:40,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 13:26:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-27 13:26:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 13:26:40,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:26:40,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:26:40,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 13:26:40,497 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:26:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:26:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-27 13:26:40,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:26:40,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909183597] [2019-11-27 13:26:40,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:26:40,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 13:26:40,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:26:40,700 INFO L377 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 [2019-11-27 13:26:40,702 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:40,708 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:40,709 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:40,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:26:40,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:40,765 INFO L377 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 [2019-11-27 13:26:40,766 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:40,790 INFO L588 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-27 13:26:40,791 INFO L508 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. [2019-11-27 13:26:40,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-27 13:26:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:40,817 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:26:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:40,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909183597] [2019-11-27 13:26:40,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:26:40,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 13:26:40,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195884459] [2019-11-27 13:26:40,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:26:40,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:26:40,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:26:40,845 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 5 states. [2019-11-27 13:26:41,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:26:41,637 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2019-11-27 13:26:41,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:26:41,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-27 13:26:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:26:41,640 INFO L225 Difference]: With dead ends: 190 [2019-11-27 13:26:41,640 INFO L226 Difference]: Without dead ends: 190 [2019-11-27 13:26:41,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 13:26:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-27 13:26:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-27 13:26:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-27 13:26:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 201 transitions. [2019-11-27 13:26:41,655 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 201 transitions. Word has length 9 [2019-11-27 13:26:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:26:41,656 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 201 transitions. [2019-11-27 13:26:41,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:26:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 201 transitions. [2019-11-27 13:26:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 13:26:41,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:26:41,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:26:41,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 13:26:41,877 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:26:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:26:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-27 13:26:41,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:26:41,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443080985] [2019-11-27 13:26:41,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:26:41,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-27 13:26:41,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:26:41,995 INFO L377 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 [2019-11-27 13:26:41,995 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:42,011 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:42,015 INFO L377 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 [2019-11-27 13:26:42,016 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:42,032 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:42,033 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:42,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-27 13:26:42,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:26:42,074 INFO L377 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 [2019-11-27 13:26:42,075 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:42,090 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:42,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:26:42,098 INFO L377 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 [2019-11-27 13:26:42,099 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:42,110 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:42,112 INFO L508 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. [2019-11-27 13:26:42,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-27 13:26:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:42,132 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:26:42,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:26:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:42,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443080985] [2019-11-27 13:26:42,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:26:42,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-27 13:26:42,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885242518] [2019-11-27 13:26:42,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 13:26:42,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:42,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 13:26:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 13:26:42,381 INFO L87 Difference]: Start difference. First operand 190 states and 201 transitions. Second operand 8 states. [2019-11-27 13:26:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:26:45,727 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-11-27 13:26:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 13:26:45,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-27 13:26:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:26:45,733 INFO L225 Difference]: With dead ends: 205 [2019-11-27 13:26:45,733 INFO L226 Difference]: Without dead ends: 205 [2019-11-27 13:26:45,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-27 13:26:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-27 13:26:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-27 13:26:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-27 13:26:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2019-11-27 13:26:45,748 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 9 [2019-11-27 13:26:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:26:45,749 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2019-11-27 13:26:45,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 13:26:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2019-11-27 13:26:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 13:26:45,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:26:45,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:26:45,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 13:26:45,953 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:26:45,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:26:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-27 13:26:45,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:26:45,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535533206] [2019-11-27 13:26:45,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:26:46,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 13:26:46,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:26:46,094 INFO L377 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 [2019-11-27 13:26:46,095 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:46,098 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:46,098 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:46,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 13:26:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:46,104 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:26:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:46,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535533206] [2019-11-27 13:26:46,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:26:46,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 13:26:46,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704766440] [2019-11-27 13:26:46,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 13:26:46,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:46,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 13:26:46,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 13:26:46,119 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 3 states. [2019-11-27 13:26:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:26:46,457 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2019-11-27 13:26:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 13:26:46,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 13:26:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:26:46,460 INFO L225 Difference]: With dead ends: 186 [2019-11-27 13:26:46,460 INFO L226 Difference]: Without dead ends: 186 [2019-11-27 13:26:46,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 13:26:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-27 13:26:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-27 13:26:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 13:26:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2019-11-27 13:26:46,471 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 10 [2019-11-27 13:26:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:26:46,471 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2019-11-27 13:26:46,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 13:26:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2019-11-27 13:26:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 13:26:46,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:26:46,472 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:26:46,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 13:26:46,680 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:26:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:26:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-27 13:26:46,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:26:46,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378341588] [2019-11-27 13:26:46,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:26:46,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 13:26:46,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:26:46,820 INFO L377 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 [2019-11-27 13:26:46,821 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:46,830 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:46,830 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:46,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 13:26:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:46,845 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:26:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:46,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378341588] [2019-11-27 13:26:46,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:26:46,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-27 13:26:46,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237110499] [2019-11-27 13:26:46,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 13:26:46,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 13:26:46,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:26:46,910 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2019-11-27 13:26:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:26:47,548 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2019-11-27 13:26:47,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 13:26:47,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-27 13:26:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:26:47,550 INFO L225 Difference]: With dead ends: 184 [2019-11-27 13:26:47,550 INFO L226 Difference]: Without dead ends: 184 [2019-11-27 13:26:47,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:26:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-27 13:26:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-27 13:26:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-27 13:26:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2019-11-27 13:26:47,560 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2019-11-27 13:26:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:26:47,560 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2019-11-27 13:26:47,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 13:26:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2019-11-27 13:26:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 13:26:47,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:26:47,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:26:47,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 13:26:47,773 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:26:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:26:47,774 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-27 13:26:47,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:26:47,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857158312] [2019-11-27 13:26:47,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:26:47,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 13:26:47,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:26:47,886 INFO L377 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 [2019-11-27 13:26:47,887 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:47,900 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:47,900 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:47,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-27 13:26:47,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:47,941 INFO L377 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 [2019-11-27 13:26:47,941 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:47,951 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:47,952 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:47,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2019-11-27 13:26:47,989 INFO L377 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 21 treesize of output 20 [2019-11-27 13:26:47,990 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:48,009 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:48,016 INFO L377 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 21 treesize of output 20 [2019-11-27 13:26:48,016 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:48,034 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:48,035 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:48,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:15 [2019-11-27 13:26:48,061 INFO L377 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 [2019-11-27 13:26:48,062 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:48,070 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:48,074 INFO L377 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 [2019-11-27 13:26:48,074 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:48,078 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:48,079 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:48,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-27 13:26:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:48,090 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:26:50,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:26:54,318 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-27 13:26:56,999 WARN L192 SmtUtils]: Spent 2.61 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-27 13:26:57,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:26:57,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:26:57,040 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:57,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:26:57,052 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:57,053 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:57,053 INFO L508 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:26:57,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:87, output treesize:1 [2019-11-27 13:26:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:57,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857158312] [2019-11-27 13:26:57,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:26:57,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-27 13:26:57,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878684589] [2019-11-27 13:26:57,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 13:26:57,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 13:26:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=66, Unknown=2, NotChecked=0, Total=90 [2019-11-27 13:26:57,062 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand 10 states. [2019-11-27 13:26:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:26:58,584 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2019-11-27 13:26:58,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 13:26:58,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-27 13:26:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:26:58,587 INFO L225 Difference]: With dead ends: 192 [2019-11-27 13:26:58,587 INFO L226 Difference]: Without dead ends: 192 [2019-11-27 13:26:58,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=35, Invalid=95, Unknown=2, NotChecked=0, Total=132 [2019-11-27 13:26:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-27 13:26:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-11-27 13:26:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-27 13:26:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2019-11-27 13:26:58,602 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 15 [2019-11-27 13:26:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:26:58,603 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2019-11-27 13:26:58,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 13:26:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2019-11-27 13:26:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 13:26:58,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:26:58,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:26:58,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 13:26:58,815 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:26:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:26:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-27 13:26:58,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:26:58,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094441942] [2019-11-27 13:26:58,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:26:58,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 13:26:58,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:26:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:58,952 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:26:58,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:26:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:58,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094441942] [2019-11-27 13:26:58,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:26:58,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 13:26:58,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936374860] [2019-11-27 13:26:58,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 13:26:58,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:58,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 13:26:58,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:26:58,971 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 4 states. [2019-11-27 13:26:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:26:59,013 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2019-11-27 13:26:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:26:59,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-27 13:26:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:26:59,016 INFO L225 Difference]: With dead ends: 268 [2019-11-27 13:26:59,016 INFO L226 Difference]: Without dead ends: 268 [2019-11-27 13:26:59,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:26:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-27 13:26:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2019-11-27 13:26:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-27 13:26:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2019-11-27 13:26:59,023 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 17 [2019-11-27 13:26:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:26:59,024 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2019-11-27 13:26:59,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 13:26:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2019-11-27 13:26:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 13:26:59,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:26:59,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:26:59,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 13:26:59,244 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:26:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:26:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-27 13:26:59,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:26:59,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175483896] [2019-11-27 13:26:59,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:26:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:26:59,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 13:26:59,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:26:59,382 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_155|]} [2019-11-27 13:26:59,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:26:59,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 13:26:59,389 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:59,399 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:59,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:26:59,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-27 13:26:59,407 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:26:59,414 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:26:59,415 INFO L508 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. [2019-11-27 13:26:59,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-27 13:26:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:59,427 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:26:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:26:59,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175483896] [2019-11-27 13:26:59,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:26:59,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-27 13:26:59,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946587653] [2019-11-27 13:26:59,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 13:26:59,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:26:59,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 13:26:59,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:26:59,479 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand 4 states. [2019-11-27 13:27:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:27:00,390 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2019-11-27 13:27:00,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 13:27:00,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-27 13:27:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:27:00,394 INFO L225 Difference]: With dead ends: 267 [2019-11-27 13:27:00,394 INFO L226 Difference]: Without dead ends: 267 [2019-11-27 13:27:00,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:27:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-27 13:27:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 223. [2019-11-27 13:27:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-27 13:27:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2019-11-27 13:27:00,404 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 18 [2019-11-27 13:27:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:27:00,404 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2019-11-27 13:27:00,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 13:27:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2019-11-27 13:27:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 13:27:00,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:27:00,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:27:00,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 13:27:00,617 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:27:00,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:27:00,617 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-27 13:27:00,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:27:00,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379973064] [2019-11-27 13:27:00,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:27:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:27:00,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 13:27:00,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:27:00,750 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 13:27:00,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 13:27:00,751 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:00,758 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:00,758 INFO L508 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. [2019-11-27 13:27:00,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-27 13:27:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:27:00,767 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:27:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:27:00,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379973064] [2019-11-27 13:27:00,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:27:00,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 13:27:00,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808213181] [2019-11-27 13:27:00,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 13:27:00,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:27:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 13:27:00,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 13:27:00,779 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand 3 states. [2019-11-27 13:27:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:27:01,065 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-27 13:27:01,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 13:27:01,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 13:27:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:27:01,067 INFO L225 Difference]: With dead ends: 226 [2019-11-27 13:27:01,067 INFO L226 Difference]: Without dead ends: 226 [2019-11-27 13:27:01,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 13:27:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-27 13:27:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2019-11-27 13:27:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-27 13:27:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-11-27 13:27:01,075 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 18 [2019-11-27 13:27:01,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:27:01,075 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-27 13:27:01,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 13:27:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2019-11-27 13:27:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 13:27:01,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:27:01,076 INFO L410 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] [2019-11-27 13:27:01,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 13:27:01,282 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:27:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:27:01,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-27 13:27:01,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:27:01,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903256541] [2019-11-27 13:27:01,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:27:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:27:01,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 13:27:01,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:27:01,419 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 13:27:01,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 13:27:01,420 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:01,424 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:01,424 INFO L508 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. [2019-11-27 13:27:01,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-27 13:27:01,441 INFO L377 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 [2019-11-27 13:27:01,441 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:01,448 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:01,449 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:27:01,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-27 13:27:01,463 INFO L377 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 [2019-11-27 13:27:01,464 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:01,466 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:01,466 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:27:01,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-27 13:27:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:27:01,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:27:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:27:01,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903256541] [2019-11-27 13:27:01,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:27:01,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 13:27:01,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10980642] [2019-11-27 13:27:01,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:27:01,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:27:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:27:01,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:27:01,486 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand 5 states. [2019-11-27 13:27:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:27:02,102 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-27 13:27:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:27:02,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-27 13:27:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:27:02,107 INFO L225 Difference]: With dead ends: 226 [2019-11-27 13:27:02,108 INFO L226 Difference]: Without dead ends: 226 [2019-11-27 13:27:02,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:27:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-27 13:27:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2019-11-27 13:27:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-27 13:27:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2019-11-27 13:27:02,118 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 22 [2019-11-27 13:27:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:27:02,120 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2019-11-27 13:27:02,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:27:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2019-11-27 13:27:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 13:27:02,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:27:02,121 INFO L410 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] [2019-11-27 13:27:02,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 13:27:02,334 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:27:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:27:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-27 13:27:02,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:27:02,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418261991] [2019-11-27 13:27:02,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:27:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:27:02,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 13:27:02,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:27:02,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:02,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-27 13:27:02,485 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:02,516 INFO L588 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-27 13:27:02,516 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:27:02,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-27 13:27:02,536 INFO L377 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 [2019-11-27 13:27:02,537 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:02,557 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:02,562 INFO L377 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 [2019-11-27 13:27:02,563 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:02,575 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:02,576 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:27:02,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-27 13:27:02,621 INFO L377 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 [2019-11-27 13:27:02,622 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:02,634 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:02,638 INFO L377 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 [2019-11-27 13:27:02,639 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:02,651 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:02,652 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:27:02,652 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:14 [2019-11-27 13:27:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:27:02,669 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:27:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:27:02,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418261991] [2019-11-27 13:27:02,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:27:02,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-27 13:27:02,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880120570] [2019-11-27 13:27:02,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 13:27:02,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:27:02,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 13:27:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-27 13:27:02,996 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 10 states. [2019-11-27 13:27:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:27:06,227 INFO L93 Difference]: Finished difference Result 318 states and 374 transitions. [2019-11-27 13:27:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 13:27:06,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-27 13:27:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:27:06,231 INFO L225 Difference]: With dead ends: 318 [2019-11-27 13:27:06,231 INFO L226 Difference]: Without dead ends: 318 [2019-11-27 13:27:06,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-27 13:27:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-27 13:27:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 232. [2019-11-27 13:27:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-27 13:27:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-11-27 13:27:06,240 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 22 [2019-11-27 13:27:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:27:06,241 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-11-27 13:27:06,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 13:27:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-11-27 13:27:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 13:27:06,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:27:06,242 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:27:06,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 13:27:06,449 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-27 13:27:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:27:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-27 13:27:06,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:27:06,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071184755] [2019-11-27 13:27:06,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 13:27:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:27:06,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-27 13:27:06,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:27:06,675 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_174|]} [2019-11-27 13:27:06,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:27:06,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 13:27:06,681 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:06,691 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:06,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:27:06,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-27 13:27:06,721 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:06,733 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:06,734 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:27:06,734 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-27 13:27:06,754 INFO L377 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 [2019-11-27 13:27:06,754 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:06,772 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:06,777 INFO L377 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 [2019-11-27 13:27:06,777 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:06,789 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:06,790 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 13:27:06,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-11-27 13:27:06,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:06,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 110 [2019-11-27 13:27:06,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:06,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:06,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:06,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:06,917 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-27 13:27:07,091 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-11-27 13:27:07,092 INFO L588 ElimStorePlain]: treesize reduction 357, result has 22.4 percent of original size [2019-11-27 13:27:07,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:27:07,102 INFO L377 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 52 treesize of output 45 [2019-11-27 13:27:07,103 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:27:07,133 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:27:07,134 INFO L508 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. [2019-11-27 13:27:07,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2019-11-27 13:27:13,190 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-27 13:27:15,259 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-27 13:27:17,346 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-27 13:27:17,858 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-27 13:27:17,859 INFO L343 Elim1Store]: treesize reduction 18, result has 92.4 percent of original size [2019-11-27 13:27:17,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 293 [2019-11-27 13:27:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:17,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:17,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:27:18,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:27:18,334 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 19 xjuncts. [2019-11-27 13:29:47,270 WARN L192 SmtUtils]: Spent 2.48 m on a formula simplification. DAG size of input: 431 DAG size of output: 65 [2019-11-27 13:29:47,271 INFO L588 ElimStorePlain]: treesize reduction 76696, result has 0.6 percent of original size [2019-11-27 13:29:47,845 WARN L192 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-27 13:29:47,846 INFO L343 Elim1Store]: treesize reduction 18, result has 93.9 percent of original size [2019-11-27 13:29:47,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 472 treesize of output 570 [2019-11-27 13:29:47,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:29:47,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:29:47,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:29:47,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:29:47,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:29:47,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:29:47,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:29:47,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:29:47,881 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-27 13:30:40,443 WARN L192 SmtUtils]: Spent 52.56 s on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2019-11-27 13:30:40,444 INFO L588 ElimStorePlain]: treesize reduction 7751, result has 9.0 percent of original size [2019-11-27 13:30:40,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 13:30:40,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,461 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 13:30:40,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:180, output treesize:720 [2019-11-27 13:30:40,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 13:30:40,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:40,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:54,681 WARN L192 SmtUtils]: Spent 8.09 s on a formula simplification that was a NOOP. DAG size: 94 [2019-11-27 13:30:54,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:54,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 13:30:54,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:54,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:54,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:54,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:54,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:30:54,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:33:55,574 WARN L192 SmtUtils]: Spent 2.84 m on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-11-27 13:35:21,124 WARN L192 SmtUtils]: Spent 1.42 m on a formula simplification that was a NOOP. DAG size: 138 [2019-11-27 13:35:21,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-27 13:35:21,146 INFO L404 ElimStorePlain]: Different costs {90=[|#memory_$Pointer$.offset|], 380=[|#memory_$Pointer$.base|]} [2019-11-27 13:35:21,228 INFO L377 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 [2019-11-27 13:35:21,229 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:21,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:21,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:21,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 10 [2019-11-27 13:35:21,338 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:21,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:21,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:21,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:35:21,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 49 [2019-11-27 13:35:21,495 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:21,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:21,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:21,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 10 [2019-11-27 13:35:21,551 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:21,599 INFO L377 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 [2019-11-27 13:35:21,600 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:21,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:21,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:21,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 10 [2019-11-27 13:35:21,673 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:22,330 WARN L192 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-27 13:35:22,331 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:35:22,467 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-27 13:35:22,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53 [2019-11-27 13:35:22,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,469 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:22,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:22,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:22,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:22,624 INFO L237 Elim1Store]: Index analysis took 123 ms [2019-11-27 13:35:22,820 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-27 13:35:22,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:35:22,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 148 [2019-11-27 13:35:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:22,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:22,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:22,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:22,830 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:22,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:22,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:22,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 13:35:23,050 INFO L237 Elim1Store]: Index analysis took 173 ms [2019-11-27 13:35:23,349 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-27 13:35:23,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:35:23,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 148 [2019-11-27 13:35:23,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:23,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:23,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:23,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:23,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,372 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:23,543 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-27 13:35:23,544 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-27 13:35:23,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53 [2019-11-27 13:35:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,546 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:23,793 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-27 13:35:23,794 INFO L343 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2019-11-27 13:35:23,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 75 [2019-11-27 13:35:23,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:23,797 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:24,115 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-11-27 13:35:24,117 INFO L343 Elim1Store]: treesize reduction 108, result has 41.6 percent of original size [2019-11-27 13:35:24,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 94 [2019-11-27 13:35:24,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:24,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 13:35:24,120 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-27 13:35:24,204 INFO L588 ElimStorePlain]: treesize reduction 61, result has 25.6 percent of original size [2019-11-27 13:35:24,205 INFO L508 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:35:24,206 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:807, output treesize:21 [2019-11-27 13:35:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:35:24,409 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:35:24,801 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-11-27 13:35:25,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:35:25,584 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:35:25,599 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:35:25,863 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-27 13:35:25,864 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:35:25,883 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:35:25,898 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:35:26,110 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-27 13:35:26,111 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:35:26,112 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-27 13:35:26,112 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:139 [2019-11-27 13:35:30,187 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-27 13:35:48,519 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 55 [2019-11-27 13:36:05,397 WARN L192 SmtUtils]: Spent 3.11 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-27 13:36:05,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:36:05,424 INFO L404 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_72|], 6=[|v_#memory_$Pointer$.base_73|]} [2019-11-27 13:36:05,446 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:36:05,491 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:36:05,970 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-27 13:36:05,970 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:36:05,989 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:36:06,017 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 13:36:06,552 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-27 13:36:06,553 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:36:06,554 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-11-27 13:36:06,555 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:304, output treesize:544 [2019-11-27 13:36:19,205 WARN L192 SmtUtils]: Spent 904.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-27 13:37:03,930 WARN L192 SmtUtils]: Spent 6.55 s on a formula simplification that was a NOOP. DAG size: 98 [2019-11-27 13:37:05,967 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|create_data_#t~mem8.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse8 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse8))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| .cse7) (bvadd |create_data_#t~mem8.offset| (_ bv1 32)) v_DerPreprocessor_8))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse7 .cse4))) (let ((.cse2 (select (select .cse1 c_create_data_~data~0.base) .cse8)) (.cse3 (bvadd v_prenex_13 (_ bv4 32))) (.cse0 (store (select |c_#memory_$Pointer$.offset| .cse7) (bvadd |create_data_#t~mem8.offset| (_ bv3 32)) v_DerPreprocessor_6))) (or (not (= v_DerPreprocessor_6 (select .cse0 |create_data_#t~mem8.offset|))) (not (= v_DerPreprocessor_1 (select (store (select .cse1 .cse2) (bvadd v_prenex_13 (_ bv6 32)) v_DerPreprocessor_1) .cse3))) (not (= (select .cse4 |create_data_#t~mem8.offset|) v_DerPreprocessor_8)) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse7 .cse0))) (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 v_DerPreprocessor_4))) c_create_data_~data~0.base) .cse8))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))))))) (forall ((v_prenex_12 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (let ((.cse16 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse16))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| .cse15) (bvadd v_prenex_14 (_ bv1 32)) v_DerPreprocessor_7))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse15 .cse9))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse16))) (let ((.cse12 (bvadd v_prenex_12 (_ bv4 32))) (.cse10 (store (select |c_#memory_$Pointer$.offset| .cse15) (bvadd v_prenex_14 (_ bv3 32)) v_DerPreprocessor_5)) (.cse11 (store (select .cse17 .cse14) (bvadd v_prenex_12 (_ bv6 32)) v_DerPreprocessor_2))) (or (not (= (select .cse9 v_prenex_14) v_DerPreprocessor_7)) (not (= v_DerPreprocessor_5 (select .cse10 v_prenex_14))) (not (= v_DerPreprocessor_2 (select .cse11 .cse12))) (bvule (bvadd (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse15 .cse10))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse12 v_DerPreprocessor_3))) c_create_data_~data~0.base) .cse16) (_ bv12 32)) (select |c_#length| (select (select (store .cse17 .cse14 .cse11) c_create_data_~data~0.base) .cse16)))))))))))) is different from false [2019-11-27 13:37:06,000 INFO L404 ElimStorePlain]: Different costs {5=[v_prenex_16, |#memory_$Pointer$.offset|], 6=[v_prenex_15], 9=[|#memory_$Pointer$.base|]} [2019-11-27 13:37:06,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:37:06,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 273 [2019-11-27 13:37:06,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 13:37:06,431 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-11-27 13:37:06,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:37:06,456 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 13:37:06,459 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_64], 1=[v_arrayElimCell_65]} [2019-11-27 13:37:06,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 13:37:06,702 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 13:37:06,709 INFO L168 Benchmark]: Toolchain (without parser) took 629075.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 956.3 MB in the beginning and 839.9 MB in the end (delta: 116.4 MB). Peak memory consumption was 385.4 MB. Max. memory is 11.5 GB. [2019-11-27 13:37:06,710 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:37:06,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-27 13:37:06,710 INFO L168 Benchmark]: Boogie Preprocessor took 96.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:37:06,711 INFO L168 Benchmark]: RCFGBuilder took 1389.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. [2019-11-27 13:37:06,712 INFO L168 Benchmark]: TraceAbstraction took 626937.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.0 GB in the beginning and 839.9 MB in the end (delta: 196.2 MB). Peak memory consumption was 308.4 MB. Max. memory is 11.5 GB. [2019-11-27 13:37:06,713 INFO L335 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 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1389.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 626937.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.0 GB in the beginning and 839.9 MB in the end (delta: 196.2 MB). Peak memory consumption was 308.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...