./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 3c39aff9 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-3c39aff [2019-11-27 19:01:07,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 19:01:07,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 19:01:07,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 19:01:07,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 19:01:07,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 19:01:07,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 19:01:07,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 19:01:07,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 19:01:07,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 19:01:07,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 19:01:07,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 19:01:07,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 19:01:07,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 19:01:07,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 19:01:07,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 19:01:07,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 19:01:07,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 19:01:07,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 19:01:07,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 19:01:07,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 19:01:07,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 19:01:07,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 19:01:07,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 19:01:07,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 19:01:07,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 19:01:07,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 19:01:07,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 19:01:07,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 19:01:07,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 19:01:07,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 19:01:07,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 19:01:07,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 19:01:07,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 19:01:07,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 19:01:07,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 19:01:07,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 19:01:07,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 19:01:07,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 19:01:07,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 19:01:07,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 19:01:07,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-27 19:01:07,573 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 19:01:07,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 19:01:07,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 19:01:07,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 19:01:07,575 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 19:01:07,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 19:01:07,576 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 19:01:07,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 19:01:07,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 19:01:07,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 19:01:07,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 19:01:07,577 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 19:01:07,578 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 19:01:07,578 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 19:01:07,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 19:01:07,578 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 19:01:07,579 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 19:01:07,579 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 19:01:07,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 19:01:07,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 19:01:07,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 19:01:07,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 19:01:07,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 19:01:07,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 19:01:07,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 19:01:07,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 19:01:07,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 19:01:07,582 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 19:01:07,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 19:01:07,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 19:01:07,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 19:01:07,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 19:01:07,904 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 19:01:07,905 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 19:01:07,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d82ddf7/570eea9bef5f431e9be15486626798a0/FLAG1ee10c34a [2019-11-27 19:01:08,463 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 19:01:08,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-27 19:01:08,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d82ddf7/570eea9bef5f431e9be15486626798a0/FLAG1ee10c34a [2019-11-27 19:01:08,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d82ddf7/570eea9bef5f431e9be15486626798a0 [2019-11-27 19:01:08,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 19:01:08,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 19:01:08,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 19:01:08,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 19:01:08,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 19:01:08,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:01:08" (1/1) ... [2019-11-27 19:01:08,793 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 07:01:08, skipping insertion in model container [2019-11-27 19:01:08,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:01:08" (1/1) ... [2019-11-27 19:01:08,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 19:01:08,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 19:01:09,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:01:09,245 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 19:01:09,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4da066d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:09, skipping insertion in model container [2019-11-27 19:01:09,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 19:01:09,246 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-27 19:01:09,249 INFO L168 Benchmark]: Toolchain (without parser) took 465.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-27 19:01:09,249 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 19:01:09,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-27 19:01:09,253 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 462.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 20.8 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-3c39aff [2019-11-27 19:01:10,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 19:01:10,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 19:01:10,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 19:01:10,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 19:01:10,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 19:01:10,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 19:01:10,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 19:01:10,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 19:01:10,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 19:01:10,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 19:01:10,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 19:01:10,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 19:01:10,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 19:01:10,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 19:01:10,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 19:01:10,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 19:01:10,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 19:01:10,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 19:01:10,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 19:01:10,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 19:01:10,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 19:01:10,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 19:01:10,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 19:01:10,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 19:01:10,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 19:01:10,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 19:01:10,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 19:01:10,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 19:01:10,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 19:01:10,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 19:01:10,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 19:01:10,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 19:01:10,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 19:01:10,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 19:01:10,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 19:01:10,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 19:01:10,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 19:01:10,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 19:01:10,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 19:01:10,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 19:01:10,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-27 19:01:10,984 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 19:01:10,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 19:01:10,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 19:01:10,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 19:01:10,987 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 19:01:10,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 19:01:10,987 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 19:01:10,988 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 19:01:10,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 19:01:10,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 19:01:10,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 19:01:10,990 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 19:01:10,990 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 19:01:10,991 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 19:01:10,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 19:01:10,991 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 19:01:10,991 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 19:01:10,992 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 19:01:10,992 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 19:01:10,992 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 19:01:10,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 19:01:10,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 19:01:10,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 19:01:10,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 19:01:10,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 19:01:10,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 19:01:10,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 19:01:10,995 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 19:01:10,995 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 19:01:10,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 19:01:10,995 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 19:01:11,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 19:01:11,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 19:01:11,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 19:01:11,332 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 19:01:11,333 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 19:01:11,334 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 19:01:11,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61701d3bd/5b5e573b9b494c49b90106c552319449/FLAG61b637f5c [2019-11-27 19:01:11,891 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 19:01:11,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-27 19:01:11,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61701d3bd/5b5e573b9b494c49b90106c552319449/FLAG61b637f5c [2019-11-27 19:01:12,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61701d3bd/5b5e573b9b494c49b90106c552319449 [2019-11-27 19:01:12,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 19:01:12,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 19:01:12,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 19:01:12,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 19:01:12,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 19:01:12,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:12,273 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 07:01:12, skipping insertion in model container [2019-11-27 19:01:12,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:12,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 19:01:12,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 19:01:12,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:01:12,757 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-27 19:01:12,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 19:01:12,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:01:12,849 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 19:01:12,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:01:12,971 INFO L208 MainTranslator]: Completed translation [2019-11-27 19:01:12,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12 WrapperNode [2019-11-27 19:01:12,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 19:01:12,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 19:01:12,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 19:01:12,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 19:01:12,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:12,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:13,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:13,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:13,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:13,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:13,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (1/1) ... [2019-11-27 19:01:13,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 19:01:13,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 19:01:13,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 19:01:13,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 19:01:13,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (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 19:01:13,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 19:01:13,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 19:01:13,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 19:01:13,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 19:01:13,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 19:01:13,112 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-27 19:01:13,112 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-27 19:01:13,112 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-27 19:01:13,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 19:01:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-27 19:01:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 19:01:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 19:01:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 19:01:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 19:01:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 19:01:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 19:01:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 19:01:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 19:01:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 19:01:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 19:01:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 19:01:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 19:01:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 19:01:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 19:01:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 19:01:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 19:01:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 19:01:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 19:01:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 19:01:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 19:01:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 19:01:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 19:01:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 19:01:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 19:01:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 19:01:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 19:01:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 19:01:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 19:01:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 19:01:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 19:01:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 19:01:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 19:01:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 19:01:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 19:01:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 19:01:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 19:01:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 19:01:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 19:01:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 19:01:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 19:01:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 19:01:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 19:01:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 19:01:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 19:01:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 19:01:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 19:01:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 19:01:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 19:01:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 19:01:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 19:01:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 19:01:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 19:01:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 19:01:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 19:01:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 19:01:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 19:01:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-27 19:01:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 19:01:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 19:01:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 19:01:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-27 19:01:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 19:01:13,126 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 19:01:13,126 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-27 19:01:13,126 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 19:01:13,126 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 19:01:13,126 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-27 19:01:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 19:01:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 19:01:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 19:01:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 19:01:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 19:01:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 19:01:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 19:01:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 19:01:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 19:01:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 19:01:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 19:01:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 19:01:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 19:01:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 19:01:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 19:01:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 19:01:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 19:01:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 19:01:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 19:01:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 19:01:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 19:01:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 19:01:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 19:01:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 19:01:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 19:01:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 19:01:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 19:01:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 19:01:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 19:01:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 19:01:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 19:01:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 19:01:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 19:01:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 19:01:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 19:01:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 19:01:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 19:01:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 19:01:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 19:01:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-27 19:01:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 19:01:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 19:01:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 19:01:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 19:01:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 19:01:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-27 19:01:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 19:01:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-27 19:01:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 19:01:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 19:01:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 19:01:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 19:01:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 19:01:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-27 19:01:14,302 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 19:01:14,302 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 19:01:14,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:01:14 BoogieIcfgContainer [2019-11-27 19:01:14,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 19:01:14,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 19:01:14,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 19:01:14,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 19:01:14,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:01:12" (1/3) ... [2019-11-27 19:01:14,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b746c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:01:14, skipping insertion in model container [2019-11-27 19:01:14,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:01:12" (2/3) ... [2019-11-27 19:01:14,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b746c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:01:14, skipping insertion in model container [2019-11-27 19:01:14,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:01:14" (3/3) ... [2019-11-27 19:01:14,311 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-27 19:01:14,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 19:01:14,329 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-27 19:01:14,341 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-27 19:01:14,361 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 19:01:14,362 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 19:01:14,362 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 19:01:14,362 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 19:01:14,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 19:01:14,363 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 19:01:14,363 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 19:01:14,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 19:01:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-27 19:01:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 19:01:14,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:14,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:01:14,398 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 19:01:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-27 19:01:14,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:14,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973984899] [2019-11-27 19:01:14,417 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 19:01:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:14,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 19:01:14,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:14,606 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 19:01:14,606 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:14,622 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 19:01:14,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973984899] [2019-11-27 19:01:14,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:14,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 19:01:14,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929752538] [2019-11-27 19:01:14,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 19:01:14,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 19:01:14,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 19:01:14,652 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-27 19:01:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:14,692 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-27 19:01:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 19:01:14,694 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-27 19:01:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:14,716 INFO L225 Difference]: With dead ends: 199 [2019-11-27 19:01:14,717 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 19:01:14,718 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 19:01:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 19:01:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-27 19:01:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-27 19:01:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-27 19:01:14,797 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-27 19:01:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:14,798 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-27 19:01:14,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 19:01:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-27 19:01:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 19:01:14,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:14,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:01:15,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 19:01:15,013 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 19:01:15,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-27 19:01:15,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:15,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000602816] [2019-11-27 19:01:15,016 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 19:01:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:15,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 19:01:15,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:15,188 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 19:01:15,188 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:15,193 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:15,193 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:01:15,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 19:01:15,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:15,238 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 19:01:15,239 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:15,260 INFO L588 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-27 19:01:15,262 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 19:01:15,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-27 19:01:15,283 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 19:01:15,283 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:15,304 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 19:01:15,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000602816] [2019-11-27 19:01:15,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:15,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 19:01:15,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047372337] [2019-11-27 19:01:15,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 19:01:15,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:15,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 19:01:15,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 19:01:15,309 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 5 states. [2019-11-27 19:01:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:16,084 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2019-11-27 19:01:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 19:01:16,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-27 19:01:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:16,088 INFO L225 Difference]: With dead ends: 190 [2019-11-27 19:01:16,088 INFO L226 Difference]: Without dead ends: 190 [2019-11-27 19:01:16,089 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 19:01:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-27 19:01:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-27 19:01:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-27 19:01:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 201 transitions. [2019-11-27 19:01:16,101 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 201 transitions. Word has length 9 [2019-11-27 19:01:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:16,101 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 201 transitions. [2019-11-27 19:01:16,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 19:01:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 201 transitions. [2019-11-27 19:01:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 19:01:16,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:16,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:01:16,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 19:01:16,316 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 19:01:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-27 19:01:16,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:16,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227803032] [2019-11-27 19:01:16,318 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 19:01:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:16,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-27 19:01:16,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:16,437 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 19:01:16,437 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:16,454 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:16,459 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 19:01:16,459 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:16,469 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:16,469 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:01:16,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-27 19:01:16,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:16,522 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 19:01:16,523 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:16,536 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:16,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:16,543 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 19:01:16,544 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:16,553 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:16,554 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 19:01:16,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-27 19:01:16,573 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 19:01:16,573 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:16,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:16,865 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 19:01:16,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227803032] [2019-11-27 19:01:16,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:16,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-27 19:01:16,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198037168] [2019-11-27 19:01:16,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 19:01:16,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 19:01:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:01:16,868 INFO L87 Difference]: Start difference. First operand 190 states and 201 transitions. Second operand 8 states. [2019-11-27 19:01:18,857 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-27 19:01:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:20,456 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-11-27 19:01:20,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:01:20,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-27 19:01:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:20,461 INFO L225 Difference]: With dead ends: 205 [2019-11-27 19:01:20,461 INFO L226 Difference]: Without dead ends: 205 [2019-11-27 19:01:20,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-27 19:01:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-27 19:01:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-27 19:01:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-27 19:01:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2019-11-27 19:01:20,475 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 9 [2019-11-27 19:01:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:20,476 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2019-11-27 19:01:20,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 19:01:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2019-11-27 19:01:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 19:01:20,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:20,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:01:20,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 19:01:20,688 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 19:01:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:20,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-27 19:01:20,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:20,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638387981] [2019-11-27 19:01:20,691 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 19:01:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:20,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 19:01:20,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:20,792 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 19:01:20,792 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:20,795 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:20,795 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:01:20,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 19:01:20,799 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 19:01:20,799 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:20,806 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 19:01:20,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638387981] [2019-11-27 19:01:20,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:20,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 19:01:20,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519186408] [2019-11-27 19:01:20,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 19:01:20,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:20,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 19:01:20,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 19:01:20,808 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 3 states. [2019-11-27 19:01:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:21,125 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2019-11-27 19:01:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 19:01:21,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 19:01:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:21,128 INFO L225 Difference]: With dead ends: 186 [2019-11-27 19:01:21,128 INFO L226 Difference]: Without dead ends: 186 [2019-11-27 19:01:21,128 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 19:01:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-27 19:01:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-27 19:01:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 19:01:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2019-11-27 19:01:21,138 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 10 [2019-11-27 19:01:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:21,139 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2019-11-27 19:01:21,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 19:01:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2019-11-27 19:01:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 19:01:21,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:21,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:01:21,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 19:01:21,357 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 19:01:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-27 19:01:21,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:21,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193669643] [2019-11-27 19:01:21,359 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 19:01:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:21,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 19:01:21,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:21,464 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 19:01:21,464 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:21,470 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:21,470 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:01:21,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 19:01:21,479 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 19:01:21,479 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:21,524 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 19:01:21,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193669643] [2019-11-27 19:01:21,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:21,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-27 19:01:21,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204214882] [2019-11-27 19:01:21,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 19:01:21,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:21,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 19:01:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:01:21,526 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2019-11-27 19:01:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:22,095 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2019-11-27 19:01:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 19:01:22,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-27 19:01:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:22,098 INFO L225 Difference]: With dead ends: 184 [2019-11-27 19:01:22,099 INFO L226 Difference]: Without dead ends: 184 [2019-11-27 19:01:22,099 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 19:01:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-27 19:01:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-27 19:01:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-27 19:01:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2019-11-27 19:01:22,108 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2019-11-27 19:01:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:22,109 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2019-11-27 19:01:22,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 19:01:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2019-11-27 19:01:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 19:01:22,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:22,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:01:22,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 19:01:22,321 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 19:01:22,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:22,322 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-27 19:01:22,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:22,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062796361] [2019-11-27 19:01:22,323 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 19:01:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:22,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 19:01:22,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:22,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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 19:01:22,420 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:22,431 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:22,431 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:01:22,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-27 19:01:22,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:22,474 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 19:01:22,475 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:22,485 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:22,485 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:01:22,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2019-11-27 19:01:22,519 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 19:01:22,520 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:22,544 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:22,551 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 19:01:22,552 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:22,569 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:22,570 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 19:01:22,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:15 [2019-11-27 19:01:22,597 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 19:01:22,598 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:22,615 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:22,617 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 19:01:22,617 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:22,623 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:22,623 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 19:01:22,623 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-27 19:01:22,635 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 19:01:22,635 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:24,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:27,643 WARN L192 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-27 19:01:27,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:27,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:27,663 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:27,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:27,668 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:27,669 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:27,669 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 19:01:27,669 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:87, output treesize:1 [2019-11-27 19:01:27,677 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 19:01:27,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062796361] [2019-11-27 19:01:27,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:27,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-27 19:01:27,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890875089] [2019-11-27 19:01:27,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 19:01:27,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:27,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 19:01:27,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=66, Unknown=2, NotChecked=0, Total=90 [2019-11-27 19:01:27,679 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand 10 states. [2019-11-27 19:01:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:29,242 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2019-11-27 19:01:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 19:01:29,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-27 19:01:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:29,246 INFO L225 Difference]: With dead ends: 192 [2019-11-27 19:01:29,246 INFO L226 Difference]: Without dead ends: 192 [2019-11-27 19:01:29,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=35, Invalid=95, Unknown=2, NotChecked=0, Total=132 [2019-11-27 19:01:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-27 19:01:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-11-27 19:01:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-27 19:01:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2019-11-27 19:01:29,256 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 15 [2019-11-27 19:01:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:29,257 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2019-11-27 19:01:29,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 19:01:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2019-11-27 19:01:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 19:01:29,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:29,258 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 19:01:29,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 19:01:29,461 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 19:01:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-27 19:01:29,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:29,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289947509] [2019-11-27 19:01:29,464 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 19:01:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:29,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 19:01:29,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:29,608 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 19:01:29,608 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:29,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:29,617 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 19:01:29,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289947509] [2019-11-27 19:01:29,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:29,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 19:01:29,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251484360] [2019-11-27 19:01:29,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 19:01:29,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 19:01:29,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:01:29,619 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 4 states. [2019-11-27 19:01:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:29,667 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2019-11-27 19:01:29,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:01:29,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-27 19:01:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:29,669 INFO L225 Difference]: With dead ends: 268 [2019-11-27 19:01:29,670 INFO L226 Difference]: Without dead ends: 268 [2019-11-27 19:01:29,670 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 19:01:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-27 19:01:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2019-11-27 19:01:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-27 19:01:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2019-11-27 19:01:29,680 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 17 [2019-11-27 19:01:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:29,680 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2019-11-27 19:01:29,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 19:01:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2019-11-27 19:01:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 19:01:29,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:29,682 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 19:01:29,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 19:01:29,896 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 19:01:29,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-27 19:01:29,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:29,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858605125] [2019-11-27 19:01:29,898 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 19:01:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:30,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 19:01:30,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:30,021 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_155|]} [2019-11-27 19:01:30,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:30,029 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 19:01:30,029 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:30,040 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:30,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:30,044 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 19:01:30,045 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:30,053 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:30,054 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 19:01:30,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-27 19:01:30,065 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 19:01:30,065 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:30,118 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 19:01:30,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858605125] [2019-11-27 19:01:30,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:30,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-27 19:01:30,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309759479] [2019-11-27 19:01:30,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 19:01:30,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 19:01:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:01:30,120 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand 4 states. [2019-11-27 19:01:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:31,064 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2019-11-27 19:01:31,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 19:01:31,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-27 19:01:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:31,072 INFO L225 Difference]: With dead ends: 267 [2019-11-27 19:01:31,072 INFO L226 Difference]: Without dead ends: 267 [2019-11-27 19:01:31,072 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 19:01:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-27 19:01:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 223. [2019-11-27 19:01:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-27 19:01:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2019-11-27 19:01:31,083 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 18 [2019-11-27 19:01:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:31,084 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2019-11-27 19:01:31,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 19:01:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2019-11-27 19:01:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 19:01:31,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:31,085 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 19:01:31,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 19:01:31,305 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 19:01:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-27 19:01:31,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:31,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574464626] [2019-11-27 19:01:31,306 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 19:01:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:31,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 19:01:31,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:31,423 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 19:01:31,423 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 19:01:31,424 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:31,429 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:31,430 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 19:01:31,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-27 19:01:31,447 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 19:01:31,447 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:31,456 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 19:01:31,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574464626] [2019-11-27 19:01:31,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:31,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 19:01:31,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308260865] [2019-11-27 19:01:31,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 19:01:31,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 19:01:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 19:01:31,459 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand 3 states. [2019-11-27 19:01:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:31,788 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-27 19:01:31,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 19:01:31,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 19:01:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:31,791 INFO L225 Difference]: With dead ends: 226 [2019-11-27 19:01:31,791 INFO L226 Difference]: Without dead ends: 226 [2019-11-27 19:01:31,791 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 19:01:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-27 19:01:31,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2019-11-27 19:01:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-27 19:01:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-11-27 19:01:31,799 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 18 [2019-11-27 19:01:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:31,799 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-27 19:01:31,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 19:01:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2019-11-27 19:01:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 19:01:31,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:31,801 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 19:01:32,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 19:01:32,015 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 19:01:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:32,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-27 19:01:32,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:32,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135907624] [2019-11-27 19:01:32,016 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 19:01:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:32,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 19:01:32,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:32,132 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 19:01:32,133 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 19:01:32,133 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:32,137 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:32,138 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 19:01:32,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-27 19:01:32,159 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 19:01:32,159 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:32,167 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:32,168 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 19:01:32,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-27 19:01:32,183 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 19:01:32,184 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:32,186 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:32,186 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 19:01:32,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-27 19:01:32,194 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 19:01:32,194 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:32,204 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 19:01:32,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135907624] [2019-11-27 19:01:32,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:32,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 19:01:32,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140597828] [2019-11-27 19:01:32,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 19:01:32,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 19:01:32,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 19:01:32,206 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand 5 states. [2019-11-27 19:01:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:32,802 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-27 19:01:32,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:01:32,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-27 19:01:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:32,805 INFO L225 Difference]: With dead ends: 226 [2019-11-27 19:01:32,805 INFO L226 Difference]: Without dead ends: 226 [2019-11-27 19:01:32,806 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 19:01:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-27 19:01:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2019-11-27 19:01:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-27 19:01:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2019-11-27 19:01:32,813 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 22 [2019-11-27 19:01:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:32,814 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2019-11-27 19:01:32,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 19:01:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2019-11-27 19:01:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 19:01:32,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:32,815 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 19:01:33,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 19:01:33,024 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 19:01:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:33,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-27 19:01:33,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:33,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482026067] [2019-11-27 19:01:33,026 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 19:01:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:33,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 19:01:33,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:33,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:33,179 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 19:01:33,180 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:33,210 INFO L588 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-27 19:01:33,211 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 19:01:33,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-27 19:01:33,232 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 19:01:33,232 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:33,251 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:33,256 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 19:01:33,257 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:33,269 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:33,269 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 19:01:33,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-27 19:01:33,324 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 19:01:33,324 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:33,339 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:33,343 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 19:01:33,344 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:33,350 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:33,351 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 19:01:33,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:14 [2019-11-27 19:01:33,369 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 19:01:33,369 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:01:33,730 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 19:01:33,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482026067] [2019-11-27 19:01:33,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:01:33,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-27 19:01:33,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693707751] [2019-11-27 19:01:33,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 19:01:33,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:01:33,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 19:01:33,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-27 19:01:33,732 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 10 states. [2019-11-27 19:01:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:01:36,798 INFO L93 Difference]: Finished difference Result 318 states and 374 transitions. [2019-11-27 19:01:36,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 19:01:36,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-27 19:01:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:01:36,804 INFO L225 Difference]: With dead ends: 318 [2019-11-27 19:01:36,804 INFO L226 Difference]: Without dead ends: 318 [2019-11-27 19:01:36,804 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 19:01:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-27 19:01:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 232. [2019-11-27 19:01:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-27 19:01:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-11-27 19:01:36,817 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 22 [2019-11-27 19:01:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:01:36,817 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-11-27 19:01:36,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 19:01:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-11-27 19:01:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 19:01:36,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:01:36,820 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 19:01:37,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 19:01:37,033 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 19:01:37,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:01:37,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-27 19:01:37,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:01:37,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101499495] [2019-11-27 19:01:37,036 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 19:01:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:01:37,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-27 19:01:37,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:01:37,225 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_174|]} [2019-11-27 19:01:37,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:37,230 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 19:01:37,230 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:37,240 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:37,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:37,245 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 19:01:37,246 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:37,258 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:37,259 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:01:37,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-27 19:01:37,281 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 19:01:37,282 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:37,298 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:37,302 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 19:01:37,302 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:37,317 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:37,317 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 19:01:37,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-11-27 19:01:37,445 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:37,446 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 19:01:37,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:37,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:37,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:37,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:37,451 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-27 19:01:37,630 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-11-27 19:01:37,631 INFO L588 ElimStorePlain]: treesize reduction 357, result has 22.4 percent of original size [2019-11-27 19:01:37,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:01:37,645 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 19:01:37,646 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:01:37,684 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:01:37,685 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 19:01:37,686 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2019-11-27 19:01:43,750 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-27 19:01:45,801 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-27 19:01:47,895 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-27 19:01:48,321 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-27 19:01:48,322 INFO L343 Elim1Store]: treesize reduction 18, result has 92.4 percent of original size [2019-11-27 19:01:48,322 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 19:01:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:01:48,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:01:48,841 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 19 xjuncts. [2019-11-27 19:04:20,075 WARN L192 SmtUtils]: Spent 2.52 m on a formula simplification. DAG size of input: 431 DAG size of output: 65 [2019-11-27 19:04:20,077 INFO L588 ElimStorePlain]: treesize reduction 76696, result has 0.6 percent of original size [2019-11-27 19:04:20,543 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-27 19:04:20,544 INFO L343 Elim1Store]: treesize reduction 18, result has 93.9 percent of original size [2019-11-27 19:04:20,544 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 19:04:20,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:04:20,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:04:20,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:04:20,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:04:20,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:04:20,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:04:20,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:20,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:04:20,569 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-27 19:05:12,762 WARN L192 SmtUtils]: Spent 52.19 s on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2019-11-27 19:05:12,763 INFO L588 ElimStorePlain]: treesize reduction 7751, result has 9.0 percent of original size [2019-11-27 19:05:12,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 19:05:12,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,783 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 19:05:12,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:180, output treesize:720 [2019-11-27 19:05:12,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 19:05:12,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:12,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:27,043 WARN L192 SmtUtils]: Spent 8.09 s on a formula simplification that was a NOOP. DAG size: 94 [2019-11-27 19:05:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 19:05:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:27,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:08:28,522 WARN L192 SmtUtils]: Spent 2.85 m on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-11-27 19:09:54,122 WARN L192 SmtUtils]: Spent 1.42 m on a formula simplification that was a NOOP. DAG size: 138 [2019-11-27 19:09:54,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-27 19:09:54,170 INFO L404 ElimStorePlain]: Different costs {90=[|#memory_$Pointer$.offset|], 380=[|#memory_$Pointer$.base|]} [2019-11-27 19:09:54,251 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 19:09:54,252 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:54,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:54,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:54,416 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 19:09:54,417 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:54,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:54,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:54,685 INFO L237 Elim1Store]: Index analysis took 171 ms [2019-11-27 19:09:54,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:09:54,738 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 19:09:54,738 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:54,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:54,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:54,855 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 19:09:54,856 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:54,956 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 19:09:54,956 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:55,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:55,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:55,077 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 19:09:55,078 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:55,897 WARN L192 SmtUtils]: Spent 818.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-27 19:09:55,898 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:09:56,057 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-27 19:09:56,057 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 19:09:56,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,058 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:56,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:56,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:56,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:56,266 INFO L237 Elim1Store]: Index analysis took 172 ms [2019-11-27 19:09:56,463 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-27 19:09:56,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:09:56,464 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 19:09:56,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,477 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:56,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:56,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:56,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:09:56,712 INFO L237 Elim1Store]: Index analysis took 196 ms [2019-11-27 19:09:56,924 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-27 19:09:56,925 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:09:56,925 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 19:09:56,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:56,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:56,934 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:57,066 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-27 19:09:57,066 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 19:09:57,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:57,067 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:57,228 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-27 19:09:57,228 INFO L343 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2019-11-27 19:09:57,229 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 19:09:57,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:57,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:57,231 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:57,430 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-11-27 19:09:57,431 INFO L343 Elim1Store]: treesize reduction 108, result has 41.6 percent of original size [2019-11-27 19:09:57,431 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 19:09:57,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:57,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:09:57,433 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-27 19:09:57,483 INFO L588 ElimStorePlain]: treesize reduction 61, result has 25.6 percent of original size [2019-11-27 19:09:57,484 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 19:09:57,484 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:807, output treesize:21 [2019-11-27 19:09:57,594 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 19:09:57,594 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:09:58,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:09:58,226 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 19:09:58,238 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 19:09:58,366 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-27 19:09:58,366 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:09:58,374 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 19:09:58,384 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 19:09:58,495 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-27 19:09:58,495 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:09:58,496 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 19:09:58,496 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:139 [2019-11-27 19:10:04,211 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-27 19:10:13,948 WARN L192 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 55 [2019-11-27 19:10:24,587 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-27 19:10:24,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:24,608 INFO L404 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_72|], 6=[|v_#memory_$Pointer$.base_73|]} [2019-11-27 19:10:24,633 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 19:10:24,677 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 19:10:25,839 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 83 [2019-11-27 19:10:25,840 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:25,858 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 19:10:25,888 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 19:10:26,786 WARN L192 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-27 19:10:26,787 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:26,788 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 19:10:26,789 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:304, output treesize:544 [2019-11-27 19:10:44,864 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-27 19:11:28,679 WARN L192 SmtUtils]: Spent 5.53 s on a formula simplification that was a NOOP. DAG size: 98 [2019-11-27 19:11:30,716 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 19:11:30,788 INFO L404 ElimStorePlain]: Different costs {5=[v_prenex_16, |#memory_$Pointer$.offset|], 6=[v_prenex_15], 9=[|#memory_$Pointer$.base|]} [2019-11-27 19:11:31,100 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:31,100 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 19:11:31,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:31,355 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 19:11:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:31,375 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 19:11:31,379 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_64], 1=[v_arrayElimCell_65]} [2019-11-27 19:11:31,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 19:11:31,642 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 19:11:31,648 INFO L168 Benchmark]: Toolchain (without parser) took 619384.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -109.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:31,649 INFO L168 Benchmark]: CDTParser took 0.27 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 19:11:31,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:31,649 INFO L168 Benchmark]: Boogie Preprocessor took 74.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 19:11:31,650 INFO L168 Benchmark]: RCFGBuilder took 1256.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.4 MB). Peak memory consumption was 86.4 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:31,650 INFO L168 Benchmark]: TraceAbstraction took 617342.76 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -69.5 MB). Peak memory consumption was 122.9 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:31,652 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.27 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 706.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1256.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.4 MB). Peak memory consumption was 86.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 617342.76 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -69.5 MB). Peak memory consumption was 122.9 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...